Scheduling in synchronous networks and the greedy algorithm

Author： Lui K.-S.   Zaks S.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Bounds on the Greedy Routing Algorithm for Array Networks

By Mitzenmacher M.  

Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. : 317-327

Academic Press

Access to resources Recommend Favorite

Greedy primal-dual algorithm for dynamic resource allocation in complex networks

By Stolyar Alexander  

Queueing Systems, Vol. 54, Iss. 3, 2006-11 ,pp. : 203-220

Springer Publishing Company

Access to resources Recommend Favorite

GMCA: a greedy multilevel clustering algorithm for data gathering in wireless sensor networks

By Kumar Manish  

International Journal of Communication Networks and Distributed Systems, Vol. 11, Iss. 2, 2013-07 ,pp. : 198-213

Inderscience Publishers

Access to resources Recommend Favorite

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

By Pouzet Marc   Raymond Pascal  

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

Springer Publishing Company

Access to resources Recommend Favorite

Greedy scheduling with custom-made objectives

By Franke Carsten  

Annals of Operations Research, Vol. 180, Iss. 1, 2010-11 ,pp. : 145-164

Springer Publishing Company

Access to resources Recommend Favorite