Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IPPS
2010
IEEE
11 years 4 months ago
Improving MapReduce performance through data placement in heterogeneous Hadoop clusters
MapReduce has become an important distributed processing model for large-scale data-intensive applications like data mining and web indexing. Hadoop
Jiong Xie, Shu Yin, Xiaojun Ruan, Zhiyang Ding, Yu...
PAAPP
2002
76views more  PAAPP 2002»
11 years 6 months ago
Performance of PDE solvers on a self-optimizing NUMA architecture
Abstract. The performance of shared-memory (OpenMP) implementations of three different PDE solver kernels representing finite difference methods, finite volume methods, and spectra...
Sverker Holmgren, Markus Nordén, Jarmo Rant...
USITS
2003
11 years 8 months ago
SkipNet: A Scalable Overlay Network with Practical Locality Properties
: Scalable overlay networks such as Chord, Pastry, and Tapestry have recently emerged as a flexible infrastructure for building large peer-to-peer systems. In practice, two disadv...
Nicholas J. A. Harvey, Michael B. Jones, Stefan Sa...
ESTIMEDIA
2008
Springer
11 years 8 months ago
A framework for memory-aware multimedia application mapping on chip-multiprocessors
The relentless increase in multimedia embedded system application requirements as well as improvements in IC design technology have motivated the deployment of chip multiprocessor ...
Luis Angel D. Bathen, Nikil D. Dutt, Sudeep Pasric...
CLUSTER
2006
IEEE
11 years 10 months ago
Improving Communication Performance on InfiniBand by Using Efficient Data Placement Strategies
Despite using high-speed network interconnection systems like InfiniBand, the communication overhead for parallel applications is still high. In this paper we show, how such costs...
Robert Rex, Frank Mietke, Wolfgang Rehm, Christoph...
IPPS
1996
IEEE
11 years 11 months ago
An Adaptive Approach to Data Placement
Programming distributed-memory machines requires careful placement of datato balance the computationalload among the nodes and minimize excess data movement between the nodes. Mos...
David K. Lowenthal, Gregory R. Andrews
FODO
1998
Springer
241views Algorithms» more  FODO 1998»
11 years 11 months ago
2D BubbleUp: Managing Parallel Disks for Media Servers
In this study we present a scheme called two-dimensional BubbleUp (2DB) for managing parallel disks in a multimedia server. Its goal is to reduce initial latency for interactive m...
Edward Y. Chang, Hector Garcia-Molina, Chen Li
VLDB
1999
ACM
145views Database» more  VLDB 1999»
11 years 11 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
LCPC
1999
Springer
11 years 11 months ago
A Linear Algebra Formulation for Optimising Replication in Data Parallel Programs
In this paper, we present an efficient technique for optimising data replication under the data parallel programming model. We propose a precise mathematical representation for da...
Olav Beckmann, Paul H. J. Kelly
HIPC
2007
Springer
12 years 28 days ago
No More Energy-Performance Trade-Off: A New Data Placement Strategy for RAID-Structured Storage Systems
Many real-world applications like Video-On-Demand (VOD) and Web servers require prompt responses to access requests. However, with an explosive increase of data volume and the emer...
Tao Xie 0004, Yao Sun
books