2300 search results - page 363 / 460 » Maximally Concurrent Programs |
144
click to vote
CAV
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
103
click to vote
HPCA
2007
IEEE
16 years 2 months ago
2007
IEEE
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
210
click to vote
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
We describe an approach for pipelining nested data collections in scientific workflows. Our approach logically delimits arbitrarily nested collections of data tokens using special...
129
click to vote
MOBISYS
2003
ACM
16 years 1 months ago
2003
ACM
This paper introduces adaptation-aware editing and progressive update propagation, two novel mechanisms that enable authoring multimedia content and collaborative work on mobile d...
106
click to vote
ICCAD
2004
IEEE
15 years 11 months ago
2004
IEEE
Wire pipelining emerges as a new necessity for global wires due to increasing wire delay, shrinking clock period and growing chip size. Existing approaches on wire pipelining are ...