Search Results - BNP Task Scheduling Algorithms using DAG
-
1
Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors
ISBN: 0818674601, 9780818674600ISSN: 1087-4089Published: IEEE 1996Published in Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) (1996)“… These algorithms are called the bounded number of processors (BNP) scheduling algorithms. The algorithms in the second group schedule the DAG to an unbounded number of clusters and are called the unbounded number of clusters (UNC…”
Get full text
Conference Proceeding

