Grant: Discovery Grants Program - Individual
McGill University
$28,000.00
Optimizations and Designs for Practical Improvements to Program Performance on Multicore Systems
FY 2013-14
Summary
This research aims at improving the utilization of modern, multicore computers. Although these are now commonplace, the techniques required to develop software for such systems are still very complex, and achieving both correctness and efficiency are continuing concerns. Two approaches are used to address this issue. The first furthers work on a specific form of automatic parallelization: ""speculative multithreading"". This technique is applied internally by the runtime system to make use of multiple processors without programmer or user intervention. The result is a program that executes faster by using any available multiple cores. This has the advantage that the result applies to existing, legacy single-threaded programs, and does not require sophisticated parallel programming skills, although performance is not always the best possible. The second approach aims at improving support for newer programming languages and programming concepts that reduce some of the more subtle complexity found in existing, popular parallel programming languages. It is possible to achieve good efficiency with programming languages that provide access to low-level parallel programming constructs, but this also introduces correctness problems in the potential for ""data-races."" These kinds of bugs can be prevented through the use of new language designs and idioms, but the best approach is still unclear, and current implementation designs tend to result in trade-offs with program performance. The research work thus focuses on optimizing specific implementation designs, and developing new programming language paradigms that further reduce the complexity encountered by the programmer. Both of our main approaches target improvements in feasible and efficient use of parallel systems, and by addressing the core problem from two fundamental directions we expect to make significant improvements to current practice.
Program
Discovery Grants Program - Individual
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
249902-2012
Name nom
Verbrugge, Clark
Department département
Computer Science, School of
Organization id
61
Institution établissement
McGill University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
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
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2720
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Computer systems software
Research subject fr
Logiciel de systèmes informatiques
Partie
2
Nb partie
5
Application title
Optimizations and Designs for Practical Improvements to Program Performance on Multicore Systems
Keyword
NSERC
Application summary
This research aims at improving the utilization of modern, multicore computers. Although these are now commonplace, the techniques required to develop software for such systems are still very complex, and achieving both correctness and efficiency are continuing concerns. Two approaches are used to address this issue. The first furthers work on a specific form of automatic parallelization: ""speculative multithreading"". This technique is applied internally by the runtime system to make use of multiple processors without programmer or user intervention. The result is a program that executes faster by using any available multiple cores. This has the advantage that the result applies to existing, legacy single-threaded programs, and does not require sophisticated parallel programming skills, although performance is not always the best possible. The second approach aims at improving support for newer programming languages and programming concepts that reduce some of the more subtle complexity found in existing, popular parallel programming languages. It is possible to achieve good efficiency with programming languages that provide access to low-level parallel programming constructs, but this also introduces correctness problems in the potential for ""data-races."" These kinds of bugs can be prevented through the use of new language designs and idioms, but the best approach is still unclear, and current implementation designs tend to result in trade-offs with program performance. The research work thus focuses on optimizing specific implementation designs, and developing new programming language paradigms that further reduce the complexity encountered by the programmer. Both of our main approaches target improvements in feasible and efficient use of parallel systems, and by addressing the core problem from two fundamental directions we expect to make significant improvements to current practice.