Sciweavers

575 search results - page 57 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
CCGRID
2002
IEEE
14 years 2 months ago
Sensitivity of Cluster File System Access to I/O Server Selection
This paper describes measurement tests of Parallel Virtual File System (PVFS) and Network File System (NFS) over a commodity Linux cluster connected with Myrinet. PVFS stores a ...
Amy W. Apon, P. D. Wolinski, G. M. Amerson
EOR
2008
52views more  EOR 2008»
13 years 9 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
IPPS
2003
IEEE
14 years 2 months ago
Partitioning with Space-Filling Curves on the Cubed-Sphere
Numerical methods for solving the systems of partial differential equations arising in geophysical fluid dynamics rely on a variety of spatial discretization schemes (e.g. finit...
John M. Dennis
TC
2010
13 years 4 months ago
Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
Anne Benoit, Loris Marchal, Jean-Francois Pineau, ...
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...