Sciweavers

10106 search results - page 8 / 2022
» Algorithm Selection and Scheduling
Sort
View
ICC
2000
IEEE
137views Communications» more  ICC 2000»
13 years 11 months ago
Stability of Maximal Size Matching Scheduling in Input-Queued Cell Switches
— We consider cell-based switch architectures in which the speedup of the internal switching fabric is not large enough to avoid input buffering. These architectures require a sc...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
RTCSA
1999
IEEE
13 years 11 months ago
Scheduling Fault-Tolerant Distributed Hard Real-Time Tasks Independently of the Replication Strategies
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
Pascal Chevochot, Isabelle Puaut
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
SIGMETRICS
2006
ACM
128views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
GPS scheduling: selection of optimal weights and comparison with strict priorities
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
Pascal Lieshout, Michel Mandjes, Sem C. Borst
OTM
2005
Springer
14 years 26 days ago
QoS-Aware Composition of Web Services: An Evaluation of Selection Algorithms
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...
Michael C. Jaeger, Gero Mühl, Sebastian Golze