إدسخر دكسترا

Edsger Wybe Dijkstra
Edsger Wybe Dijkstra
	Edsger Wybe Dijkstra in 2002
وُلِدَ	11 مايو 1930; Rotterdam, Netherlands
توفي	6 أغسطس 2002 (aged 72); Nuenen, Netherlands
اللقب	Dijkstra's algorithm (single-source shortest path problem); DJP algorithm (minimum spanning tree problem); First implementation of ALGOL 60 compiler; Structured analysis; Structured programming; Semaphore; Layered approach to operating system design; THE multiprogramming system; Concept of multiprogramming systems; Concept of levels of abstraction; Concept of layered structure in software architecture (layered architecture); Concept of cooperating sequential processes; Concept of program families; Concept of guards; Multithreaded programming; Concurrent programming; Concurrent algorithms; Principles of distributed computing; Distributed algorithms; Synchronization primitive; Mutual exclusion; Critical section; Generalization of Dekker's algorithm; Tri-color marking algorithm; Call stack; Fault-tolerant systems; Self-stabilizing distributed systems; Resource starvation; Deadly embrace; Deadlock prevention algorithms; Shunting-yard algorithm; Banker's algorithm; Dining philosophers problem; Sleeping barber problem; Producer–consumer problem (bounded buffer problem); Dutch national flag problem; Predicate transformer semantics; Guarded Command Language; Weakest precondition calculus; Unbounded nondeterminism; Dijkstra-Scholten algorithm; Smoothsort; Separation of concerns; Program verification; Program derivation; Software crisis; Software architecture; GOTO-less programming; Stepwise program composition; Mathematical approach to programming methodology; Role of academic research in computer science;
الجوائز	Turing Award (1972); Association for Computing Machinery; Dijkstra Prize (2002);
	السيرة العلمية
المجالات	Computing science; Theoretical computer science;
الهيئات	Mathematisch Centrum; Eindhoven University of Technology; Burroughs Corporation; The University of Texas at Austin;
المشرف على الدكتوراه	Adriaan van Wijngaarden
طلاب الدكتوراه	Nico Habermann; Martin Rem; David Naumann; Cornelis Hemerik; Jan Tijmen Udding; Johannes van de Snepscheut; Antonetta van Gasteren;
أثـَّر عليه	Adriaan van Wijngaarden;
أثـّر على	Tony Hoare; Niklaus Wirth; Per Brinch Hansen; Leslie Lamport; David Gries; David Parnas; Shlomi Dolev; Alexander Stepanov;

إدسخر ويبى ديكسترا (بالهولندية: Edsger Wybe Dijkstra) عالم حاسوب هولندي. حاز في 1972 على جائزة تورينغ لمساهماته الأساسية في تطوير لغات البرمجة.

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

حياته

ولد ديكسرا بروتردام في هولندا، لأب كيميائي وأم رياضياتية.

تعلم الرياضيات والفيزياء النظرية في جامعة ليدن. عمل في السنوات 1952-1962 كمبرمج، أكمل خلالها الدكتوراه في علم الحاسوب بجامعة أمستردام. أطروحة الدكتوراة، والتي سلمها في عام 1959، حملت عنوان Communication with an Automatic Computer، واستندت أيضا على خبرته كمبرمج.

في السنوات 1962-1984 كان بروفيسوراً للرياضيات في جامعة آيندهوفن، وفي السنوات 1973-1984 كان باحثاً في شكرة بوروز. وفي السنوات 1984-1999 كان بروفيسوراً لعلم الحاسوب في جامعة تكساس، أوستن.

حصل ديكسرا على جائزة تورينغ لسنة 1972.

أطلق اسمه على جائزة ديكسترا لرابطة مكائن الحوسبة. الجائزة تمنح كل سنة للمقال الذي كان له أكبر تأثير (لمدة عشر سنوات على الأقل) على مجال الحوسبة الموزعة. ديكسترا كان الفائز الأول بالجائزة (قبل أن اطلق عليها اسمه).

بعض من كتبه

Structured programming (with O.J. Dahl and C.A.R. Hoare), Academic Press, 1972
A Discipline of Programming, Prentice-Hall, 1976
Selected Writings on Computing: A Personal Perspective, Springer Verlag, 1982.

راجع أيضا

^ Marateck, Samuel L. (1977). FORTRAN (Academic Press), p. 488
^ Courtois, Pierre-Jacques (2008). Justifying the Dependability of Computer-based Systems: With Applications in Nuclear Engineering (Springer), p. 112
^ Denning, Peter J.; Martell, Craig H. (2015). Great Principles of Computing (MIT Press), p. 157
^ Birrell, N. D.; Ould, M. A. (1985). A Practical Handbook for Software Development (Cambridge University Press), p.181
^ Haigh, Thomas (2010)
^ 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. "Of great influence to Pascal was Structured Programming, put forth by E. W. Dijkstra. This method of proceeding in a design would obliviously be greatly encouraged by the use of a Structured Language, a language with a set of constructs that could freely be combined and nested. The textual structure of a program should directly reflect its flow of control."
^ 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 1965 Dijkstra wrote his famous Notes on Structured Programming and declared programming as a discipline in contrast to a craft. Also in 1965 Hoare published an important paper about data structuring. These ideas had a profound influence on new programming language, in particular Pascal. Languages are the vehicles in which these ideas were to be expressed. Structured programming became supported by a structured programming language."
^ 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."
^ خطأ استشهاد: وسم <ref> غير صحيح؛ لا نص تم توفيره للمراجع المسماة Lamport (2015)
^ Lo Russo, Graziano (1997). "An Interview with A. Stepanov (Edizioni Infomedia srl.)". STLport. Retrieved 30 August 2015. Alexander Stepanov: "...I also discovered books of two great computer scientists from whose work I learned the scientific foundation of my trade: Donald Knuth and Edsger Dijkstra. Knuth taught me the answers. Dijkstra taught me the questions. Time and time again I come back to their works for new insights."{{cite web}}: CS1 maint: numeric names: authors list (link)

