Sciweavers

509 search results - page 19 / 102
» A New Multiport Memory for High Performance Parallel Process...
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
HIPC
2004
Springer
14 years 28 days ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
EUROPAR
2010
Springer
13 years 8 months ago
Profile-Driven Selective Program Loading
Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared li...
Tugrul Ince, Jeffrey K. Hollingsworth
PADS
2005
ACM
14 years 1 months ago
Seven-O'Clock: A New Distributed GVT Algorithm Using Network Atomic Operations
In this paper we introduce a new concept, network atomic operations (NAOs) to create a zero-cost consistent cut. Using NAOs, we define a wall-clock-time driven GVT algorithm call...
David W. Bauer, Garrett R. Yaun, Christopher D. Ca...
ISPAN
2000
IEEE
13 years 12 months ago
Versatile Processor Design for Efficiency and High Performance
We present new architectural concepts for uniprocessor designs that conform to the data-driven computation paradigm. Usage of our D2 -CPU (Data-Driven processor) follows the natura...
Sotirios G. Ziavras