Sciweavers

502 search results - page 26 / 101
» Efficient Structured Data Access in Parallel File Systems
Sort
View
GCC
2003
Springer
14 years 1 months ago
Dynamic Data Grid Replication Strategy Based on Internet Hierarchy
Abstract. In data grid, large quantity of data files is produced and data replication is applied to reduce data access time. Efficiently utilizing grid resources becomes important ...
Sang-Min Park, Jai-Hoon Kim, Young-Bae Ko, Won-Sik...
CCGRID
2003
IEEE
14 years 2 months ago
Noncontiguous I/O Accesses Through MPI-IO
I/O performance remains a weakness of parallel computing systems today. While this weakness is partly attributed to rapid advances in other system components, I/O interfaces avail...
Avery Ching, Alok N. Choudhary, Kenin Coloma, Wei-...
PPOPP
2010
ACM
14 years 6 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
PDIS
1994
IEEE
14 years 26 days ago
Exposing I/O Concurrency with Informed Prefetching
Informed prefetching provides a simple mechanism for I/O-intensive, cache-ineffective applications to efficiently exploit highly-parallel I/O subsystems such as disk arrays. This ...
R. Hugo Patterson, Garth A. Gibson
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
14 years 2 months ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin