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

ISSN： 0010-485X

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

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

Related content

Bounding the minimal completion time in high-performance parallel processing

By Lundberg Lars Broberg Magnus Klonowska Kamilla

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

Inderscience Publishers

Access to resources Recommend Favorite

Time-minimal paths amidst moving obstacles in three dimensions

By Fujimura K.

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 421-440

Elsevier

Access to resources Recommend Favorite

Parallel evidence propagation on multicore processors

By Xia Yinglong Prasanna Viktor

The Journal of Supercomputing, Vol. 57, Iss. 2, 2011-08 ,pp. : 189-202

Springer Publishing Company

Access to resources Recommend Favorite

Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines

By Sung Shao Vlach Milan

Journal of Scheduling, Vol. 8, Iss. 5, 2005-10 ,pp. : 453-460

Springer Publishing Company

Access to resources Recommend Favorite

Allocating Independent Tasks to Parallel Processors: An Experimental Study

By Hagerup T.

Journal of Parallel and Distributed Computing, Vol. 47, Iss. 2, 1997-12 ,pp. : 185-197

Academic Press

Access to resources Recommend Favorite