Sciweavers

4747 search results - page 284 / 950
» Shuffle Memory System
Sort
View
HIPEAC
2009
Springer
15 years 9 months ago
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
Mohammad Ansari, Mikel Luján, Christos Kots...
IPPS
2000
IEEE
15 years 9 months ago
Fault-Tolerant Distributed-Shared-Memory on a Broadcast-Based Interconnection Network
The Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) is a low-latency, high-bandwidth interconnection network which directly links arbitrary pairs of processor nodes wit...
Diana Hecht, Constantine Katsinis
135
Voted
WOSP
1998
ACM
15 years 8 months ago
Predicting memory use from a class diagram using dynamic information
Increasingly, new applications are being built by composing existing software components rather than by coding a system from scratch. Using this approach, applications can be buil...
Gail C. Murphy, Ekaterina Saenko
MICRO
1997
IEEE
139views Hardware» more  MICRO 1997»
15 years 8 months ago
The Filter Cache: An Energy Efficient Memory Structure
Most modern microprocessors employ one or two levels of on-chip caches in order to improve performance. These caches are typically implemented with static RAM cells and often occu...
Johnson Kin, Munish Gupta, William H. Mangione-Smi...
IPPS
1996
IEEE
15 years 8 months ago
Dag-Consistent Distributed Shared Memory
We introduce dag consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming. We have implemented dag consistency in sof...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...