Bounding the minimal completion time in high-performance parallel processing

Author： Lundberg Lars   Broberg Magnus   Klonowska Kamilla  

Publisher： Inderscience Publishers

ISSN： 1740-0562

Source： International Journal of High Performance Computing and Networking, Vol.2, Iss.1, 2006-03, pp. : 55-64

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

Bounding the Number of Processors and Checkpoints Needed in Time-minimal Parallel Reversal Schedules

By Walther A.  

Computing, Vol. 73, Iss. 2, 2004-09 ,pp. : 135-154

Springer Publishing Company

Access to resources Recommend Favorite

Performance Evaluation of a Parallel Pipeline Computational Model for Space-Time Adaptive Processing

By Liao Wei-Keng   Choudhary Alok   Weiner Donald   Varshney Pramod  

The Journal of Supercomputing, Vol. 31, Iss. 2, 2005-02 ,pp. : 137-160

Springer Publishing Company

Access to resources Recommend Favorite

Performance Evaluation Issues in Real-Time Parallel Signal Processing and Control

By Tokhi M.O.   Hossain M.A.   Baxter M.J.   Fleming P.J.  

Journal of Parallel and Distributed Computing, Vol. 42, Iss. 1, 1997-04 ,pp. : 67-74

Academic Press

Access to resources Recommend Favorite

Minimizing Mean Completion Time in a Batch Processing System

By Deng Xiaotie   Feng Haodi   Zhang Pixing   Zhang Yuzhong   Zhu Hong  

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 513-528

Springer Publishing Company

Access to resources Recommend Favorite

Performance-based parallel application toolkit for high-performance clusters

By Li Kuan-Ching   Weng Tien-Hsiung  

The Journal of Supercomputing, Vol. 48, Iss. 1, 2009-04 ,pp. : 43-65

Springer Publishing Company

Access to resources Recommend Favorite