A report on Edsger W. Dijkstra

Dijkstra in 2002
The Eindhoven University of Technology, located in Eindhoven in the south of the Netherlands, where Dijkstra was a professor of mathematics from 1962 to 1984.
The University of Texas at Austin, where Dijkstra held the Schlumberger Centennial Chair in Computer Sciences from 1984 until 1999.
Dijkstra's algorithm. It picks the unvisited vertex with the lowest-distance, calculates the distance through it to each unvisited neighbor, and updates the neighbor's distance if smaller. Mark visited (set to red) when done with neighbors.
ALGOL 60 was created as the result of the January 1960 ALGOL conference in Paris. By August 1960, Dijkstra and his colleague Jaap Zonneveld put into operation the first complete working ALGOL 60 compiler (for the Electrologica X1 computer) in the world. The Dijkstra–Zonneveld compiler predates the second ALGOL 60 compiler (by another group) by more than a year.
A semaphore (seinpaal), the term used in Dijkstra's original paper. In the early 1960s Dijkstra proposed the first synchronisation mechanism for concurrent processes, the semaphore with its two operations, P and V.
A simple example of two processes modifying a linked list at the same time causing a conflict. The requirement of mutual exclusion was first identified and solved by Dijkstra in his seminal 1965 paper titled Solution of a problem in concurrent programming control, and is credited as the first topic in the study of concurrent algorithms.
Illustration of the dining philosophers problem
Dijkstra at the blackboard during a conference at ETH Zurich in 1994. He once remarked, "A picture may be worth a thousand words, a formula is worth a thousand pictures."

Dutch computer scientist, programmer, software engineer, systems scientist, and science essayist.

- Edsger W. Dijkstra
Dijkstra in 2002

18 related topics with Alpha

Overall

CWI logo

Centrum Wiskunde & Informatica

2 links

The Centrum Wiskunde & Informatica (abbr.

The Centrum Wiskunde & Informatica (abbr.

CWI logo

Edsger Dijkstra did most of his early influential work on algorithms and formal methods at CWI.

Charles Babbage, sometimes referred to as the "father of computing".

Computer science

2 links

Study of computation, automation, and information.

Study of computation, automation, and information.

Charles Babbage, sometimes referred to as the "father of computing".
Ada Lovelace published the first algorithm intended for processing on a computer.

A folkloric quotation, often attributed to—but almost certainly not first formulated by—Edsger Dijkstra, states that "computer science is no more about computers than astronomy is about telescopes."

Software engineering

1 links

Systematic engineering approach to software development.

Systematic engineering approach to software development.

Edsger W. Dijkstra claimed that the terms software engineering and software engineer have been misused and should be considered harmful, particularly in the United States.

THE multiprogramming system

1 links

The THE multiprogramming system or THE OS was a computer operating system designed by a team led by Edsger W. Dijkstra, described in monographs in 1965-66 and published in 1968.

Self-stabilization

1 links

Concept of fault-tolerance in distributed systems.

Concept of fault-tolerance in distributed systems.

Many years after the seminal paper of Edsger Dijkstra in 1974, this concept remains important as it presents an important foundation for self-managing computer systems and fault-tolerant systems.

Dijkstra Prize

1 links

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.

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.

It was renamed in honor of Edsger W. Dijkstra in 2003, after he received the award for his work in self-stabilization in 2002 and died shortly thereafter.

Adriaan van Wijngaarden

1 links

Dutch mathematician and computer scientist.

Dutch mathematician and computer scientist.

In that same year, Van Wijngaarden hired Edsger Dijkstra, and they worked on software for the ARRA.

Memory of the X1

Electrologica X1

1 links

Digital computer designed and manufactured in the Netherlands from 1958 to 1965.

Digital computer designed and manufactured in the Netherlands from 1958 to 1965.

Memory of the X1

The X1 was the subject of Edsger Dijkstra's Ph.D. dissertation, and the target of the first complete working ALGOL 60 compiler, completed by Dijkstra and Jaap Zonneveld.

A semaphore (seinpaal, the term used in Dijkstra's original description ).

Semaphore (programming)

1 links

Variable or abstract data type used to control access to a common resource by multiple threads and avoid critical section problems in a concurrent system such as a multitasking operating system.

Variable or abstract data type used to control access to a common resource by multiple threads and avoid critical section problems in a concurrent system such as a multitasking operating system.

A semaphore (seinpaal, the term used in Dijkstra's original description ).

The semaphore concept was invented by Dutch computer scientist Edsger Dijkstra in 1962 or 1963, when Dijkstra and his team were developing an operating system for the Electrologica X8.

Tony Hoare in 2011

Tony Hoare

1 links

British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing.

British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing.

Tony Hoare in 2011

In the semantics of concurrency, he introduced the formal language communicating sequential processes (CSP) to specify the interactions of concurrent processes, and along with Edsger Dijkstra, formulated the dining philosophers problem.