119 search results - page 16 / 24 » Static Scheduling for Synchronous Data Flow Graphs |
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
TPDS
1998
13 years 6 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
CODES
2004
IEEE
13 years 10 months ago
2004
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
ORL
1998
13 years 6 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...