Barrier (computer science)

Known as: Barrier, Synchronous rendezvous, Rendezvous 
In parallel computing, a barrier is a type of synchronization method. A barrier for a group of threads or processes in the source code means any… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The Map Reduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map… (More)
  • figure 1
  • figure 3
  • figure 2
  • table I
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present Disco, an asynchronous neighbor discovery and rendezvous protocol that allows two or more nodes to operate their… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Highly Cited
2005
A numerical method to deconvolve complex body waves into a multiple shock sequence is developed. With the assumption that all the… (More)
  • figure 2
  • figure 5
  • table 1
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A decomposition of aggregate labor productivity based on internationally comparable data from FAO and Penn World Tables reveals… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The concept of culture has become a quagmire for the social sciences. Intuitively, we all know what it is and feel it to be… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper presents novel compiler optimizations for reducing synchronization overhead in compiler-parallelized scientific codes… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The fundamental premise behind the DASH project is that it is feasible to build large-scale shared-memory multiprocessors with… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We describe two new algorithms for implementing barrier synchronization on a shared-memory multicomputer. Both algorithms are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We describe and algorithm for barrier synchronization that requires only read and write to shared store. The algorithm is faster… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?