Sciweavers

8 search results - page 1 / 2
» Better Real-Time Response for Time-Share Scheduling
Sort
View
IPPS
2003
IEEE
13 years 9 months ago
Better Real-Time Response for Time-Share Scheduling
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...
Scott A. Banachowski, Scott A. Brandt
ICPP
1998
IEEE
13 years 8 months ago
Response Time Analysis for Distributed Real-Time Systems with Bursty Job Arrivals
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
Chengzhi Li, Riccardo Bettati, Wei Zhao
CCGRID
2011
IEEE
12 years 8 months ago
Towards Real-Time, Volunteer Distributed Computing
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resourc...
Sangho Yi, Emmanuel Jeannot, Derrick Kondo, David ...
IPPS
2003
IEEE
13 years 9 months ago
Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
Josep M. Banús, Alex Arenas, Jesús L...
RTAS
2008
IEEE
13 years 10 months ago
Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements
To achieve better throughput, many hard drive manufacturers use internal queues and scheduling to take advantage of vendor-specific characteristics and knowledge. While this tren...
Mark J. Stanovich, Theodore P. Baker, An-I Andy Wa...