Distributed Multimedia Application Configuration Management

Employing distributed multimedia applications (DMA) requires management support for multiple configuration steps including the definition of a desired DMA topology, the specification of a desired quality of service (QoS) and its enforcement through resource reservation. In this paper, we examine the additional aspect of finding an appropriate placement for a DMA within a distributed computer system (DCS). An overall approach is described for interrelating placement functions with existing procedures for topology and QoS specification and resource reservation. Then the problem of assigning a DMA within a DCS is formulated with the goal of finding a DMA placement with minimized computation and communication cost. For solving the assignment problem an efficient heuristic algorithm-SIGMA-is presented. Unlike other approaches, SIGMA takes into account requirements, which are specific for multimedia applications. Based on experiments conducted for randomly generated DMA and DCS graphs, the efficiency and accuracy of SIGMA is shown to be encouraging because, at low execution times, it finds assignments with cost very close to the optimal one.

[1]  C. Murray Woodside,et al.  Fast Allocation of Processes in Distributed and Parallel Systems , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Cormac J. Sreenan.  Resource management system for a broadband multipoint bridge , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[3]  Kurt Rothermel,et al.  TIEMPO: temporal modeling and authoring of interactive multimedia , 1995, Proceedings of the International Conference on Multimedia Computing and Systems.

[4]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[5]  Andy Hopper,et al.  Enhancing network services through multimedia data analysers , 1997, MULTIMEDIA '96.

[6]  Sudhakar Yalamanchili,et al.  Partitioning and mapping in embedded multiprocessor architectures in the presence of constraints , 1995, Concurr. Pract. Exp..

[7]  Bjørn Olstad,et al.  Efficient Partitioning of Sequences , 1995, IEEE Trans. Computers.

[8]  David M. Nicol,et al.  Improved Algorithms for Mapping Pipelined and Parallel Computations , 1991, IEEE Trans. Computers.

[9]  Lars C. Wolf,et al.  Resource Management for Distributed Multimedia Systems , 1996, Springer US.

[10]  Kurt Rothermel,et al.  An Architecture for a Distributed Stream Synchronization Service , 1996, IDMS.

[11]  Myunghwan Kim,et al.  Optimal Task Assignment in Linear Array Networks , 1992, IEEE Trans. Computers.

[12]  Steven McCanne,et al.  An application level video gateway , 1995, MULTIMEDIA '95.

[13]  Shahid H. Bokhari,et al.  Efficient Algorithms for a Class of Partitioning Problems , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Michael G. Norman,et al.  Models of machines and computation for mapping in multicomputers , 1993, CSUR.

[15]  Vassilis Zissimopoulos,et al.  On the Task Assignment Problem: Two New Efficient Heuristic Algorithms , 1997, J. Parallel Distributed Comput..

[16]  Gordon S. Blair,et al.  An Integrated Platform and Computational Model for Open Distrinuted Multimedia Applications , 1992, NOSSDAV.

[17]  Kurt Rothermel,et al.  Clock Hierarchies: An Abstraction for Grouping and Controlling Media Streams , 1996, IEEE J. Sel. Areas Commun..

[18]  Shahid H. Bokhari,et al.  Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1988, IEEE Trans. Computers.

[19]  Alain Billionnet.  Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs , 1994, IEEE Trans. Parallel Distributed Syst..

[20]  Kurt Rothermel,et al.  QoS negotiation and resource reservation for distributed multimedia applications , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[21]  Walter Fiederer,et al.  A negotiation and resource reservation protocol (NRP) for configurable multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[22]  Donald F. Towsley,et al.  Allocating programs containing branches and loops within a multiple processor system , 1986, IEEE Transactions on Software Engineering.

[23]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[24]  David Fernández-Baca,et al.  Allocating Modules to Processors in a Distributed System , 1989, IEEE Trans. Software Eng..

[25]  Kurt Rothermel,et al.  Cinema - An architecture for distributed multimedia applications , 1993, Architecture and Protocols for High-Speed Networks.

[26]  Shahid H. Bokhari,et al.  Assignment Problems in Parallel and Distributed Computing , 1987 .

[27]  Pierre Hansen,et al.  Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing , 1992, IEEE Trans. Computers.

[28]  M SmithJonathan,et al.  The QOS Broker , 1995 .

[29]  Kurt Rothermel,et al.  A communication infrastructure for multimedia applications , 1996 .

[30]  Ingo Barth.  Configuring distributed multimedia applications using CINEMA , 1996, Proceedings International Workshop on Multimedia Software Development.

[31]  Klara Nahrstedt,et al.  The QOS Broker , 1995, IEEE Multim..

[32]  Y. Wang,et al.  GRMS: a global resource management system for distributed QoS and criticality support , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[33]  Donald F. Towsley.  Allocating programs containing branches and loops within a multiple processor system , 1986, IEEE Transactions on Software Engineering.

[34]  Kurt Rothermel,et al.  An adaptive protocol for synchronizing media streams , 1997, Multimedia Systems.

[35]  Alain Billionnet,et al.  An Algorithm for Finding the K-Best Allocations of a Tree Structured Program , 1995, J. Parallel Distributed Comput..

[36]  Kang G. Shin,et al.  Optimal Task Assignment in Homogeneous Networks , 1997, IEEE Trans. Parallel Distributed Syst..