Sciweavers

1243 search results - page 85 / 249
» FPZL Schedulability Analysis
Sort
View
80
Voted
SPAA
1990
ACM
15 years 4 months ago
Low Overhead Parallel Schedules for Task Graphs
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
Richard J. Anderson, Paul Beame, Walter L. Ruzzo
97
Voted
RTSS
1995
IEEE
15 years 4 months ago
Dual Priority Scheduling
In this paper, we present a new strategy for providing flexibility in hard real-time systems. This approach, based on dual priorities, retains the offline guarantees afforded to...
Robert I. Davis, Andy J. Wellings
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
15 years 2 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
129
Voted
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 1 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
87
Voted
IAJIT
2010
94views more  IAJIT 2010»
14 years 11 months ago
Multiple Warehouses Scheduling Using Steady State. Genetic Algorithms
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
Jalal Atoum, Mamoun Al Rababaa