Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Circus: Opportunistic Block Reordering for Scalable Content Servers Stergios V. Anastasiadis Rajiv G. Wickremesinghe Jeffrey S. Chase
 

Summary: Circus: Opportunistic Block Reordering for Scalable Content Servers
Stergios V. Anastasiadis Rajiv G. Wickremesinghe Jeffrey S. Chase
Department of Computer Science, Duke University
Durham, NC 27708, USA
{stergios,rajiv,chase}@cs.duke.edu
Abstract
Whole-file transfer is a basic primitive for Internet con-
tent dissemination. Content servers are increasingly lim-
ited by disk arm movement given the rapid growth in disk
density, disk transfer rates, server network bandwidth,
and content size. Individual file transfers are sequential,
but the block access sequence on a content server is ef-
fectively random when many slow clients access large
files concurrently. Although larger blocks can help im-
prove disk throughput, buffering requirements increase
linearly with block size.
This paper explores a novel block reordering tech-
nique that can reduce server disk traffic significantly when
large content files are shared. The idea is to transfer
blocks to each client in any order that is convenient for

  

Source: Anastasiadis, Stergios V. - Department of Computer Science, University of Ioannina

 

Collections: Computer Technologies and Information Sciences