Abstract | ||
---|---|---|
Software Transactional Memory (STM) Systems have been proposed in order to make parallel programs easier to develop and verify compared to conventional lock-based programming techniques. However, conventional STMs do not scale in performance to a large number of concurrent threads for several classes of applications. While the atomicity semantics of traditional STMs greatly simplify the correct sharing of data between threads, these same atomicity semantics incur a large penalty in program execution time. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/PACT.2007.62 | PACT |
Keywords | Field | DocType |
traditional stms,relaxed consistency software transactional,correct sharing,conventional lock-based programming technique,software transactional memory,large number,conventional stms,large penalty,parallel program,atomicity semantics,concurrent thread,data access,transaction processing,formal specification,parallel programming | Atomicity,Transaction processing,Software transactional memory,Programmer,Programming language,Computer science,Parallel computing,Real-time computing,Formal specification,Thread (computing),Transactional memory,Consistency model | Conference |
ISSN | ISBN | Citations |
1089-795X | 0-7695-2944-5 | 4 |
PageRank | References | Authors |
0.42 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jaswanth Sreeram | 1 | 47 | 5.90 |
Romain Cledat | 2 | 67 | 4.61 |
Tushar Kumar | 3 | 16 | 2.82 |
Santosh Pande | 4 | 567 | 59.76 |