Sciweavers

481 search results - page 10 / 97
» Cache-Conscious Data Placement
Sort
View
USENIX
2000
13 years 10 months ago
Dynamic Function Placement for Data-Intensive Cluster Computing
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
Khalil Amiri, David Petrou, Gregory R. Ganger, Gar...
LCPC
1999
Springer
14 years 1 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
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
14 years 6 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
DATE
2000
IEEE
169views Hardware» more  DATE 2000»
14 years 1 months ago
Transformational Placement and Synthesis
Novel methodology and algorithms to seamlessly integrate logic synthesis and physical placement through a transformational approach are presented. Contrary to most placement algor...
Wilm E. Donath, Prabhakar Kudva, Leon Stok, Paul V...
PPOPP
2010
ACM
14 years 6 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...