1015 search results - page 159 / 203 » Syntactic Control of Concurrency |
79
Voted
SIGSOFT
2009
ACM
15 years 10 months ago
2009
ACM
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...
HPCA
2007
IEEE
15 years 10 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...
161
click to vote
SIGMOD
2005
ACM
15 years 10 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...
167
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
Immortal DB builds transaction time database support into the SQL Server engine, not in middleware. Transaction time databases retain and provide access to prior states of a datab...
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...