Sciweavers

75 search results - page 4 / 15
» Sharing Memory Robustly in Message-Passing Systems
Sort
View
ISCA
1998
IEEE
114views Hardware» more  ISCA 1998»
15 years 1 months ago
The MIT Alewife Machine: Architecture and Performance
Alewife is a multiprocessor architecture that supports up to 512 processing nodes connected over a scalable and cost-effective mesh network at a constant cost per node. The MIT Al...
Anant Agarwal, Ricardo Bianchini, David Chaiken, K...
CSSE
2008
IEEE
15 years 3 months ago
The Relation of Version Control to Concurrent Programming
Version control helps coordinating a group of people working concurrently to achieve a shared objective. Concurrency control helps coordinating a group of threads working concurre...
Annette Bieniusa, Peter Thiemann, Stefan Wehr
IPPS
2003
IEEE
15 years 2 months ago
A Framework for Portable Shared Memory Programming
Widespread adaptation of shared memory programming for High Performance Computing has been inhibited by a lack of standardization and the resulting portability problems between pl...
Martin Schulz, Sally A. McKee
PLDI
2012
ACM
12 years 12 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
94
Voted
RTSS
2009
IEEE
15 years 4 months ago
Timing Analysis of Concurrent Programs Running on Shared Cache Multi-Cores
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
Yan Li, Vivy Suhendra, Yun Liang, Tulika Mitra, Ab...