1794 search results - page 81 / 359 » Visualizing Memory Graphs |
121
click to vote
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
234
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
111
click to vote
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
130
click to vote
ECRTS
2008
IEEE
15 years 10 months ago
2008
IEEE
There is a need for using virtual memory in real-time applications: using virtual addressing provides isolation between concurrent processes; in addition, paging allows the execut...
145
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...