Sciweavers

359 search results - page 22 / 72
» Order Scheduling Models: Hardness and Algorithms
Sort
View
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
14 years 1 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
ICPADS
1998
IEEE
13 years 12 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
ICDE
1999
IEEE
126views Database» more  ICDE 1999»
14 years 9 months ago
Improving the Access Time Performance of Serpentine Tape Drives
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
Olav Sandstå, Roger Midtstraum
IJIT
2004
13 years 9 months ago
Design of Gain Scheduled Fuzzy PID Controller
An adaptive fuzzy PID controller with gain scheduling is proposed in this paper. The structure of the proposed gain scheduled fuzzy PID (GS_FPID) controller consists of both fuzzy ...
Leehter Yao, Chin-chin Lin
ANOR
2007
80views more  ANOR 2007»
13 years 7 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...