154 search results - page 5 / 31 » Dependence Flow Graphs: An Algebraic Approach to Program Dep... |
BIRTHDAY
2005
Springer
14 years 7 days ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
IEEEPACT
2002
IEEE
13 years 11 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
SBACPAD
2005
IEEE
14 years 8 days ago
2005
IEEE
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
SAMOS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract—In this paper we present a Multithreaded programming methodology for multi-core systems that utilizes DataFlow concurrency. The programmer augments the program with macr...
IWOMP
2007
Springer
14 years 25 days 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...