Optimal Compile-Time Multiprocessor Scheduling Based on the O-1 Linear Programming Algorithm with the Branch and Bound Technique

Author： Piriyakumar D.A.L. Murthy C.S.R.

Publisher： Academic Press

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.35, Iss.2, 1996-06, pp. : 199-204

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

An Optimal Multiprocessor Real-Time Scheduling Algorithm

By Khemka A. Shyamasundar R.K.

Journal of Parallel and Distributed Computing, Vol. 43, Iss. 1, 1997-05 ,pp. : 37-45

Academic Press

Access to resources Recommend Favorite

ACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 3, Iss. 3, 2011-07 ,pp. : 20-30

IGI Global_journal

Access to resources Recommend Favorite

Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm

By Achuthan N.R. Hardjawidjaja A.

Annals of Operations Research, Vol. 108, Iss. 1-4, 2001-11 ,pp. : 55-74

Springer Publishing Company

Access to resources Recommend Favorite

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

A composite algorithm for multiprocessor scheduling

By Paletta Giuseppe

Journal of Heuristics, Vol. 17, Iss. 3, 2011-06 ,pp. : 281-301

Springer Publishing Company

Access to resources Recommend Favorite