Sciweavers

3202 search results - page 126 / 641
» Memory access scheduling
Sort
View
TOPLAS
2002
89views more  TOPLAS 2002»
15 years 4 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua
JSSPP
1995
Springer
15 years 8 months ago
The Interaction between Memory Allocation and Adaptive Partitioning in Message-Passing Multicomputers
Abstract. Most studies on adaptive partitioning policies for scheduling parallel jobs on distributed memory parallel computers ignore the constraints imposed by the memory requirem...
Sanjeev Setia
INFOCOM
2010
IEEE
15 years 3 months ago
DiffProbe: Detecting ISP Service Discrimination
Abstract—We propose an active probing method, called Differential Probing or DiffProbe, to detect whether an access ISP is deploying forwarding mechanisms such as priority schedu...
Partha Kanuparthy, Constantine Dovrolis
CIKM
2007
Springer
15 years 10 months ago
Index compression is good, especially for random access
Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performanc...
Stefan Büttcher, Charles L. A. Clarke
ARCS
2006
Springer
15 years 8 months ago
Adding Low-Cost Hardware Barrier Support to Small Commodity Clusters
The performance of the barrier operation can be crucial for many parallel codes. Especially distributed shared memory systems have to synchronize frequently to ensure the proper o...
Torsten Hoefler, Torsten Mehlan, Frank Mietke, Wol...