Sciweavers

2703 search results - page 143 / 541
» Optimizing memory transactions
Sort
View
CASES
2003
ACM
14 years 3 months ago
Exploiting bank locality in multi-bank memories
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
Guilin Chen, Mahmut T. Kandemir, Hendra Saputra, M...
IPPS
1999
IEEE
14 years 2 months ago
Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory Machines
Automatic Global Data Partitioning for Distributed Memory Machines DMMs is a di cult problem. In this work, we present a partitioning strategy called 'Hyperplane Partitioning...
S. R. Prakash, Y. N. Srikant
PCI
2001
Springer
14 years 2 months ago
Two-Phase Commit Processing with Restructured Commit Tree
Abstract. Extensive research has been carried out in search for an efcient atomic commit protocol and many optimizations have been suggested to improve the basic two-phase commit p...
George Samaras, George K. Kyrou, Panos K. Chrysant...
ESA
2008
Springer
159views Algorithms» more  ESA 2008»
13 years 11 months ago
Cache-Oblivious Red-Blue Line Segment Intersection
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plan...
Lars Arge, Thomas Mølhave, Norbert Zeh
HPDC
2008
IEEE
14 years 4 months ago
Managing SLAs of heterogeneous workloads using dynamic application placement
In this paper we address the problem of managing heterogeneous workloads in a virtualized data center. We consider two different workloads: transactional applications and long-ru...
David Carrera, Malgorzata Steinder, Ian Whalley, J...