Uniform tasks distributed uniformly or else assigned to one processor. Investigation in theory of scheduling yielded optimal scheme for allocation of tasks among digital data processors in hypercube ensemble. Applies to tasks that require equal time to execute, performed in any order, and between any two of which equal amounts of communication required. Reduces overall processing time for given set of computational tasks.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Optimal Allocation Of Tasks In Hypercube Computers


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    01.04.1990



    Medientyp :

    Sonstige


    Format :

    Keine Angabe


    Sprache :

    Englisch




    A Complete Processor Allocation Strategy for Hypercube Computers

    Sua, J. R. / Mahgoub, I. | British Library Online Contents | 1998


    The Mark III Hypercube-Ensemble Computers

    Peterson, John C. / Tuazon, Jesus O. / Lieberman, Don et al. | NTRS | 1988


    Concurrent Finite-Element Analysis On Hypercube Computers

    Lyzenga, G. A. / Raefsky, A. / Nour-Omid, B. | NTRS | 1990


    Optimal Repetition Scheme for Repeated Latin Hypercube Sampling

    Beachkofski, Brian / Grandhi, Ramana | AIAA | 2002


    Dynamic Transfers Of Tasks Among Computers

    Liu, Howard T. / Silvester, John A. | NTRS | 1989