1855 search results - page 309 / 371 » A coding theorem for distributed computation |
240
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
141
click to vote
COORDINATION
2009
Springer
16 years 4 months ago
2009
Springer
This paper presents a transactional framework for low-latency, high-performance, concurrent event processing in Java. At the heart of our framework lies Reflexes, a restricted prog...
114
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
Transactional Memory (TM) is being studied widely as a new technique for synchronizing concurrent accesses to shared memory data structures for use in multi-core systems. Much of ...
148
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...
138
click to vote
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art opt...