Sciweavers

548 search results - page 44 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
HIPC
2005
Springer
15 years 7 months ago
Application of Reduce Order Modeling to Time Parallelization
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
Ashok Srinivasan, Yanan Yu, Namas Chandra
IPPS
2006
IEEE
15 years 8 months ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
NPIV
1998
ACM
101views Visualization» more  NPIV 1998»
15 years 6 months ago
Supporting dynamic information visualization with VRML and databases
Nowadays, many state-of-the-art user interfaces to complexly structured data collections require appropriate information visualization methods. With the increase in graphics perfo...
Thomas Risse, Martin Leissler, Matthias Hemmje, Ka...
ISI
2008
Springer
15 years 1 months ago
Data mining for social network analysis
A social network is defined as a social structure of individuals, who are related (directly or indirectly to each other) based on a common relation of interest, e.g. friendship, t...
J. Srivastava
PLDI
1996
ACM
15 years 6 months ago
Commutativity Analysis: A New Analysis Framework for Parallelizing Compilers
This paper presents a new analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutat...
Martin C. Rinard, Pedro C. Diniz