Sciweavers

Share
10 search results - page 2 / 2
» I O Processor Allocation for Mesh Cluster Computers
Sort
View
TPDS
1998
92views more  TPDS 1998»
11 years 5 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
CLUSTER
2002
IEEE
11 years 10 months ago
I/O Analysis and Optimization for an AMR Cosmology Application
In this paper, we investigate the data access patterns and file I/O behaviors of a production cosmology application that uses the adaptive mesh refinement (AMR) technique for it...
Jianwei Li, Wei-keng Liao, Alok N. Choudhary, Vale...
PROCEDIA
2010
148views more  PROCEDIA 2010»
11 years 4 days ago
SysCellC: a data-flow programming model on multi-GPU
High performance computing with low cost machines becomes a reality with GPU. Unfortunately, high performances are achieved when the programmer exploits the architectural specific...
Dominique Houzet, Sylvain Huet, Anis Rahman
ICS
2000
Tsinghua U.
11 years 9 months ago
A simulation-based study of scheduling mechanisms for a dynamic cluster environment
Scheduling of processes onto processors of a parallel machine has always been an important and challenging area of research. The issue becomes even more crucial and di cult as we ...
Yanyong Zhang, Anand Sivasubramaniam, José ...
HPDC
1999
IEEE
11 years 9 months ago
Dodo: A User-level System for Exploiting Idle Memory in Workstation Clusters
In this paper, we present the design and implementation of Dodo, an e cient user-level system for harvesting idle memory in o -the-shelf clusters of workstations. Dodo enables dat...
Samir Koussih, Anurag Acharya, Sanjeev Setia
books