Sciweavers

7758 search results - page 364 / 1552
» On the Number of Distributive Lattices
Sort
View
LCPC
1997
Springer
15 years 11 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
BMCBI
2006
151views more  BMCBI 2006»
15 years 6 months ago
Modeling Sage data with a truncated gamma-Poisson model
Background: Serial Analysis of Gene Expressions (SAGE) produces gene expression measurements on a discrete scale, due to the finite number of molecules in the sample. This means t...
Helene H. Thygesen, Aeilko H. Zwinderman
CCGRID
2002
IEEE
15 years 11 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
IPPS
2010
IEEE
15 years 4 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
ICPP
1999
IEEE
15 years 11 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward