Edsger W. Dijkstra

Edsger Wybe Dijkstra
Edsger Wybe Dijkstra
	(2002)
Born	11 Mey 1930; Rotterdam, Netherlands
Died	6 August 2002 (aged 72); Nuenen, Netherlands
Alma mater	Leiden University; (B.S., M.S.); University o Amsterdam; (Ph.D.)
Kent for	Dijkstra's algorithm; DJP algorithm; First implementation o ALGOL 60; Structured programmin; Semaphore; THE multiprogramming system; Multithreaded programmin; Concurrent programmin; Principles o distributit computin; Mutual exclusion; Call stack; Faut-tolerant seestems; Sel-stabilisin distributit seestems; Deidly embrace; Shuntin-yaird algorithm; Banker's algorithm; Dinin filosofers problem; Predicate transformer semantics; Guarded Command Language; Waikest precondeetion calculus; Smoothsort; Separation o concerns; Saftware airchitectur;
Awairds	Turing Award (1972); ACM Fellow (1994); Dijkstra Prize (2002);
	Scientific career
Fields	Computin science; Theoretical computer science;
Institutions	Mathematisch Centrum; Eindhoven University o Technology; Burroughs Corporation; The University o Texas at Austin;
Thesis	Communication with an Automatic Computer (1959)
Doctoral advisor	Adriaan van Wijngaarden
Doctoral students	Nico Habermann; Jan van de Snepscheut;
Influences	Adriaan van Wijngaarden;
Influenced	Tony Hoare; Niklaus Wirth; Per Brinch Hansen; Leslie Lamport; David Gries; David Parnas; Shlomi Dolev; Alexander Stepanov;

Edsger Wybe Dijkstra (Dutch: [ˈɛtsxər ˈʋibə ˈdɛikstra] ( listen); 11 Mey 1930 – 6 August 2002) wis a Dutch computer scientist^[9] an an early important feegur in mony resairch auries o computin science wha held the Schlumberger Centennial Chair in Computer Sciences at the University o Texas at Austin frae 1984 till his retirement in 1999.

References[eedit | eedit soorce]

↑ Albin, Stephen T. (2003). The Art of Software Architecture: Design Methods and Techniques (Wiley Publishing, Inc.), p. 3
↑ Hoare, C. A. R. (12 October 2010). "The 2010 Edsger W. Dijkstra Memorial Lecture: What Can We Learn from Edsger W. Dijkstra?". Department of Computer Science, The University of Texas at Austin. Retrieved 12 August 2015.
↑ Ryder, Barbara G.; Soffa, Mary Lou; Burnett, Margaret (2005). Impact of Software Engineering Research on Modern Programming Languages. ACM Transactions on Software Engineering and Methodology, Vol. 14, No. 4, October 2005, p. 431-477.
↑ Wirth, Niklaus (2008). A Brief History of Software Engineering. IEEE Annals of the History of Computing, vol.30, no. 3, July–September 2008, pp. 32–39.
↑ In his 2004 memoir, "A Programmer's Story: The Life of a Computer Pioneer", Brinch Hansen wrote that he used "Cooperating Sequential Processes" to guide his work implementing multiprogramming on the RC 4000, and described it saying, "One of the great works in computer programming, this masterpiece laid the conceptual foundation for concurrent programming."
↑ As Lamport (2002) wrote, "Edsger W. Dijkstra started the field of concurrent and distributed algorithms with his 1965 CACM paper "Solution of a Problem in Concurrent Programming Control", in which he first stated and solved the mutual exclusion problem. That paper is probably why PODC exists; it certainly inspired most of my work."
↑ Lamport, Leslie. "Turing Lecture: The Computer Science of Concurrency: The Early Years (Communications of the ACM, Vol. 58 No. 6, June 2015)". ACM. Retrieved 22 September 2015.
↑ Lo Russo, Graziano (1997). "An Interview with A. Stepanov (Edizioni Infomedia srl.)". STLport. Retrieved 30 August 2015.
↑ Hoare, Tony (March 2003). "Obituary: Edsger Wybe Dijkstra". Physics Today. 56 (3): 96–98. doi:10.1063/1.1570789.

