Sciweavers

5683 search results - page 130 / 1137
» Interactive Schedulability Analysis
Sort
View
109
Voted
RTSS
2009
IEEE
15 years 10 months ago
Gang EDF Scheduling of Parallel Task Systems
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...
Shinpei Kato, Yutaka Ishikawa
WIOPT
2006
IEEE
15 years 10 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi
IPPS
2003
IEEE
15 years 9 months ago
Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling
With the emergence of grid computing environment, performance measurement, analysis and prediction of non-dedicated distributed systems have become increasingly important. In this...
Xian-He Sun, Ming Wu
INTERACT
2003
15 years 5 months ago
Requirements Engineering with Contextual Design and RUP
: Models from methods like Contextual Design (CD) are a sound basis for requirements engineering. But current software engineering processes are not prepared to use such models. To...
Markus Flückiger
FMSB
2008
199views Formal Methods» more  FMSB 2008»
15 years 5 months ago
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
Jasmin Fisher, Thomas A. Henzinger, Maria Mateescu...