• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 8,155
Next 10 →

synchronous problems

by Alok Choudhary, Geoffrey C. Fox, Sanja Ranka, Seema Hiranandani, Alok Choudhary, Sanjay Ranka, Seema Hiranandani, Ken Kennedy, Charles Koelbel, Joel Saltz, Alok Choudhary, Sanjay Ranka, Seema Hiranandani, Ken Kennedy, Charles Koelbel, Joel Saltz , 1992
"... Software support for irregular and loosely ..."
Abstract - Add to MetaCart
Software support for irregular and loosely

The Wireless Synchronization Problem

by Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabian Kuhn, Calvin Newport , 2009
"... In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their round numbering. We assume a collection of n synchronous devices with access to a shared band of the radio spectrum, divided i ..."
Abstract - Cited by 16 (6 self) - Add to MetaCart
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their round numbering. We assume a collection of n synchronous devices with access to a shared band of the radio spectrum, divided

Wait-Free Synchronization

by Maurice Herlihy - ACM Transactions on Programming Languages and Systems , 1993
"... A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lie ..."
Abstract - Cited by 851 (28 self) - Add to MetaCart
A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another

Generation and Synchronous Tree-Adjoining Grammars

by Stuart M. Shieber, Yves Schabes , 1990
"... Tree-adjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations. We dem ..."
Abstract - Cited by 774 (43 self) - Add to MetaCart
demonstrate that this intuition can be made concrete by using the formalism of synchronous tree-adjoining grammars. The use of synchronous TAGs for generation provides solutions to several problems with previous approaches to TAG generation. Furthermore, the semantic monotonicity requirement previously

to the firing squad synchronization problem

by Darin Goldstein, Nick Meyer
"... Abstract. We consider several problems relating to stronglyconnected directed networks of identical finite-state processors that work synchronously in discrete time steps. The conceptually simplest of these problems is the Wake Up and Report Problem; this is the problem of having a unique “root ” pr ..."
Abstract - Add to MetaCart
Abstract. We consider several problems relating to stronglyconnected directed networks of identical finite-state processors that work synchronously in discrete time steps. The conceptually simplest of these problems is the Wake Up and Report Problem; this is the problem of having a unique “root

Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors

by John M. Mellor-crummey, Michael L. Scott - ACM Transactions on Computer Systems , 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract - Cited by 573 (32 self) - Add to MetaCart
markedly more pronounced as applications scale. We argue that this problem is not fundamental, and that one can in fact construct busy-wait synchronization algorithms that induce no memory or interconnect contention. The key to these algorithms is for every processor to spin on separate locally

Time, Clocks, and the Ordering of Events in a Distributed System

by Leslie Lamport , 1978
"... The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering i ..."
Abstract - Cited by 2869 (14 self) - Add to MetaCart
is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become.

On Formulations of Firing Squad Synchronization Problems

by Kojiro Kobayashi, Darin Goldstein
"... Abstract. We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield d ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield

A SURVEY OF SYNCHRONIZATION PROBLEMS*

by Sep So, S Holober Noooi--c, Yale Universityuij, George Holober, Repot Dcumntaton, Ageread Instructionsrepot, Dcumntaton Agebefore, Completing Form , 1980
"... nEElllElllllEl ..."
Abstract - Add to MetaCart
nEElllElllllEl

Impossibility of distributed consensus with one faulty process

by Michael J. Fischer, Nancy A Lynch, Michael S. Paterson , 1983
"... The consensus problem involves an asynchronous system of proceses, some of which may be unreliable. The problem is for the rcliablc processes to agree on a bbary value. h this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only otre faulty p ..."
Abstract - Cited by 1721 (28 self) - Add to MetaCart
process Ey way of contnst, solutions tte known for the synchronous case, the "Byzantine Generals" problem.
Next 10 →
Results 1 - 10 of 8,155
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University