Sciweavers

4747 search results - page 944 / 950
» Shuffle Memory System
Sort
View
JSA
2000
115views more  JSA 2000»
13 years 7 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
CONCURRENCY
1998
87views more  CONCURRENCY 1998»
13 years 7 months ago
Titanium: A High-performance Java Dialect
Titanium is a language and system for high-performance parallel scientific computing. Titanium uses Java as its base, thereby leveraging the advantages of that language and allow...
Katherine A. Yelick, Luigi Semenzato, Geoff Pike, ...
PC
2002
114views Management» more  PC 2002»
13 years 7 months ago
Optimizing noncontiguous accesses in MPI-IO
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...
Rajeev Thakur, William Gropp, Ewing L. Lusk
INFOCOM
2010
IEEE
13 years 5 months ago
Enabling a Bufferless Core Network Using Edge-to-Edge Packet-Level FEC
— Internet traffic is expected to grow phenomenally over the next five to ten years, and to cope with such large traffic volumes, core networks are expected to scale to capaci...
Arun Vishwanath, Vijay Sivaraman, Marina Thottan, ...
TROB
2008
154views more  TROB 2008»
13 years 5 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós