Modular static scheduling of synchronous data-flow networks: An efficient symbolic representation

ISSN： 0929-5585

Source： Design Automation for Embedded Systems, Vol.14, Iss.3, 2010-09, pp. : 165-192

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Scheduling in synchronous networks and the greedy algorithm

By Lui K.-S. Zaks S.

Theoretical Computer Science, Vol. 220, Iss. 1, 1999-06 ,pp. : 157-183

Elsevier

Access to resources Recommend Favorite

Efficient scheduling techniques for high data-rate wireless personal area networks

By Fantacci Romano Tarch Daniele

International Journal of Sensor Networks, Vol. 2, Iss. 1-2, 2007-04 ,pp. : 128-134

Inderscience Publishers

Access to resources Recommend Favorite

Efficient scheduling of MPI applications on networks of workstations

By Dantas M.A.R. Zaluska E.J.

Future Generation Computer Systems, Vol. 13, Iss. 6, 1998-05 ,pp. : 489-499

Elsevier

Access to resources Recommend Favorite

Type-based initialization analysis of a synchronous dataflow language

By Colaço Jean-Louis Pouzet Marc

International Journal on Software Tools for Technology Transfer, Vol. 6, Iss. 3, 2004-08 ,pp. : 245-255

Springer Publishing Company

Access to resources Recommend Favorite

A data-flow approach to test multi-agent ASMs

By Cavarra Alessandra

Formal Aspects of Computing, Vol. 23, Iss. 1, 2011-01 ,pp. : 21-41

Springer Publishing Company

Access to resources Recommend Favorite