
NSF Org: |
CCF Division of Computing and Communication Foundations |
Recipient: |
|
Initial Amendment Date: | June 17, 2014 |
Latest Amendment Date: | June 17, 2014 |
Award Number: | 1421126 |
Award Instrument: | Standard Grant |
Program Manager: |
Anindya Banerjee
abanerje@nsf.gov (703)292-7885 CCF Division of Computing and Communication Foundations CSE Directorate for Computer and Information Science and Engineering |
Start Date: | July 1, 2014 |
End Date: | August 31, 2015 (Estimated) |
Total Intended Award Amount: | $250,000.00 |
Total Awarded Amount to Date: | $250,000.00 |
Funds Obligated to Date: |
|
History of Investigator: |
|
Recipient Sponsored Research Office: |
70 WASHINGTON SQ S NEW YORK NY US 10012-1019 (212)998-2121 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
251 Mercer Street New York NY US 10012-1110 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): | Software & Hardware Foundation |
Primary Program Source: |
|
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.070 |
ABSTRACT
SHF: Small: Collaborative Research: Concurrent Programming with Composable Transactional Objects
With multicore architectures becoming increasingly prevalent, the problem of constructing scalable and efficient concurrent software has attracted increasing attention. There has been growing interest programming models that allow programmers to demarcate regions of thread code---so-called transactions---that should appear to occur atomically, when viewed from the perspective of other threads.
The premise of this project is that current, monolithic software transactional memory (STM) designs are inherently too inefficient and permit too little parallelism. Instead we propose a very different approach: a library of customized concurrent data structures that can be composed, through a very light-weight run-time, to form transactions. Each data structure is optimized to exploit the semantics of its type. The intellectual merits are the development of new type-specific synchronization and recovery algorithms, along with formal tools to reason about their correctness. These ideas will be embodied in a novel concurrency library and verification toolkit, which will be used to construct benchmarks and applications. The boarder impacts involve incorporating concurrency into education and the potential to benefit society through higher performing, more reliable, and less expensive software.
Please report errors in award information by writing to: awardsearch@nsf.gov.