Sciweavers

49 search results - page 9 / 10
» Using FORAY Models to Enable MPSoC Memory Optimizations
Sort
View
CGF
2011
13 years 4 days ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
CIKM
2004
Springer
14 years 2 months ago
Evaluating window joins over punctuated streams
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
Luping Ding, Elke A. Rundensteiner
ANSS
2004
IEEE
14 years 9 days ago
Cache Simulation Based on Runtime Instrumentation for OpenMP Applications
To enable optimizations in memory access behavior of high performance applications, cache monitoring is a crucial process. Simulation of cache hardware is needed in order to allow...
Jie Tao, Josef Weidendorfer
CONCURRENCY
1998
87views more  CONCURRENCY 1998»
13 years 8 months ago
Titanium: A High-performance Java Dialect
Titanium is a language and system for high-performance parallel scientific computing. Titanium uses Java as its base, thereby leveraging the advantages of that language and allow...
Katherine A. Yelick, Luigi Semenzato, Geoff Pike, ...
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 10 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee