Sciweavers

2609 search results - page 37 / 522
» Optimizing for parallelism and data locality
Sort
View
CCGRID
2011
IEEE
14 years 1 months ago
A Segment-Level Adaptive Data Layout Scheme for Improved Load Balance in Parallel File Systems
Abstract—Parallel file systems are designed to mask the everincreasing gap between CPU and disk speeds via parallel I/O processing. While they have become an indispensable compo...
Huaiming Song, Yanlong Yin, Xian-He Sun, Rajeev Th...
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
15 years 2 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
SPAA
2004
ACM
15 years 3 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
98
Voted
VLSID
2002
IEEE
96views VLSI» more  VLSID 2002»
15 years 3 months ago
Strategies for Improving Data Locality in Embedded Applications
This paper introduces a dynamic layout optimization strategy to minimize the number of cycles spent in memory accesses in a cache-based memory environment. In this approach, a giv...
N. E. Crosbie, Mahmut T. Kandemir, Ibrahim Kolcu, ...
ISPAN
1997
IEEE
15 years 2 months ago
A Parallel Pipelined Renderer for Time-Varying Volume Data
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...
Tzi-cker Chiueh, Kwan-Liu Ma