Kumar, 1986 - Google Patents

Simulating feedforward systems using a network of processors

Kumar, 1986

Document ID
7250669018581722936
Author
Kumar D
Publication year
Publication venue
Proceedings of the 19th annual symposium on Simulation

External Links

Snippet

We present a distributed simulation scheme that can be used to simulate any feedforward system. The simulator in this scheme is a network of processors that communicate with each other via messages. The scheme Is simple, and involves almost no overhead messages. We …
Continue reading at dl.acm.org (other versions)

Classifications

    • 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/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30575—Replication, distribution or synchronisation of data between databases or within a distributed database; Distributed database system architectures therefor
    • 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/54—Interprogramme communication; Intertask communication
    • 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/52—Programme synchronisation; Mutual exclusion, e.g. by means of semaphores; Contention for resources among tasks
    • 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/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • 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/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • 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

Similar Documents

Publication Publication Date Title
Labetoulle et al. Isolation method in a network of queues
Baccelli et al. An end-to-end approach to the resequencing problem
Ho et al. Perturbation analysis and optimization of queueing networks
Bochmann et al. Formal methods in communication protocol design
Jefferson et al. Time warp operating system
US5193188A (en) Centralized and distributed wait depth limited concurrency control methods and apparatus
Clark Use of Polya distributions in approximate solutions to nonstationary M/M/s queues
US5001730A (en) Clock synchronization algorithm for address independent networks
Wolfson et al. Incremental evaluation of rules and its relationship to parallelism
Kumar Simulating feedforward systems using a network of processors
Amon et al. Sizing synchronization queues: A case study in higher level synthesis
Ferscha Concurrent execution of timed Petri nets
Rajsbaum et al. On the performance of synchronized programs in distributed networks with random processing times and transmission delays
Nicol et al. Optimistic parallel simulation of continuous time Markov chains using uniformization
Bernabéu-Aubán et al. Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm
Reed Parallel discrete event simulation: a case study
Hong Approximate analysis of timer-controlled priority scheme in the single-service token-passing systems
Mishra An efficient voting and priority based mechanism for deadlock prevention in distributed systems
Baldoni et al. Distributed algorithms for multiple entries to a critical section with priority
Dimitrijevic et al. A procedure for probabilistic protocol verification
Spirn Multi-queue scheduling of two tasks
Chiola et al. Exploiting timed petri net properties for distributed simulation partitioning
Rajsbaum et al. On the average performance of synchronized programs in distributed networks
Shasha et al. An Analytical Model for the Performance of Concurrent B Tree Algorithms
Groselj Fault-tolerant distributed simulation