A generalized admissions control strategy for heterogeneous, distributed multimedia systems

This paper presents a generalized admissions control strategy for providing timing guarantees to multimedia applications executing over a set of distributed, heterogeneous system resources. This paper illustrates complications that arise in moving from resource-specific to generalized admissions control and introduces a strategy that can be used to solve some of these problems. Key elements of this Distributed Pipeline Admissions Control Strategy include (i) a resource-independent model for representing multimedia applications requiring access to an heterogeneous set of system resources, (ii) an uniform model for representing a set of heterogeneous system resources, (iii) a real-time heterogeneous resource allocation and routing algorithm, (iv) distributed pipeline scheduling policies that result in efficient and predictable resource usage by clients, and (v) a divide-and-conquer timing analysis technique for ascertaining whether client timing requirements are met. An audio/video example is provided to illustrate the application of this approach.

[1]  Jay K. Strosnider,et al.  Engineering and analysis of real-time operating systems , 1993 .

[2]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[3]  Jay K. Strosnider,et al.  Distributed Pipeline Scheduling: A Framework for Distributed, Heterogeneous Real-Time System Design , 1995, Comput. J..

[4]  Shirish Sharad Sathaye.  Scheduling real-time traffic in packet-switched networks , 1993 .

[5]  Ramesh Nagarajan,et al.  HeiRAT: The Heidelberg Resource Administration Technique Design Philosophy and Goals , 1993, Kommunikation in Verteilten Systemen.

[6]  S. Jamaloddin Golestani.  Congestion-free transmission of real-time traffic in packet networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[7]  Ragunathan Rajkumar,et al.  On Predictable Operating System Protocol Processing , 1994 .

[8]  Jay K. Strosnider,et al.  Distributed pipeline scheduling: end-to-end analysis of heterogeneous, multi-resource real-time systems , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[9]  Daniel P. Siewiorek,et al.  Automated task allocation and processor specification strategies for multi-computer systems , 1994 .

[10]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[11]  U. Chandra,et al.  Predictability of program execution times on superscalar pipelined architectures , 1995, Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems.

[12]  Ralf Steinmetz,et al.  Resource Management in Multimedia Networked Systems , 1994 .

[13]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[14]  Domenico Ferrari,et al.  Client requirements for real-time communication services , 1990, IEEE Communications Magazine.

[15]  Nick Roussopoulos,et al.  Timing Requirements for Time-Driven Systems Using Augmented Petri Nets , 1983, IEEE Transactions on Software Engineering.

[16]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[17]  Jyh-Charn Liu,et al.  Deterministic upperbounds of the worst-case execution times of cached programs , 1994, 1994 Proceedings Real-Time Systems Symposium.

[18]  Domenico Ferrari.  Client requirements for real-time communication services , 1990 .

[19]  Radia Perlman.  Interconnections: Bridges and Routers , 1992 .

[20]  W.M. Seifert.  Bridges and routers , 1988, IEEE Network.

[21]  David P. Anderson,et al.  SRP: A Resource Reservation Protocol for Guaranteed-Performance , 1990 .