Sciweavers

403 search results - page 5 / 81
» Data Partitioning for Minimizing Transferred Data in MapRedu...
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 3 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
CIKM
2009
Springer
15 years 6 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
CODES
2010
IEEE
14 years 9 months ago
Automatic memory partitioning: increasing memory parallelism via data structure partitioning
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
Yosi Ben-Asher, Nadav Rotem
CSREASAM
2007
15 years 28 days ago
Allocation of Partitioned Data by Using A Neural Network Based Approach
In this paper, we investigate allocation of data partitions in the network for data objects that are partitioned by using secret sharing schemes [12] or erasure coding schemes [11...
Manghui Tu, Dongfeng Wang, Peng Li, Nasser Tadayon
ISLPED
1995
ACM
100views Hardware» more  ISLPED 1995»
15 years 3 months ago
Simultaneous scheduling and binding for power minimization during microarchitecture synthesis
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...
Aurobindo Dasgupta, Ramesh Karri