Editing Edsger W. Dijkstra (section)

== Legacy ==
Dijkstra won the Turing award in 1972 for his advocacy of structured programming, a programming paradigm that makes use of structured control flow as opposed to unstructured jumps to different sections in a program using [[Goto]] statements. His 1968 letter to the editor of ''Communications of ACM, "''Go To statement considered harmful''"'', caused a major debate. Modern programmers generally adhere to the paradigm of structured programming.<ref>{{Cite web |title=Edsger W. Dijkstra - A.M. Turing Award Laureate |url=https://amturing.acm.org/award_winners/dijkstra_1053701.cfm |access-date=12 January 2023 |website=amturing.acm.org}}</ref>

Among his most famous contributions to computer science is ''[[Shortest path problem|shortest path]] [[algorithm]]'', known as ''[[Dijkstra's algorithm]],'' widely taught in modern computer science undergraduate courses. His other contributions included 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 (programming)|semaphore]] construct for coordinating multiple processors and programs. Another concept formulated by 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 [[Open Shortest Path First|OSPF]] and [[IS-IS]].<ref>{{cite news |last1=Moy |first1=John |title=OSPF Version 2 |newspaper=Ietf Datatracker |date=April 1998 |url=https://datatracker.ietf.org/doc/html/rfc2328 |publisher=IETF |access-date=24 July 2022}}</ref><ref>{{cite web |title=ISO/IEC 10589:2002 |url=https://www.iso.org/standard/30932.html |publisher=International Organization for Standardization |access-date=24 July 2022}}</ref>