Download:
|
by Petra Berenbrink, Reinhard Luling, Valentin Rottmann
http://www.dcs.warwick.ac.uk/~petra/papers/parcomp97.ps.gz
Add To MetaCart
Abstract:
A multimedia server has to ensure that multimedia objects are efficiently stored and retrieved from the storage devices of the server. The placement policy of media objects onto the storage devices influences the retrieval process. In this paper, we examine different data layout schemes for disk arrays: round-robin, random and hashing. First we introduce universal classes of hash functions which are motivated by PRAM-Simulations (parallel random access machine) on DMMs (Distributed Memory Machines). The difference between simple hashing schemes and random ones is elaborated by analysis and by simulation. From the practical point of view this difference is negligible. Then we leave the abstract functions and turn to multimedia servers, where we compare the strategies round-robin, random, and hashing by analysis and by simulation, taking different user behavior into account. The layout by hashing is superior to the other methods, because it is simpler managed and needs less memory than random and has sufficient quality concerning the load balancing of the disks. The round-robin layout is not well suited compared to the random layout and the layout by hashing because some clients access always a highly loaded disk and others always a disk with low load. The round-robin layout treats some users unfair compared to others.
Citations
|
630
|
A scheme for real-time channel establishment in wide-area networks
– Ferrari, Verma
- 1990
|
|
550
|
The case for redundant arrays of inexpensive disks (RAID
– Patterson, Gibson, et al.
- 1988
|
|
470
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
202
|
How toEmulate Shared Memory
– Ranade
- 1991
|
|
179
|
Storing a sparse table with O(1) worst case access time
– Fredman, Komlós, et al.
- 1984
|
|
132
|
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
– Mehlhorn, Vishkin
- 1984
|
|
118
|
Dynamic perfect hashing: Upper and lower bounds
– Dietzfelbinger, Karlin, et al.
- 1994
|
|
101
|
A Statistical Admission Control Algorithm for Multimedia Servers
– Vin, Goyal, et al.
- 1994
|
|
79
|
Preemptive Scheduling under Time and Resource Constraints
– Zhao, Ramamritham, et al.
- 1987
|
|
76
|
A complexity theory of efficient parallel algorithms
– Kruskal, Rudolph, et al.
- 1990
|
|
74
|
Competitive routing of virtual circuits in ATM networks
– Plotkin
- 1995
|
|
65
|
E cient Schemes for Parallel Communications
– Upfal
- 1984
|
|
50
|
Parallel hashing: An efficient implementation of shared memory
– Karlin, Upfal
- 1988
|
|
42
|
A theory of wormhole routing in parallel computers
– Felperin, Raghavan, et al.
- 1992
|
|
42
|
On universal classes of fast high performance hash functions, their time-space tradeo , and their applications
– Siegel
- 1989
|
|
41
|
Physical Storage Organizations for Time-Dependent Multimedia Data
– Chen, Little
- 1993
|
|
38
|
auf der Heide. Simple, efficient shared memory simulations
– Dietzfelbinger, Meyer
- 1993
|
|
37
|
Optimizing the Placement of Multimedia Objects on Disk Arrays
– Vin, Rao, et al.
- 1995
|
|
36
|
On-line algorithms versus off-line algorithms: How much is it worth to know the future
– Karp
- 1992
|
|
36
|
Fast deflection routing for packets and worms
– Bar-Noy, Raghavan, et al.
- 1993
|
|
31
|
Storage Servers: A Tutorial and Survey
– Gemmel, Vin, et al.
- 1995
|
|
19
|
On-line resource management with applications to routing and scheduling
– Leonardi, Marchetti-Spaccamela
- 1995
|
|
18
|
Universal wormhole routing
– Greenberg, Oh
- 1993
|
|
15
|
Nearly tight bounds for wormhole routing
– Ranade, Schleimer, et al.
- 1994
|
|
13
|
Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
– Heide, Scheideler
- 1995
|
|
13
|
auf der Heide, How to Distribute a Dictionary in a Complete Network
– Dietzfelbinger, Meyer
- 1990
|
|
8
|
Scheduling Algorithms for Multiprocessing in a Hard-Real Time Environment
– Liu, Layland
- 1973
|
|
4
|
Multimedia System Architecture
– Vin
- 1994
|
|
3
|
Dynamic task scheduling in distributed real-time systems
– Ramamritham, Stankovic
- 1984
|
|
1
|
auf der Heide. A new class of hash functions and dynamic hashing in real time
– Dietzfelbinger, Meyer
- 1990
|
