Grant: Discovery Grants Program - Individual
Dalhousie University
$28,000.00
Algorithms and data structures for memory hierarchies
EF 2016-17
Résumé
In an increasing number of application areas, massive amounts of data are collected and analyzed to extract the information needed for strategic business decisions and to make new scientific discoveries. Examples include Walmart's petabyte-sized customer transaction database, a massive index of web pages powering Google's search engine, the collection and analysis of large amounts of genome data made available through modern sequencing technologies, and the construction of massive, highly detailed geographic models using LIDAR technology and satellite imagery. These massive amounts of data present tremendous opportunities for new discoveries that were previously unimaginable, but extracting useful information from such data sets requires computational tools that are capable of processing them. The proposed research will lead to algorithms that form the heart of such tools, namely algorithms that make effective use of cache memory to speed up the processing of data sets beyond the size of main memory. It focuses on fundamental graph problems and problems in computational geometry that arise in a wide range of application domains and aims to develop sequential and parallel algorithms with high cache efficiency for the studied problems. The aim of the proposal is to gain fundamental theoretical insights into how to design cache-efficient sequential and parallel algorithms, but it also places an equally strong emphasis on engineering efficient implementations of the developed algorithms, in order to verify their practical usefulness and make them available to practitioners.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Nova Scotia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
298332-2012
Name nom
Zeh, Norbert
Department département
Computer Science, Faculty of
Organization id
79
Institution établissement
Dalhousie University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2016
Competition year année de concours
2012
Award amount
28000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
5
Nb partie
5
Application title
Algorithms and data structures for memory hierarchies
Keyword
NSERC
Application summary
In an increasing number of application areas, massive amounts of data are collected and analyzed to extract the information needed for strategic business decisions and to make new scientific discoveries. Examples include Walmart's petabyte-sized customer transaction database, a massive index of web pages powering Google's search engine, the collection and analysis of large amounts of genome data made available through modern sequencing technologies, and the construction of massive, highly detailed geographic models using LIDAR technology and satellite imagery. These massive amounts of data present tremendous opportunities for new discoveries that were previously unimaginable, but extracting useful information from such data sets requires computational tools that are capable of processing them. The proposed research will lead to algorithms that form the heart of such tools, namely algorithms that make effective use of cache memory to speed up the processing of data sets beyond the size of main memory. It focuses on fundamental graph problems and problems in computational geometry that arise in a wide range of application domains and aims to develop sequential and parallel algorithms with high cache efficiency for the studied problems. The aim of the proposal is to gain fundamental theoretical insights into how to design cache-efficient sequential and parallel algorithms, but it also places an equally strong emphasis on engineering efficient implementations of the developed algorithms, in order to verify their practical usefulness and make them available to practitioners.