Sciweavers

241 search results - page 8 / 49
» Thread Partitioning and Scheduling Based on Cost Model
Sort
View
RTCSA
1999
IEEE
14 years 21 days ago
Scheduling Fixed-Priority Tasks with Preemption Threshold
While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as co...
Yun Wang, Manas Saksena
ADAEUROPE
2010
Springer
13 years 6 months ago
Scheduling Configuration of Real-Time Component-Based Applications
Abstract: This paper proposes a strategy to manage the schedulability of realtime component-based applications that is fully compatible with the concept of component viewed as a re...
Patricia López Martínez, Laura Barro...
HIPC
2005
Springer
14 years 1 months ago
Scheduling Multiple Flows on Parallel Disks
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is ...
Ajay Gulati, Peter J. Varman
PDIS
1994
IEEE
14 years 16 days ago
An Efficient Parallel Join Algorithm Based On Hypercube-Partitioning
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
Hwan-Ik Choi, Byoung Mo Im, Myoung-Ho Kim, Yoon-Jo...
KBSE
2009
IEEE
14 years 3 months ago
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...