Sciweavers

554 search results - page 74 / 111
» Approximability of OFDMA Scheduling
Sort
View
HPDC
2006
IEEE
15 years 3 months ago
Adaptive I/O Scheduling for Distributed Multi-applications Environments
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
Adrien Lebre, Yves Denneulin, Guillaume Huard, Prz...
IPPS
2000
IEEE
15 years 2 months ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
ECRTS
2005
IEEE
15 years 3 months ago
Task Assignment on Uniform Heterogeneous Multiprocessors
The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is a...
Shelby Funk, Sanjoy K. Baruah
IPPS
2003
IEEE
15 years 3 months ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 2 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...