Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Dijkstra Prize

Index Dijkstra Prize

The Edsger W. Dijkstra Paper Prize in Distributed Computing is given for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a decade. [1]

28 relations: Algorithm, Association for Computing Machinery, Asynchronous communication, Byzantine fault tolerance, Chandy-Lamport algorithm, Communications of the ACM, Consensus (computer science), Distributed algorithm, Distributed computing, Edsger W. Dijkstra, European Association for Theoretical Computer Science, Failure detector, Fault tolerance, International Symposium on Distributed Computing, Journal of the ACM, King Juan Carlos University, List of important publications in concurrent, parallel, and distributed computing, Maurice Herlihy, Maximal independent set, Microsoft Research, Minimum spanning tree, Mutual exclusion, Randomized algorithm, Self-stabilization, Shared memory, Symposium on Foundations of Computer Science, Symposium on Principles of Distributed Computing, Transactional memory.

Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

New!!: Dijkstra Prize and Algorithm · See more »

Association for Computing Machinery

The Association for Computing Machinery (ACM) is an international learned society for computing.

New!!: Dijkstra Prize and Association for Computing Machinery · See more »

Asynchronous communication

In telecommunications, asynchronous communication is transmission of data, generally without the use of an external clock signal, where data can be transmitted intermittently rather than in a steady stream.

New!!: Dijkstra Prize and Asynchronous communication · See more »

Byzantine fault tolerance

Byzantine fault tolerance (BFT) is the dependability of a fault-tolerant computer system, particularly distributed computing systems, where components may fail and there is imperfect information on whether a component is failed.

New!!: Dijkstra Prize and Byzantine fault tolerance · See more »

Chandy-Lamport algorithm

The Chandy–Lamport algorithm is a snapshot algorithm that is used in distributed systems for recording a consistent global state of an asynchronous system.

New!!: Dijkstra Prize and Chandy-Lamport algorithm · See more »

Communications of the ACM

Communications of the ACM is the monthly journal of the Association for Computing Machinery (ACM).

New!!: Dijkstra Prize and Communications of the ACM · See more »

Consensus (computer science)

A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes.

New!!: Dijkstra Prize and Consensus (computer science) · See more »

Distributed algorithm

A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors.

New!!: Dijkstra Prize and Distributed algorithm · See more »

Distributed computing

Distributed computing is a field of computer science that studies distributed systems.

New!!: Dijkstra Prize and Distributed computing · See more »

Edsger W. Dijkstra

Edsger Wybe Dijkstra (11 May 1930 – 6 August 2002) was a Dutch systems scientist, programmer, software engineer, science essayist, and early pioneer in computing science.

New!!: Dijkstra Prize and Edsger W. Dijkstra · See more »

European Association for Theoretical Computer Science

The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972.

New!!: Dijkstra Prize and European Association for Theoretical Computer Science · See more »

Failure detector

In a distributed computing system, a failure detector is a computer application or a subsystem that is responsible for the detection of node failures or crashes.

New!!: Dijkstra Prize and Failure detector · See more »

Fault tolerance

Fault tolerance is the property that enables a system to continue operating properly in the event of the failure (or one or more faults within) some of its components.

New!!: Dijkstra Prize and Fault tolerance · See more »

International Symposium on Distributed Computing

The International Symposium on Distributed Computing (DISC) is an annual academic conference for refereed presentations, whose focus is the theory, design, analysis, implementation, and application of distributed systems and networks.

New!!: Dijkstra Prize and International Symposium on Distributed Computing · See more »

Journal of the ACM

The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.

New!!: Dijkstra Prize and Journal of the ACM · See more »

King Juan Carlos University

King Juan Carlos University (Universidad Rey Juan Carlos, URJC) is a Spanish public research university located in the southern area of the Community of Madrid (Spain), with four campuses at Móstoles, Alcorcón, Vicálvaro and Fuenlabrada.

New!!: Dijkstra Prize and King Juan Carlos University · See more »

List of important publications in concurrent, parallel, and distributed computing

This is a list of important publications in concurrent, parallel, and distributed computing, organized by field.

New!!: Dijkstra Prize and List of important publications in concurrent, parallel, and distributed computing · See more »

Maurice Herlihy

Maurice Peter Herlihy (born 4 January 1954) is a computer scientist active in the field of multiprocessor synchronization.

New!!: Dijkstra Prize and Maurice Herlihy · See more »

Maximal independent set

In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set.

New!!: Dijkstra Prize and Maximal independent set · See more »

Microsoft Research

Microsoft Research is the research subsidiary of Microsoft.

New!!: Dijkstra Prize and Microsoft Research · See more »

Minimum spanning tree

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

New!!: Dijkstra Prize and Minimum spanning tree · See more »

Mutual exclusion

In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions; it is the requirement that one thread of execution never enter its critical section at the same time that another concurrent thread of execution enters its own critical section.

New!!: Dijkstra Prize and Mutual exclusion · See more »

Randomized algorithm

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic.

New!!: Dijkstra Prize and Randomized algorithm · See more »

Self-stabilization

Self-stabilization is a concept of fault-tolerance in distributed computing.

New!!: Dijkstra Prize and Self-stabilization · See more »

Shared memory

In computer science, shared memory is memory that may be simultaneously accessed by multiple programs with an intent to provide communication among them or avoid redundant copies.

New!!: Dijkstra Prize and Shared memory · See more »

Symposium on Foundations of Computer Science

The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science.

New!!: Dijkstra Prize and Symposium on Foundations of Computer Science · See more »

Symposium on Principles of Distributed Computing

The Symposium on Principles of Distributed Computing (PODC) is an academic conference in the field of distributed computing organised annually by the Association for Computing Machinery (special interest groups SIGACT and SIGOPS).

New!!: Dijkstra Prize and Symposium on Principles of Distributed Computing · See more »

Transactional memory

In computer science and engineering, transactional memory attempts to simplify concurrent programming by allowing a group of load and store instructions to execute in an atomic way.

New!!: Dijkstra Prize and Transactional memory · See more »

Redirects here:

Dijkstra prize, Edsger W. Dijkstra Prize, Edsger W. Dijkstra Prize in Distributed Computing, PODC Influential-Paper Award.

References

[1] https://en.wikipedia.org/wiki/Dijkstra_Prize

OutgoingIncoming
Hey! We are on Facebook now! »