Sciweavers

1794 search results - page 73 / 359
» Visualizing Memory Graphs
Sort
View
256
Voted
CL
2012
Springer
13 years 5 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...
115
Voted
GD
2006
Springer
15 years 6 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
145
Voted
MICRO
2010
IEEE
215views Hardware» more  MICRO 2010»
15 years 1 months ago
A Task-Centric Memory Model for Scalable Accelerator Architectures
This paper presents a task-centric memory model for 1000-core compute accelerators. Visual computing applications are emerging as an important class of workloads that can exploit ...
John H. Kelm, Daniel R. Johnson, Steven S. Lumetta...
121
Voted
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 2 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
110
Voted
ICPP
1999
IEEE
15 years 7 months ago
FLB: Fast Load Balancing for Distributed-Memory Machines
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
Andrei Radulescu, Arjan J. C. van Gemund