• Login
    View Item 
    •   DSpace Home
    • Stony Brook University
    • College of Engineering and Applied Sciences
    • Technical Reports [SBU]
    • View Item
    •   DSpace Home
    • Stony Brook University
    • College of Engineering and Applied Sciences
    • Technical Reports [SBU]
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Simple Performance Bounds for Multicore and Parallel Channel Systems

    Thumbnail
    View/Open
    CEAS-832-Gamboa-Robertazzi-July-19-2010.pdf (606.0Kb)

    Date
    2010-07-19
    Author
    Robertazzi, Thomas G.
    Gamboa, Carlos
    Metadata
    Show full item record
    Subject
     Communications Systems; Divisible Load Scheduling; Scheduled Networked Computing; Multicore Systems 
    Abstract
    A simple modi cation of existing divisible load scheduling algo- rithms, boosting link speed by M for M parallel channels per link, allows time optimal load scheduling and performance prediction for parallel channel systems. The situation for multicore models is more complex but can be handled by a substitution involving equivalent pro- cessor speed. These modi cations yield upper bounds on such parallel systems' performance. This concept is illustrated for ideal single level (star) tree networks under a variety of scheduling policies. Less than ideal parallelism can also be modeled though mechanisms of ine ciency require further research.
    URI
    http://hdl.handle.net/1951/48182
    Collections
    • Technical Reports [SBU] [457]
    • Community Members' Scholarship [SBU CEAS] [470]
    Publisher
    Stony Brook University. College of Engineering and Applied Sciences.
    SUNY Digital Repository Support