[1] Marateck, Samuel L. (1977). FORTRAN (Academic Press), p. 488

[2] Courtois, Pierre-Jacques (2008). Justifying the Dependability of Computer-based Systems: With Applications in Nuclear Engineering (Springer), p. 112

[3] Denning, Peter J.; Martell, Craig H. (2015). Great Principles of Computing (MIT Press), p. 157

[4] Birrell, N. D.; Ould, M. A. (1985). A Practical Handbook for Software Development (Cambridge University Press), p.181

[Haigh,_Thomas_2010-5] Haigh, Thomas (2010)

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

[7] 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.

[8] 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. "Of great influence to Pascal was Structured Programming, put forth by E. W. Dijkstra. This method of proceeding in a design would obliviously be greatly encouraged by the use of a Structured Language, a language with a set of constructs that could freely be combined and nested. The textual structure of a program should directly reflect its flow of control."

[9] 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 1965 Dijkstra wrote his famous Notes on Structured Programming and declared programming as a discipline in contrast to a craft. Also in 1965 Hoare published an important paper about data structuring. These ideas had a profound influence on new programming language, in particular Pascal. Languages are the vehicles in which these ideas were to be expressed. Structured programming became supported by a structured programming language."

[10] 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."

[11] 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)-12] خطأ استشهاد: وسم <ref> غير صحيح؛ لا نص تم توفيره للمراجع المسماة Lamport (2015)

[13] Lo Russo, Graziano (1997). "An Interview with A. Stepanov (Edizioni Infomedia srl.)". STLport. Retrieved 30 August 2015. Alexander Stepanov: "...I also discovered books of two great computer scientists from whose work I learned the scientific foundation of my trade: Donald Knuth and Edsger Dijkstra. Knuth taught me the answers. Dijkstra taught me the questions. Time and time again I come back to their works for new insights."{{cite web}}: CS1 maint: numeric names: authors list (link)

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

Edsger Wybe Dijkstra
Edsger Wybe Dijkstra in 2002
وُلِدَ	(1930-05-11)11 مايو 1930 Rotterdam, Netherlands
توفي	6 أغسطس 2002(2002-08-06) (aged 72) Nuenen, Netherlands
اللقب	Dijkstra's algorithm (single-source shortest path problem) DJP algorithm (minimum spanning tree problem) First implementation of ALGOL 60 compiler Structured analysis Structured programming Semaphore Layered approach to operating system design THE multiprogramming system Concept of multiprogramming systems Concept of levels of abstraction^[1]^[2] Concept of layered structure in software architecture (layered architecture) Concept of cooperating sequential processes^[3] Concept of program families^[4] Concept of guards Multithreaded programming Concurrent programming Concurrent algorithms Principles of distributed computing Distributed algorithms Synchronization primitive Mutual exclusion Critical section Generalization of Dekker's algorithm Tri-color marking algorithm Call stack Fault-tolerant systems Self-stabilizing distributed systems Resource starvation Deadly embrace Deadlock prevention algorithms Shunting-yard algorithm Banker's algorithm Dining philosophers problem Sleeping barber problem Producer–consumer problem (bounded buffer problem) Dutch national flag problem Predicate transformer semantics Guarded Command Language Weakest precondition calculus Unbounded nondeterminism Dijkstra-Scholten algorithm Smoothsort Separation of concerns Program verification Program derivation Software crisis^[5] Software architecture^[6] GOTO-less programming Stepwise program composition Mathematical approach to programming methodology Role of academic research in computer science
الجوائز	Turing Award (1972) Association for Computing Machinery Dijkstra Prize (2002)
السيرة العلمية
المجالات	Computing science Theoretical computer science
الهيئات	Mathematisch Centrum Eindhoven University of Technology Burroughs Corporation The University of Texas at Austin
المشرف على الدكتوراه	Adriaan van Wijngaarden
طلاب الدكتوراه	Nico Habermann Martin Rem David Naumann Cornelis Hemerik Jan Tijmen Udding Johannes van de Snepscheut Antonetta van Gasteren
أثـَّر عليه	Adriaan van Wijngaarden
أثـّر على	Tony Hoare^[7] Niklaus Wirth^[8]^[9] Per Brinch Hansen^[10] Leslie Lamport^[11]^[12] David Gries David Parnas Shlomi Dolev Alexander Stepanov^[13]