Dynamic scheduling of distributed method invocations

Authors:
V. Kalogeraki;P. M. Melliar-Smith;L. E. Moser
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Year:
2000

Citing 15
Cited 5

The Spring kernel: a new paradigm for real-time operating systems

ACM SIGOPS Operating Systems Review
Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
Load profiling in distributed real-time systems

Information Sciences: an International Journal
QoS-aware resource management for distributed multimedia applications

Journal of High Speed Networks - Special issue on multimedia networking
An Automated Profiling Subsystem for QoS-Aware Services

RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
A Dynamic Quality of Service Middleware Agent for Mediating Application Resource Usage

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Cooperative Scheduling of Multiple Resources

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Implementing a General Real-Time Scheduling Framework in the RED-Linux Real-Time Kernel

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Real-time scheduling using compact task graphs

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Using Multiple Feedback Loops for Object Profiling, Scheduling and Migration in Soft Real-Time Distributed Object Systems

ISORC '99 Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Monitoring Distributed Real-Time Activities in DCOM

ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Dynamic Scheduling for Soft Real-Time Distributed Object Systems

ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Scheduling Solutions for Supporting Dependable Real-Time Applications

ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Vassal: loadable scheduler support for multi-policy scheduling

WINSYM'98 Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2
The Realize middleware for replication and resource management

Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing

Empirical Differences between COTS Middleware Scheduling Strategies

On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Resource management using multiple feedback loops in soft real-time distributed object systems

Journal of Systems and Software
Towards middleware for fault-tolerance in distributed real-time and embedded systems

DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Scheduling for real-time mobile MapReduce systems

Proceedings of the 5th ACM international conference on Distributed event-based system
Towards self-managing qos-enabled peer-to-peer systems

Self-star Properties in Complex Information Systems

Quantified Score

Hi-index	0.00

Visualization

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 another, yielding a system-wide scheduling algorithm that requires only local computations. Experimental results validate our scheduling algorithm, and show that it has minimal overhead.