A linear daisy chain of processors in which processor load is divisible and shared among the processors is examined. It is shown that two or more processors can be collapsed into a single equivalent processor. This equivalence allows a characterization of the nature of the minimal time solution, a simple method to determine when to distribute load for linear daisy chain networks of processors without front end communication subprocessors and closed form expressions for the equivalent processing speed of infinitely large daisy chains of processors.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Processor equivalence for daisy chain load sharing processors


    Contributors:


    Publication date :

    1993-10-01


    Size :

    518984 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Processor Equivalence for Daisy Chain Load Sharing Processors

    Robertazzi, T.G. | Online Contents | 1993


    Daisy chain communication bus and protocol

    VAN LAMMEREN JOHANNES PETRUS MARIA / DE GREEF PIERRE / LAMMERS MATHEUS JOHANNUS GERARDUS | European Patent Office | 2020

    Free access

    Daisy chain communication bus and protocol

    GREEF PIERRE DE / LAMMERS MATHEUS JOHANNUS GERARDUS / VAN LAMMEREN JOHANNES PETRUS MARIA | European Patent Office | 2017

    Free access

    Daisy-chain communication bus and protocol

    DE GREEF PETRUS MARIA / VAN LAMMEREN JOHANNES PETRUS MARIA / LAMMERS MATHEUS JOHANNUS GERARDUS | European Patent Office | 2015

    Free access

    Daisy chain control allocation - Lyapunov stability analysis

    Buffington, James / Enns, Dale | AIAA | 1995