Sciweavers

5683 search results - page 181 / 1137
» Interactive Schedulability Analysis
Sort
View
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
15 years 6 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...
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 5 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
IAJIT
2010
94views more  IAJIT 2010»
15 years 2 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
JSAC
2011
100views more  JSAC 2011»
14 years 7 months ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Juan José Jaramillo, R. Srikant, Lei Ying
OSDI
2000
ACM
15 years 5 months ago
Policies for Dynamic Clock Scheduling
Pocket computers are beginning to emerge that provide sufficient processing capability and memory capacity to run traditional desktop applications and operating systems on them. T...
Dirk Grunwald, Philip Levis, Keith I. Farkas, Char...