Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off

Author： Bhatt S.N. Chung F.R.K. Leighton F.T. Rosenberg A.L.

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.33, Iss.1, 1996-02, pp. : 55-68

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

Run-Time versus Compile-Time Instruction Scheduling in Superscalar (RISC) Processors: Performance and Trade-Off

By Leung A. Palem K.V. Ungureanu C.

Journal of Parallel and Distributed Computing, Vol. 45, Iss. 1, 1997-08 ,pp. : 13-28

Academic Press

Access to resources Recommend Favorite

Optimal scheduling of parallel queues using stochastic flow models

By Kebarighotbi Ali

Discrete Event Dynamic Systems, Vol. 21, Iss. 4, 2011-12 ,pp. : 547-576

Springer Publishing Company

Access to resources Recommend Favorite

Trade-off results for connection management

By Mavronicolas M. Papadakis N.

Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. : 1-57

Elsevier

Access to resources Recommend Favorite

Analyzing priority queues with 3 classes using tree-like processes

By Houdt B. Blondia C.

Queueing Systems, Vol. 54, Iss. 2, 2006-10 ,pp. : 99-109

Springer Publishing Company

Access to resources Recommend Favorite

Approximate trade-off between minimisation of total weighted tardiness and minimisation of carbon dioxide (CO₂) emissions in bi-criteria batch scheduling problem

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 8, 2014-08 ,pp. : 759-771

Taylor & Francis Ltd

Access to resources Recommend Favorite