[1] Albin, Stephen T. (2003). The Art of Software Architecture: Design Methods and Techniques (Wiley Publishing, Inc.), p. 3

[2] Hoare, C. A. R. (12 October 2010). "The 2010 Edsger W. Dijkstra Memorial Lecture: What Can We Learn from Edsger W. Dijkstra?". Department of Computer Science, The University of Texas at Austin. Retrieved 12 August 2015.

[3] Ryder, Barbara G.; Soffa, Mary Lou; Burnett, Margaret (2005). Impact of Software Engineering Research on Modern Programming Languages. ACM Transactions on Software Engineering and Methodology, Vol. 14, No. 4, October 2005, p. 431-477.

[4] Wirth, Niklaus (2008). A Brief History of Software Engineering. IEEE Annals of the History of Computing, vol.30, no. 3, July–September 2008, pp. 32–39.

[5] In his 2004 memoir, "A Programmer's Story: The Life of a Computer Pioneer", Brinch Hansen wrote that he used "Cooperating Sequential Processes" to guide his work implementing multiprogramming on the RC 4000, and described it saying, "One of the great works in computer programming, this masterpiece laid the conceptual foundation for concurrent programming."

[6] As Lamport (2002) wrote, "Edsger W. Dijkstra started the field of concurrent and distributed algorithms with his 1965 CACM paper "Solution of a Problem in Concurrent Programming Control", in which he first stated and solved the mutual exclusion problem. That paper is probably why PODC exists; it certainly inspired most of my work."

[Lamport_(2015)-7] Lamport, Leslie. "Turing Lecture: The Computer Science of Concurrency: The Early Years (Communications of the ACM, Vol. 58 No. 6, June 2015)". ACM. Retrieved 22 September 2015.

[8] Lo Russo, Graziano (1997). "An Interview with A. Stepanov (Edizioni Infomedia srl.)". STLport. Retrieved 30 August 2015.

[9] Hoare, Tony (March 2003). "Obituary: Edsger Wybe Dijkstra". Physics Today. 56 (3): 96–98. doi:10.1063/1.1570789.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

Edsger W. Dijkstra

References[eedit | eedit soorce]

Navigâtion menu

Personal tuils

Namespaces

Variants

Views

Mair

Rake

Navigation

In ither projects

Prent/export

Tuilkist

In ither leids

Edsger Wybe Dijkstra
(2002)
Born	11 Mey 1930(1930-05-11) Rotterdam, Netherlands
Died	6 August 2002(2002-08-06) (aged 72) Nuenen, Netherlands
Alma mater	Leiden University (B.S., M.S.) University o Amsterdam (Ph.D.)
Kent for	Dijkstra's algorithm DJP algorithm First implementation o ALGOL 60 Structured programmin Semaphore THE multiprogramming system Multithreaded programmin Concurrent programmin Principles o distributit computin Mutual exclusion Call stack Faut-tolerant seestems Sel-stabilisin distributit seestems Deidly embrace Shuntin-yaird algorithm Banker's algorithm Dinin filosofers problem Predicate transformer semantics Guarded Command Language Waikest precondeetion calculus Smoothsort Separation o concerns Saftware airchitectur^[1]
Awairds	Turing Award (1972) ACM Fellow (1994) Dijkstra Prize (2002)
Scientific career
Fields	Computin science Theoretical computer science
Institutions	Mathematisch Centrum Eindhoven University o Technology Burroughs Corporation The University o Texas at Austin
Thesis	Communication with an Automatic Computer (1959)
Doctoral advisor	Adriaan van Wijngaarden
Doctoral students	Nico Habermann Jan van de Snepscheut
Influences	Adriaan van Wijngaarden
Influenced	Tony Hoare^[2] Niklaus Wirth^[3]^[4] Per Brinch Hansen^[5] Leslie Lamport^[6]^[7] David Gries David Parnas Shlomi Dolev Alexander Stepanov^[8]