Coordinated CPU and event scheduling for distributed multimedia applications

Poellabauer, Christian; Schwan, Karsten; West, R. G.

doi:10.1145/500174.500177

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the measured workload of different request classes and their priority levels, a dynamic node partitioning strategy adaptively partitions the server nodes of a cluster and allocates them to handle requests of different classes. OS support for service differentiation has also been addressed in prior efforts [6], [28], [34]. Sundaram et al presented a multimedia operating system, QLinux, which employs hierarchical class-specific schedulers to meet the diverse performance requirements of Web and multimedia applications [34].…”

Section: Related Workmentioning

confidence: 99%

Harmonic proportional bandwidth allocation and scheduling for service differentiation on streaming servers

Zhou

2004

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-To provide ubiquitous access to the proliferating rich media on the Internet, scalable streaming servers must be able to provide differentiated services to various client requests. Recent advances of transcoding technology make network-I/O bandwidth usages at the server communication ports controllable by request schedulers on the fly. In this article, we propose a transcodingenabled bandwidth allocation scheme for service differentiation on streaming servers. It aims to deliver high bit rate streams to high priority request classes without overcompromising low priority request classes. We investigate the problem of providing differentiated streaming services at application level in two aspects: stream bandwidth allocation and request scheduling. We formulate the bandwidth allocation problem as an optimization of a harmonic utility function of the stream quality factors and derive the optimal streaming bit rates for requests of different classes under various server load conditions. We prove that the optimal allocation, referred to as harmonic proportional allocation, not only maximizes the system utility function, but also guarantees proportional fair sharing between classes with different prespecified differentiation weights. We evaluate the allocation scheme, in combination with two popular request scheduling approaches, via extensive simulations and compare it with an absolute differentiation strategy and a proportionalshare strategy tailored from relative differentiation in networking. Simulation results show that the harmonic proportional allocation scheme can meet the objective of relative differentiation in both short and long timescales and greatly enhance the service availability and maintain low queueing delay when the streaming system is highly loaded.

show abstract

Section: Related Workmentioning

confidence: 99%

Harmonic proportional bandwidth allocation and scheduling for service differentiation on streaming servers

Zhou

2004

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…At application-level, the Odyssey projects extends the Unix System call interface to support flexible application-aware adaptations [23], as also done in our own work addressing interactive applications [29]. The system monitors resource levels, notifies applications of relevant changes, and enforces resource allocation decision.…”

Section: Adaptations In Mobile Environmentsmentioning

confidence: 99%

Opportunistic Channels: Mobility-Aware Event Delivery

Chen

Schwan

Zhou³

2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

The delivery of data in pervasive systems has to deal with end host mobility. One problem is how to create appropriate, applicationlevel data provisioning topologies, termed data brokers, to best match underlying network connectivity, end user locations, and the locales of their network access. Another problem is how to balance workloads in such overlay networks, in response to mobility and to changes in available processing and communication resources. This paper improves the performance of data provisioning by dynamically changing broker topologies and end users' assignments to brokers. Specifically, using publish/subscribe as a communication paradigm, a new abstraction, termed an opportunistic event channel, enables dynamic broker creation, deletion, and movement. Experimental and simulation results demonstrate the ability of opportunistic channels to optimize event delivery and processing when end users move across different network access points. The technique is to 'opportunistically' follow network-level handoffs across network access points with application-level handoffs of a user's broker functionality to a new, 'closer' broker. The potential load imbalances across brokers caused by such handoffs are also addressed. Opportunistic channels are realized with the JECho event infrastructure. Performance advantages attained from their use can be substantial, with the cost of sending a message from a publisher to a mobile subscriber improved by up to 50%. Load balancing improves event delivery even for moderate numbers of event subscribers.

show abstract

Coordinated CPU and event scheduling for distributed multimedia applications

Cited by 2 publications

References 0 publications

Harmonic proportional bandwidth allocation and scheduling for service differentiation on streaming servers

Harmonic proportional bandwidth allocation and scheduling for service differentiation on streaming servers

Opportunistic Channels: Mobility-Aware Event Delivery

Contact Info

Product

Resources

About