Results 1  10
of
1,389,126
A First Come First Served Mutual Exclusion Algorithm With Small Communication Variables
 ACM Transactions on Programming Languages and Systems
, 1991
"... We present an algorithm for the mutual exclusion problem that satisfies the "first come first served" property and requires only five shared bits per participant. The algorithm works in a model of concurrency that does not assume atomic operations. August 26, 1991 i 1. Introduction Mutua ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We present an algorithm for the mutual exclusion problem that satisfies the "first come first served" property and requires only five shared bits per participant. The algorithm works in a model of concurrency that does not assume atomic operations. August 26, 1991 i 1. Introduction
On the MutualExclusion Problema quest for minimal solutions.
"... We prove that there is no solution with regular registers to the criticalsection problem for n processes whose registers are of total size 3n 1. For n = 2 this is the best result since for total size six, solutions exist, and are presented here. We emphasize that if one of the two processes nev ..."
Abstract
 Add to MetaCart
We prove that there is no solution with regular registers to the criticalsection problem for n processes whose registers are of total size 3n 1. For n = 2 this is the best result since for total size six, solutions exist, and are presented here. We emphasize that if one of the two processes never sleeps, then solutions for two processes with regular registers of total size ve do exist.
A Survey of MutualExclusion Algorithms for Multiprocessor Operating Systems
, 1995
"... The problem of mutualexclusion is that of guaranteeing that certain sections of code (critical sections) will not be executed by more than one process ..."
Abstract
 Add to MetaCart
The problem of mutualexclusion is that of guaranteeing that certain sections of code (critical sections) will not be executed by more than one process
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Algorithms for Scalable Synchronization on SharedMemory Multiprocessors
 ACM Transactions on Computer Systems
, 1991
"... Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract

Cited by 567 (32 self)
 Add to MetaCart
Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become
Analysis of FirstComeFirstServe Parallel Job Scheduling
 In Proceedings of the 9th SIAM Symposium on Discrete Algorithms
, 1998
"... This paper analyzes job scheduling for parallel computers by using theoretical and experimental means. Based on existing architectures we first present a machine and a job model. Then, we propose a simple online algorithm employing job preemption without migration and derive theoretical bounds for ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
This paper analyzes job scheduling for parallel computers by using theoretical and experimental means. Based on existing architectures we first present a machine and a job model. Then, we propose a simple online algorithm employing job preemption without migration and derive theoretical bounds
Improving FirstComeFirstServe Job Scheduling by Gang Scheduling
 In IPPS'98 Workshop on Job Scheduling Strategies for Parallel Processing
, 1998
"... . We present a new scheduling method for batch jobs on massively parallel processor architectures. This method is based on the First comefirstserve strategy and emphasizes the notion of fairness. Severe fragmentation is prevented by using gang scheduling which is only initiated by highly paral ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
. We present a new scheduling method for batch jobs on massively parallel processor architectures. This method is based on the First comefirstserve strategy and emphasizes the notion of fairness. Severe fragmentation is prevented by using gang scheduling which is only initiated by highly
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can
Results 1  10
of
1,389,126