Sciweavers

587 search results - page 97 / 118
» Improving the Java memory model using CRF
Sort
View
CF
2006
ACM
15 years 5 months ago
Exploiting locality to ameliorate packet queue contention and serialization
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
Sailesh Kumar, John Maschmeyer, Patrick Crowley
CCGRID
2002
IEEE
15 years 4 months ago
Overcoming the Problems Associated with the Existence of Too Many DSM APIs
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
Martin Schulz
GIS
1998
ACM
15 years 4 months ago
Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm
We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incrementa...
Cláudio T. Silva, Joseph S. B. Mitchell
MICRO
2003
IEEE
108views Hardware» more  MICRO 2003»
15 years 5 months ago
Reducing Design Complexity of the Load/Store Queue
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
Il Park, Chong-liang Ooi, T. N. Vijaykumar
SPAA
1996
ACM
15 years 3 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick