Multiple servers and capacity sharing for implementing flexible scheduling

Real-Time Systems

Volumn 22, Issue 1-2, 2002, Pages 49-75

  Bernat, Guillem ^a   Burns, Alan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Aperiodic servers; Flexible scheduling

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PERFORMANCE; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS);

APERIODIC SERVERS; CAPACITY SHARING PROTOCOL; FLEXIBLE SCHEDULING; MULTIPLE SERVERS;

REAL TIME SYSTEMS;

EID: 0036155399     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013481420080     Document Type: Article

References (13)

1. New results on fixed priority aperiodic servers
2. Scheduling hard real-time systems: A review
3. Minimizing aperiodic response times in a firm real-time environment
4. Performance of algorithms for scheduling real-time systems with overrun and overload
5. Aperiodic servers in a deadline scheduling environment
6. Draft information technology - Portable operating systems interface (POSIX): Part I: System application program interface (API) [C language] - Amendment
7. Enhanced aperiodic responsiveness in hard real-time environment
8. Processor capacity reserves: Operating system support for multimedia applications
9. Exploting unused periodic time for aperiodic service using the extended priority exchange algorithm
10. A periodic task scheduling for hard real-time systems
11. Robust aperiodic scheduling under dynamic priority systems
12. Implementation of hierarchical schedulers in the RED-linus scheduling framework