1794 search results - page 37 / 359 » Visualizing Memory Graphs |
119
click to vote
HPCN
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. Su cient and precise semantic information is essential to interactive parallel programming. In this paper, we present afeasible implementation of the iteration space depe...
131
click to vote
GD
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
125
click to vote
SIGARCH
2008
15 years 2 months ago
2008
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
136
click to vote
WADS
2001
Springer
15 years 6 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
119
click to vote
ISCI
2007
15 years 2 months ago
2007
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...