Sciweavers

223 search results - page 9 / 45
» Improving First-Come-First-Serve Job Scheduling by Gang Sche...
Sort
View
ICS
1999
Tsinghua U.
13 years 11 months ago
Reorganizing global schedules for register allocation
Instruction scheduling is an important compiler technique for exploiting more instruction-level parallelism (ILP) in high-performance microprocessors, and in this paper, we study ...
Gang Chen, Michael D. Smith
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
14 years 1 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
JSSPP
2004
Springer
14 years 27 days ago
Are User Runtime Estimates Inherently Inaccurate?
Computer system batch schedulers typically require information from the user upon job submission, including a runtime estimate. Inaccuracy of these runtime estimates, relative to ...
Cynthia Bailey Lee, Yael Schwartzman, Jennifer Har...
CLUSTER
2006
IEEE
13 years 7 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
WSC
2008
13 years 9 months ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky