Techniques for increasing the stream capacity of a high-performance multimedia server

Divyesh Jadav; Alok N. Choudhary; P. Bruce Berra

doi:10.1109/69.761664

Techniques for increasing the stream capacity of a high-performance multimedia server

Divyesh Jadav, Alok N. Choudhary, P. Bruce Berra

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

High-performance servers and high-speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization and, thus, minimize cost, it is essential that the load be balanced among each of the server's components viz., the disks, the interconnection network, and the scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed in the literature. This paper presents techniques for improving server capacity by assigning media requests to the nodes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for request assignment - round-robin (RR), minimum link allocation (MLA), minimum contention allocation (MCA), weighted minimum link allocation (WMLA), and weighted minimum contention allocation (WMCA) - are developed. The performance of these policies on a server model developed earlier is presented. We also consider the issue of file replication, and develop two schemes for storing the replicas, the Parent Group Based Round-Robin Placement (PGBRRP) scheme, and the Group Wide Round-Robin Placement (GWRRP) scheme. The performance of the request assignment policies in the presence of file replication is presented.

Original language	English (US)
Pages (from-to)	284-302
Number of pages	19
Journal	IEEE Transactions on Knowledge and Data Engineering
Volume	11
Issue number	2
DOIs	https://doi.org/10.1109/69.761664
State	Published - 1999

Funding

This work was supported by the Intel Corporation, the National Science Foundation through Young Investigator Award No. CCR-9357840, and the New York State Center for Advanced Technology in Computer Applications and Software Engineering (the CASE Center) at Syracuse University. The authors thank the California Institute of Technology CCSF facilities for providing access to the Intel Paragon.

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Computational Theory and Mathematics

Access to Document

10.1109/69.761664

Cite this

@article{6701684734504b23891a7804ca8172c3,

title = "Techniques for increasing the stream capacity of a high-performance multimedia server",

abstract = "High-performance servers and high-speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization and, thus, minimize cost, it is essential that the load be balanced among each of the server's components viz., the disks, the interconnection network, and the scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed in the literature. This paper presents techniques for improving server capacity by assigning media requests to the nodes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for request assignment - round-robin (RR), minimum link allocation (MLA), minimum contention allocation (MCA), weighted minimum link allocation (WMLA), and weighted minimum contention allocation (WMCA) - are developed. The performance of these policies on a server model developed earlier is presented. We also consider the issue of file replication, and develop two schemes for storing the replicas, the Parent Group Based Round-Robin Placement (PGBRRP) scheme, and the Group Wide Round-Robin Placement (GWRRP) scheme. The performance of the request assignment policies in the presence of file replication is presented.",

author = "Divyesh Jadav and Choudhary, {Alok N.} and Berra, {P. Bruce}",

note = "Funding Information: This work was supported by the Intel Corporation, the National Science Foundation through Young Investigator Award No. CCR-9357840, and the New York State Center for Advanced Technology in Computer Applications and Software Engineering (the CASE Center) at Syracuse University. The authors thank the California Institute of Technology CCSF facilities for providing access to the Intel Paragon.",

year = "1999",

doi = "10.1109/69.761664",

language = "English (US)",

volume = "11",

pages = "284--302",

journal = "IEEE Transactions on Knowledge and Data Engineering",

issn = "1041-4347",

publisher = "IEEE Computer Society",

number = "2",

}

TY - JOUR

T1 - Techniques for increasing the stream capacity of a high-performance multimedia server

AU - Jadav, Divyesh

AU - Choudhary, Alok N.

AU - Berra, P. Bruce

N1 - Funding Information: This work was supported by the Intel Corporation, the National Science Foundation through Young Investigator Award No. CCR-9357840, and the New York State Center for Advanced Technology in Computer Applications and Software Engineering (the CASE Center) at Syracuse University. The authors thank the California Institute of Technology CCSF facilities for providing access to the Intel Paragon.

PY - 1999

Y1 - 1999

N2 - High-performance servers and high-speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization and, thus, minimize cost, it is essential that the load be balanced among each of the server's components viz., the disks, the interconnection network, and the scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed in the literature. This paper presents techniques for improving server capacity by assigning media requests to the nodes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for request assignment - round-robin (RR), minimum link allocation (MLA), minimum contention allocation (MCA), weighted minimum link allocation (WMLA), and weighted minimum contention allocation (WMCA) - are developed. The performance of these policies on a server model developed earlier is presented. We also consider the issue of file replication, and develop two schemes for storing the replicas, the Parent Group Based Round-Robin Placement (PGBRRP) scheme, and the Group Wide Round-Robin Placement (GWRRP) scheme. The performance of the request assignment policies in the presence of file replication is presented.

AB - High-performance servers and high-speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization and, thus, minimize cost, it is essential that the load be balanced among each of the server's components viz., the disks, the interconnection network, and the scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed in the literature. This paper presents techniques for improving server capacity by assigning media requests to the nodes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for request assignment - round-robin (RR), minimum link allocation (MLA), minimum contention allocation (MCA), weighted minimum link allocation (WMLA), and weighted minimum contention allocation (WMCA) - are developed. The performance of these policies on a server model developed earlier is presented. We also consider the issue of file replication, and develop two schemes for storing the replicas, the Parent Group Based Round-Robin Placement (PGBRRP) scheme, and the Group Wide Round-Robin Placement (GWRRP) scheme. The performance of the request assignment policies in the presence of file replication is presented.

UR - http://www.scopus.com/inward/record.url?scp=0032659801&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032659801&partnerID=8YFLogxK

U2 - 10.1109/69.761664

DO - 10.1109/69.761664

M3 - Article

AN - SCOPUS:0032659801

SN - 1041-4347

VL - 11

SP - 284

EP - 302

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

IS - 2

ER -

Techniques for increasing the stream capacity of a high-performance multimedia server

Abstract

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this