Sciweavers

139 search results - page 26 / 28
» Scheduling equal-length jobs on identical parallel machines
Sort
View
JSSPP
2007
Springer
16 years 5 days ago
Enhancing an Open Source Resource Manager with Multi-core/Multi-threaded Support
Current resource managers do not have adequate node allocation and distribution strategies to efficiently schedule jobs on multi-core multi-threaded systems. Clusters composed of ...
Susanne M. Balle, Daniel J. Palermo
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 8 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz
HPDC
2003
IEEE
15 years 11 months ago
SODA: A Service-On-Demand Architecture for Application Service Hosting Utility Platforms
The Grid is realizing the vision of providing computation as utility: computation jobs can be scheduled on-demand in Grid hosts based on available computation capacity. In this pa...
Xuxian Jiang, Dongyan Xu
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 11 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
BIRTHDAY
2009
Springer
15 years 10 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg