Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories

This paper presents the extreme performance of the promising Q.A.D. algorithm, for scheduling independent jobs under few pre-set ordering rules on the examined model, when the mean-flow time is the performance criterion. Further, an algorithm, based on the idea of Q.A.D., with complexity 0(n 2 ) is...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of computer mathematics Jg. 17; H. 3-4; S. 237 - 255
Hauptverfasser:	Spyropoulos, C.D., Evans, D.J
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Gordon and Breach Science Publishers 01.01.1985 Taylor and Francis
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences C.4 [Performance of Systems] Computer science; control theory; systems deterministic analysis Exact sciences and technology F.1.1 [Models of Computation] F.2.2 [Nonnumerical Algorithms and Problems]-Sequencing and Scheduling G.2 [Discrete Mathematics] Homogeneous multiprocessor model mean-flow time performance criterion Q.A.D. algorithm R.3.3 [Performance Analysis and Design Aids]-Worst-Case Analysis Theoretical computing Multiprocessor Task scheduling Performance Integrated planning Algorithm analysis Computing complexity
ISSN:	0020-7160, 1029-0265
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!