[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Sinclair, 1988 - Google Patents

Optimal assignments in broadcast networks

Sinclair, 1988

Document ID
14945530104420625964
Author
Sinclair J
Publication year
Publication venue
IEEE transactions on computers

External Links

Snippet

A program whose execution is distributed among several processors in a broadcast system has a total execution cost equal to the sum of processor costs and communication costs, which are functions of the amount of data transmitted and the average transmission delays …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17337—Direct connection machines, e.g. completely connected computers, point to point communication networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]

Similar Documents

Publication Publication Date Title
Kumar et al. Scalable load balancing techniques for parallel computers
Bar-Noy et al. On chromatic sums and distributed resource allocation
US8718030B2 (en) Methods and apparatus for performing channel tree operations
Cheung Graph traversal techniques and the maximum flow problem in distributed computation
Bal et al. Experience with distributed programming in Orca
KR950704745A (en) METHOD AND APPARATUS FOR ARBITRATING ON AN ACTCLIC DIRECTED GRAPH
Bhatt et al. Tight bounds for on-line tree embeddings
Sinclair Optimal assignments in broadcast networks
US7308684B2 (en) Classifying software and reformulating resources according to classifications
Bertier et al. Distributed mutual exclusion algorithms for grid applications: A hierarchical approach
Chen et al. A fast recursive mapping algorithm
Franceschinis et al. Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets
Kan et al. Stochastic integer programming
Clementi et al. On the hardness of approximating optimum schedule problems in store and forward networks
Koutsougeras et al. Data flow graph partitioning to reduce communication cost
Park et al. An efficient collective communication method for grid scale networks
Juang et al. Load balancing and ordered selections in a computer system with multiple contention buses
Park et al. DASP: a general-purpose MIMD parallel computer using distributed associative processing
Dimopoulos et al. Optimal and suboptimal processor allocation for hypercycle-based multiprocessors
Abidine A distributed group mutual exclusion algorithm for IoT systems
Kawaguchi et al. A Task Mapping Algorithm for Linear Array Processors
Kvas et al. Evaluation of static program allocation schemes for macro data-flow computer
Naimi Distributed mutual exclusion on hypercubes
Min et al. Determining external contention delay due to job interactions in a 2-D mesh wormhole routed multicomputer
Ruighaver Heuristic Task Allocation Algorithms for PANDORA Robert Holt rfh@ cs. mu. oz. au