Sciweavers

1156 search results - page 127 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
IPPS
2008
IEEE
14 years 4 months ago
Early experience with out-of-core applications on the Cray XMT
This paper describes our early experiences with a preproduction Cray XMT system that implements a scalable shared memory architecture with hardware support for multithreading. Unl...
Daniel G. Chavarría-Miranda, Andrès ...
EUROPAR
2004
Springer
14 years 3 months ago
A Data Structure Oriented Monitoring Environment for Fortran OpenMP Programs
This paper describes a monitoring environment that enables the analysis of memory access behavior of applications in a selective way with a potentially very high degree of detail. ...
Edmond Kereku, Tianchao Li, Michael Gerndt, Josef ...
IPPS
1998
IEEE
14 years 2 months ago
An Efficient Counting Network
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
Costas Busch, Marios Mavronicolas
GRID
2007
Springer
14 years 4 months ago
A highly available job execution service in computational service market
— One of the major challenges in managing resources of computational Grids with diverse shared resources is how to meet users' QoS requirements and rationally distribute res...
Woochul Kang, H. Howie Huang, Andrew S. Grimshaw
SPAA
1995
ACM
14 years 1 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias