Sciweavers

1794 search results - page 30 / 359
» Visualizing Memory Graphs
Sort
View
IEEEHPCS
2010
15 years 9 days ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
APVIS
2009
15 years 3 months ago
TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
Daniel Archambault, Tamara Munzner, David Auber
132
Voted
EUROPAR
2005
Springer
15 years 8 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
IADIS
2004
15 years 3 months ago
Memory inspector: a data representation tutorial
This paper describes Memory Inspector, an interactive web-based tutorial on data storage types and an alternative method for teaching these concepts. Memory Inspector was designed...
Joaquin Vila, Barbara Beccue
99
Voted
TVCG
2011
100views more  TVCG 2011»
14 years 9 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber