Sciweavers

456 search results - page 51 / 92
» Alternative priority scheduling in dynamic priority systems
Sort
View
RTSS
1998
IEEE
13 years 12 months ago
Improved Response-Time Analysis Calculations
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
Mikael Sjödin, Hans Hansson
JLP
2011
155views more  JLP 2011»
13 years 2 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari
DAC
1989
ACM
13 years 11 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
RTSS
2007
IEEE
14 years 1 months ago
Generalized Tardiness Bounds for Global Multiprocessor Scheduling
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...
Hennadiy Leontyev, James H. Anderson
CCGRID
2005
IEEE
14 years 1 months ago
Experiences with the KOALA co-allocating scheduler in multiclusters
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multip...
Hashim H. Mohamed, Dick H. J. Epema