Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Concurrent algorithm

In computer science, a concurrent algorithm is one that can be executed concurrently. Most standard computer algorithms are sequential algorithms… Expand
Wikipedia

Related topics

Related topics

9 relations
Computer scienceConcurrency (computer science)Concurrency controlDistributed algorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped… Expand
  • figure 6
  • figure 9
  • figure 11
Is this relevant?
2013
2013
Fast and scalable rendezvousing
In an asymmetric rendezvous system, such as an unfair synchronous queue or an elimination array, threads of two types, consumers… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration
In this paper, we consider the challenge of maximizing an unknown function f for which evaluations are noisy and are acquired… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Concurrent Library Correctness on the TSO Memory Model
Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Abstraction for concurrent objects
Concurrent data structures are usually designed to satisfy correctness conditions such as sequential consistency or… Expand
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
On interprocess communication
  • L. Lamport
  • Distributed Computing
  • 2005
    • Corpus ID: 6111535
Interprocess communication is studied without assuming any lower-level communication primitives. Three classes of communication… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Performance of B+ tree concurrency control algorithms
A number of algorithms have been proposed to access B+-trees concurrently, but they are not well understood. In this article, we… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The Early Search for Tractable Ways of Reasoning about Programs
  • C. Jones
  • IEEE Ann. Hist. Comput.
  • 2003
    • Corpus ID: 9236653
This article traces the history - up to around 1990 - of research on reasoning about programs. The main focus is on sequential… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Implementation of some concurrent algorithms for matrix factorization
Abstract Three parallel algorithms for computing the QR-factorization of a matrix are presented. The discussion is primarily… Expand
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Termination of Probabilistic Concurrent Program
The asynchronous execution behavior of several concurrent processes, which may use randomization, is studied. Viewing each… Expand
  • figure 2
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE