1794 search results - page 262 / 359 » Visualizing Memory Graphs |
129
click to vote
IWOMP
2007
Springer
15 years 8 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
123
Voted
ACSD
2005
IEEE
15 years 8 months ago
2005
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
138
Voted
LICS
2005
IEEE
15 years 8 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
139
click to vote
LCPC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
121
click to vote
APN
2004
Springer
15 years 7 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...