Conference Paper

Scheduling solutions for supporting dependable real-timeapplications

PDCC, Consorzio Pisa Ricerche;
DOI: 10.1109/ISORC.2000.839519 Conference: Object-Oriented Real-Time Distributed Computing, 2000. (ISORC 2000) Proceedings. Third IEEE International Symposium on
Source: DBLP

ABSTRACT This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach which applies tolerance to timing violations. According to TAFT, a task is structured in a pair, to guarantee that deadlines are met (although possibly offering a degraded service) without requiring the knowledge of task attributes difficult to estimate in practice. Wide margin of actions is left by the TAFT approach in scheduling the task pairs, leading to disparate performances; up to now, poor attention has been devoted to analyse this aspect. The goal of this work is to investigate on the most appropriate scheduling policies to adopt in a system structured in the TAFT fashion, in accordance with system conditions and application requirements. To this end, all experimental evaluation will be conducted based on a variety of scheduling policies, to derive useful indications for the system designer about the most rewarding policies to apply

0 Bookmarks
 · 
50 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Summary form only given. Peer-to-peer (P2P) systems have the potential to support large-scale distributed applications by utilizing resources from a vast number of individual computers across geographically distributed areas. However, current P2P systems provide limited scheduling and resource management support to distributed applications with QoS requirements, such as timing demands. We study a utility-based scheduling approach that schedules multimedia streams in P2P systems. Our scheme determines the schedule of tasks using EDF scheduling algorithm, and adapts the delivered QoS levels of tasks according to current resource conditions at individual nodes.
    Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International; 05/2004
  • Source
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Distributed method invocations require dynamic scheduling algorithms and efficient resource projections to provide timeliness guarantees to application objects. In this paper we present a dynamic scheduling algorithm that examines the computation times, real times and resource requirements of the application tasks to determine a feasible schedule for the method invocations. The schedule is driven by the laxities of the tasks and the importance that the tasks have to the system. Tasks span processor boundaries, and request messages carry scheduling parameters (laxity values) from one processor to anothel; yielding a system-wide scheduling algorithm that requires only local computations. Experimental results validate our scheduling algorithm, and show that it has minimal overhead.
    2011 IEEE 32nd Real-Time Systems Symposium. 02/2000;

Full-text (2 Sources)

View
12 Downloads
Available from
May 28, 2014