HomeAboutLogin
     
QuestBrowseEmbedPosterSignup
 
       
 
72 years

   
Edsger Wybe Dijkstra was a Dutch computer scientist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000.

Shortly before his death in 2002, he received the ACM PODC Influential Paper Award in distributed computing for his work on self-stabilization of program computation. This annual award was renamed the Dijkstra Prize the following year, in his honor.

Among his contributions to computer science are a shortest path algorithm, known as Dijkstra's algorithm; the Shunting yard algorithm; the THE multiprogramming system, an important early example of structuring a system as a set of layers; the Banker's algorithm; and the semaphore construct for coordinating multiple processors and programs. Another concept due to Dijkstra in the field of distributed computing is that of self-stabilization an alternative way to ensure the reliability of the system. Dijkstra's algorithm is used in SPF, Shortest Path First, which is used in the routing protocols OSPF and IS-IS.

More on this Website
• http://en.wikipedia.org/wiki/Edsger_W._Dijkstra

Related LinksAdd URL

 
 
Edsger Wybe Dijkstra was a Dutch computer scientist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000.

Shortly before his death in 2002, he received the ACM PODC Influential Paper Award in distributed computing for his work on self-stabilization of program computation. This annual award was renamed the Dijkstra Prize the following year, in his honor.

Among his contributions to computer science are a shortest path algorithm, known as Dijkstra's algorithm; the Shunting yard algorithm; the THE multiprogramming system, an important early example of structuring a system as a set of layers; the Banker's algorithm; and the semaphore construct for coordinating multiple processors and programs. Another concept due to Dijkstra in the field of distributed computing is that of self-stabilization an alternative way to ensure the reliability of the system. Dijkstra's algorithm is used in SPF, Shortest Path First, which is used in the routing protocols OSPF and IS-IS. More

 
    Alan Turing, Father of Modern Computing
  Alan Turing, Father of Modern Computing
Alan Turing was a mathematician who in 1937 suggested a theoretical machine, since called a Turing Machine, that became the basis of modern computing. In 1950 he suggested what has become known as a "Turing's test," still the criterion for recognizin...
 
       
 
         
          © 2003-2017 Timeline Index