DOCSLIB.ORG

Deadlock and Lock Freedom in the Linear -Calculus

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Deadlock and Lock Freedom in the Linear -Calculus Deadlock and lock freedom in the linear π-calculus Luca Padovani To cite this version: Luca Padovani. Deadlock and lock freedom in the linear π-calculus. 2014. hal-00932356v2 HAL Id: hal-00932356 https://hal.inria.fr/hal-00932356v2 Preprint submitted on 20 Jan 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Deadlock and lock freedom in the linear π-calculus Luca Padovani – Dipartimento di Informatica, Università di Torino, Italy Abstract—We study two refinements of the linear π-calculus that are not just technically simpler but also more accurate that ensure deadlock freedom (the absence of stable states with in establishing (dead)lock freedom of relevant processes. pending linear communications) and lock freedom (the eventual In a nutshell, we consider channel types of the form pι[t]n completion of pending linear communications). The main feature m of both type systems is a new form of channel polymorphism that where the polarity p (either input ? or output !), the type of affects their accuracy in a significant way: they are the first of the message (t), and the multiplicity (unlimited ! or linear 1), their kind that can deal with recursive processes communicating are just like in the linear π-calculus. In addition, we annotate in cyclic network topologies. channel types with two numbers, a priority n and m tickets. Priorities enforce an order on the use of channels: when a I. INTRODUCTION process owns two or more channels at the same time, channels The linear π-calculus [21] is a resource-aware model of with higher priority must be used before channels with lower communicating processes that distinguishes between linear priority (beware that we adopt the convention that “higher and unlimited channels. Unlimited channels can be used priority” means “smaller number”). In particular, an input without restrictions, while linear channels are meant to be u?(x):P is well typed if u has higher priority than all the used for exactly one communication. This intrinsic limitation is channels occurring in P and an output u!hvi is well typed if rewarded by several benefits, including specialized behavioral u has higher priority than v. This mechanism makes (1) ill equivalences for reasoning about communication optimiza- typed: it is not possible to assign two priorities h and k to a tions, the efficient implementation of linear channels, and the and b, for the structure of the process requires the simultaneous fact that communications on linear channels enjoy desirable satisfiability of the two constraints h < k and k < h. properties such as determinism and confluence. The value of Tickets limit the number of travels that channels can do: these benefits is amplified given that a significant fraction of u!hvi is well typed if v has at least one ticket; each time a channels in several actual systems happen to be linear. channel is sent as a message, one ticket is removed from its From an operational standpoint, the linear π-calculus only type; a channel with no tickets cannot travel and must be used guarantees that well-typed processes never communicate twice directly for performing a communication. This mechanism on the same linear channel. In practice, one may be interested makes (2) ill typed, because a is sent on c infinitely many in stronger guarantees, such as deadlock freedom [19] – the times and so it would need infinitely many tickets. absence of stable states with pending communications on The technique described thus far prevents deadlocks (if linear channels – or lock freedom [17], [22] – the possibility we just consider the constraints on priorities) and locks (if to complete pending communications on linear channels. A we also consider the constraints on tickets). Unfortunately, it paradigmatic example of deadlock is illustrated by the process fails to type most recursive processes. For example, the usual a?(x):b!hxi j b?(y):a!hyi (1) encoding of the factorial below where, for convenience, we have annotated linear names with their priority, is ill typed: where the left subprocess forwards on b the message x received h from a, and the right subprocess forwards on a the message y ∗fact?(x; y ): (3) h received from b. The process (1) is well typed when a and b if x = 0 then y !h1i k k k h are linear channels, but none of the pending communications else (νa )(fact!hx − 1; a i j a ?(z):y !hx × zi) on a and b can complete because of the mutual dependencies Since the newly created channel a is used in the same position between corresponding inputs and outputs. An example of lock as y in the recursive invocation of fact, we are led into thinking which is not a deadlock is illustrated by the process that a and y should have the same type hence the same priority c!hai j ∗c?(x):c!hxi j a!h1984i (2) h = k. This clashes with the input on a that blocks the output on y, requiring k < h. We see a symmetric phenomenon in where one occurrence of the linear channel a is repeatedly h k h k k sent over the unlimited channel c but never used for receiving ∗stream?(x; y ):(νa )(y !hx; a i j stream!hx + 1; a i) (4) the 1984 message. Note that (2), unlike (1), reduces forever, which generates a stream of integers. Here too a and y are but the communication pending on a cannot be completed. used in the same position and should have the same priority In this work we propose two refinements of the linear h = k, but the output y!hx; ai also requires h < k. π-calculus such that well-typed processes are (dead)lock free. We need some way to overcome these difficulties. Let us The techniques we put forward have been inspired by previous digress for a moment from fact and stream and consider ideas presented in [17]–[19], [22], except that by narrowing def h k h def h k k h the focus on the linear π-calculus we obtain type systems F1 = c?(x ):y !hx i and F2 = c?(x ; y ):y !hx i both of which forward a linear channel x received from c to are the same t1, t2, ::: that we initially guessed in (5), except the linear channel y. In both cases it must be k < h, but there that now t and s are regular hence finitely representable. is a key difference between F1 and F2: the priority of x in Summary of contributions. We strengthen the notion of F1 has a fixed lower bound k + 1 because y is free, while the linearity in the linear π-calculus by defining two type systems priority of x in F2 is arbitrary, provided that k < h, because ensuring the absence of deadlocks and locks involving linear y is bound. Rephrased in technical jargon, c is monomorphic channels, namely that linear channels are used exactly once in F1 and polymorphic in F2 with respect to priorities. The as opposed to at most once. We exploit the features of the fact that a channel like c is monomorphic or polymorphic linear π-calculus to devise a form of channel polymorphism depends on the presence or absence of free linear channels that allows us to deal with recursive processes that interleave in the continuation that follows the input on c. Normally this actions on different linear channels also in cyclic network information is not inferrable solely from the type of c, but topologies. Such configurations are common in the implemen- it turns out that we can easily approximate it in the linear tation of parallel algorithms and session-based networks, and π-calculus, where replicated processes cannot have free linear cannot be dealt with existing type systems for the generic channels because it is not known how many times they will π-calculus [17]–[19]. run. So, unlimited channels that are always used for replicated Outline. In Section II we quickly review syntax and semantics inputs (i.e., replicated channels [21]), are polymorphic. This of the π-calculus and give formal definitions of deadlock and is a very convenient circumstance, because replicated channels lock freedom. The type systems are described in Section III are the primary mechanism for implementing recursion. and illustrated on several examples that highlight the fea- Indeed, going back to fact and stream, we see that they tures of our approach. Section IV contains a more detailed are replicated channels, that is they are polymorphic. This and technical comparison with related work and particularly means that the mismatches between the priorities h of y and with [17]–[19]. Section V concludes and hints at ongoing and k of a in (3) and (4) can be compensated by this form of future developments. Additional technical material, extended polymorphism and these processes can be declared well typed. examples, and proofs of the results can be found in the The interplay between recursion and polymorphism leads to appendix, which is not formally part of the submission. a technical problem, though. Recall that in (4) there are two occurrences of a, one in stream!hx + 1; ai having the same II.
Load more

Recommended publications
  • Deadlock: Why Does It Happen? CS 537 Andrea C
    UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department Deadlock: Why does it happen? CS 537 Andrea C. Arpaci-Dusseau Introduction to Operating Systems Remzi H. Arpaci-Dusseau Informal: Every entity is waiting for resource held by another entity; none release until it gets what it is Deadlock waiting for Questions answered in this lecture: What are the four necessary conditions for deadlock? How can deadlock be prevented? How can deadlock be avoided? How can deadlock be detected and recovered from? Deadlock Example Deadlock Example Two threads access two shared variables, A and B int A, B; Variable A is protected by lock x, variable B by lock y lock_t x, y; How to add lock and unlock statements? Thread 1 Thread 2 int A, B; lock(x); lock(y); A += 10; B += 10; lock(y); lock(x); Thread 1 Thread 2 B += 20; A += 20; A += 10; B += 10; A += B; A += B; B += 20; A += 20; unlock(y); unlock(x); A += B; A += B; A += 30; B += 30; A += 30; B += 30; unlock(x); unlock(y); What can go wrong?? 1 Representing Deadlock Conditions for Deadlock Two common ways of representing deadlock Mutual exclusion • Vertices: • Resource can not be shared – Threads (or processes) in system – Resources (anything of value, including locks and semaphores) • Requests are delayed until resource is released • Edges: Indicate thread is waiting for the other Hold-and-wait Wait-For Graph Resource-Allocation Graph • Thread holds one resource while waits for another No preemption “waiting for” wants y held by • Resources are released voluntarily after completion T1 T2 T1 T2 Circular
    [Show full text]
  • The Dining Philosophers Problem Cache Memory
    The Dining Philosophers Problem Cache Memory 254 The dining philosophers problem: definition It is an artificial problem widely used to illustrate the problems linked to resource sharing in concurrent programming. The problem is usually described as follows. • A given number of philosopher are seated at a round table. • Each of the philosophers shares his time between two activities: thinking and eating. • To think, a philosopher does not need any resources; to eat he needs two pieces of silverware. 255 • However, the table is set in a very peculiar way: between every pair of adjacent plates, there is only one fork. • A philosopher being clumsy, he needs two forks to eat: the one on his right and the one on his left. • It is thus impossible for a philosopher to eat at the same time as one of his neighbors: the forks are a shared resource for which the philosophers are competing. • The problem is to organize access to these shared resources in such a way that everything proceeds smoothly. 256 The dining philosophers problem: illustration f4 P4 f0 P3 f3 P0 P2 P1 f1 f2 257 The dining philosophers problem: a first solution • This first solution uses a semaphore to model each fork. • Taking a fork is then done by executing a operation wait on the semaphore, which suspends the process if the fork is not available. • Freeing a fork is naturally done with a signal operation. 258 /* Definitions and global initializations */ #define N = ? /* number of philosophers */ semaphore fork[N]; /* semaphores modeling the forks */ int j; for (j=0, j < N, j++) fork[j]=1; Each philosopher (0 to N-1) corresponds to a process executing the following procedure, where i is the number of the philosopher.
    [Show full text]
  • CSC 553 Operating Systems Multiple Processes
    CSC 553 Operating Systems Lecture 4 - Concurrency: Mutual Exclusion and Synchronization Multiple Processes • Operating System design is concerned with the management of processes and threads: • Multiprogramming • Multiprocessing • Distributed Processing Concurrency Arises in Three Different Contexts: • Multiple Applications – invented to allow processing time to be shared among active applications • Structured Applications – extension of modular design and structured programming • Operating System Structure – OS themselves implemented as a set of processes or threads Key Terms Related to Concurrency Principles of Concurrency • Interleaving and overlapping • can be viewed as examples of concurrent processing • both present the same problems • Uniprocessor – the relative speed of execution of processes cannot be predicted • depends on activities of other processes • the way the OS handles interrupts • scheduling policies of the OS Difficulties of Concurrency • Sharing of global resources • Difficult for the OS to manage the allocation of resources optimally • Difficult to locate programming errors as results are not deterministic and reproducible Race Condition • Occurs when multiple processes or threads read and write data items • The final result depends on the order of execution – the “loser” of the race is the process that updates last and will determine the final value of the variable Operating System Concerns • Design and management issues raised by the existence of concurrency: • The OS must: – be able to keep track of various processes
    [Show full text]
  • Supervision 1: Semaphores, Generalised Producer-Consumer, and Priorities
    Concurrent and Distributed Systems - 2015–2016 Supervision 1: Semaphores, generalised producer-consumer, and priorities Q0 Semaphores (a) Counting semaphores are initialised to a value — 0, 1, or some arbitrary n. For each case, list one situation in which that initialisation would make sense. (b) Write down two fragments of pseudo-code, to be run in two different threads, that experience deadlock as a result of poor use of mutual exclusion. (c) Deadlock is not limited to mutual exclusion; it can occur any time its preconditions (especially hold-and-wait, cyclic dependence) occur. Describe a situation in which two threads making use of semaphores for condition synchronisation (e.g., in producer-consumer) can deadlock. int buffer[N]; int in = 0, out = 0; spaces = new Semaphore(N); items = new Semaphore(0); guard = new Semaphore(1); // for mutual exclusion // producer threads while(true) { item = produce(); wait(spaces); wait(guard); buffer[in] = item; in = (in + 1) % N; signal(guard); signal(items); } // consumer threads while(true) { wait(items); wait(guard); item = buffer[out]; out =(out+1) % N; signal(guard); signal(spaces); consume(item); } Figure 1: Pseudo-code for a producer-consumer queue using semaphores. 1 (d) In Figure 1, items and spaces are used for condition synchronisation, and guard is used for mutual exclusion. Why will this implementation become unsafe in the presence of multiple consumer threads or multiple producer threads, if we remove guard? (e) Semaphores are introduced in part to improve efficiency under contention around critical sections by preferring blocking to spinning. Describe a situation in which this might not be the case; more generally, under what circumstances will semaphores hurt, rather than help, performance? (f) The implementation of semaphores themselves depends on two classes of operations: in- crement/decrement of an integer, and blocking/waking up threads.
    [Show full text]
  • Q1. Multiple Producers and Consumers
    CS39002: Operating Systems Lab. Assignment 5 Floating date: 29/2/2016 Due date: 14/3/2016 Q1. Multiple Producers and Consumers Problem Definition: You have to implement a system which ensures synchronisation in a producer-consumer scenario. You also have to demonstrate deadlock condition and provide solutions for avoiding deadlock. In this system a main process creates 5 producer processes and 5 consumer processes who share 2 resources (queues). The producer's job is to generate a piece of data, put it into the queue and repeat. At the same time, the consumer process consumes the data i.e., removes it from the queue. In the implementation, you are asked to ensure synchronization and mutual exclusion. For instance, the producer should be stopped if the buffer is full and that the consumer should be blocked if the buffer is empty. You also have to enforce mutual exclusion while the processes are trying to acquire the resources. Manager (manager.c): It is the main process that creates the producers and consumer processes (5 each). After that it periodically checks whether the system is in deadlock. Deadlock refers to a specific condition when two or more processes are each waiting for another to release a resource, or more than two processes are waiting for resources in a circular chain. Implementation : The manager process (manager.c) does the following : i. It creates a file matrix.txt which holds a matrix with 2 rows (number of resources) and 10 columns (ID of producer and consumer processes). Each entry (i, j) of that matrix can have three values: ● 0 => process i has not requested for queue j or released queue j ● 1 => process i requested for queue j ● 2 => process i acquired lock of queue j.
    [Show full text]
  • Deadlock-Free Oblivious Routing for Arbitrary Topologies
    Deadlock-Free Oblivious Routing for Arbitrary Topologies Jens Domke Torsten Hoefler Wolfgang E. Nagel Center for Information Services and Blue Waters Directorate Center for Information Services and High Performance Computing National Center for Supercomputing Applications High Performance Computing Technische Universitat¨ Dresden University of Illinois at Urbana-Champaign Technische Universitat¨ Dresden Dresden, Germany Urbana, IL 61801, USA Dresden, Germany [email protected] [email protected] [email protected] Abstract—Efficient deadlock-free routing strategies are cru- network performance without inclusion of the routing al- cial to the performance of large-scale computing systems. There gorithm or the application communication pattern. In reg- are many methods but it remains a challenge to achieve lowest ular operation these values can hardly be achieved due latency and highest bandwidth for irregular or unstructured high-performance networks. We investigate a novel routing to network congestion. The largest gap between real and strategy based on the single-source-shortest-path routing al- idealized performance is often in bisection bandwidth which gorithm and extend it to use virtual channels to guarantee by its definition only considers the topology. The effective deadlock-freedom. We show that this algorithm achieves min- bisection bandwidth [2] is the average bandwidth for routing imal latency and high bandwidth with only a low number messages between random perfect matchings of endpoints of virtual channels and can be implemented in practice. We demonstrate that the problem of finding the minimal number (also known as permutation routing) through the network of virtual channels needed to route a general network deadlock- and thus considers the routing algorithm.
    [Show full text]
  • Scalable Deadlock Detection for Concurrent Programs
    Sherlock: Scalable Deadlock Detection for Concurrent Programs Mahdi Eslamimehr Jens Palsberg UCLA, University of California, Los Angeles, USA {mahdi,palsberg}@cs.ucla.edu ABSTRACT One possible schedule of the program lets the first thread We present a new technique to find real deadlocks in con- acquire the lock of A and lets the other thread acquire the current programs that use locks. For 4.5 million lines of lock of B. Now the program is deadlocked: the first thread Java, our technique found almost twice as many real dead- waits for the lock of B, while the second thread waits for locks as four previous techniques combined. Among those, the lock of A. 33 deadlocks happened after more than one million com- Usually a deadlock is a bug and programmers should avoid putation steps, including 27 new deadlocks. We first use a deadlocks. However, programmers may make mistakes so we known technique to find 1275 deadlock candidates and then have a bug-finding problem: provide tool support to find as we determine that 146 of them are real deadlocks. Our tech- many deadlocks as possible in a given program. nique combines previous work on concolic execution with a Researchers have developed many techniques to help find new constraint-based approach that iteratively drives an ex- deadlocks. Some require program annotations that typically ecution towards a deadlock candidate. must be supplied by a programmer; examples include [18, 47, 6, 54, 66, 60, 42, 23, 35]. Other techniques work with unannotated programs and thus they are easier to use. In Categories and Subject Descriptors this paper we focus on techniques that work with unanno- D.2.5 Software Engineering [Testing and Debugging] tated Java programs.
    [Show full text]
  • Routing on the Channel Dependency Graph
    TECHNISCHE UNIVERSITÄT DRESDEN FAKULTÄT INFORMATIK INSTITUT FÜR TECHNISCHE INFORMATIK PROFESSUR FÜR RECHNERARCHITEKTUR Routing on the Channel Dependency Graph: A New Approach to Deadlock-Free, Destination-Based, High-Performance Routing for Lossless Interconnection Networks Dissertation zur Erlangung des akademischen Grades Doktor rerum naturalium (Dr. rer. nat.) vorgelegt von Name: Domke Vorname: Jens geboren am: 12.09.1984 in: Bad Muskau Tag der Einreichung: 30.03.2017 Tag der Verteidigung: 16.06.2017 Gutachter: Prof. Dr. rer. nat. Wolfgang E. Nagel, TU Dresden, Germany Professor Tor Skeie, PhD, University of Oslo, Norway Multicast loops are bad since the same multicast packet will go around and around, inevitably creating a black hole that will destroy the Earth in a fiery conflagration. — OpenSM Source Code iii Abstract In the pursuit for ever-increasing compute power, and with Moore’s law slowly coming to an end, high- performance computing started to scale-out to larger systems. Alongside the increasing system size, the interconnection network is growing to accommodate and connect tens of thousands of compute nodes. These networks have a large influence on total cost, application performance, energy consumption, and overall system efficiency of the supercomputer. Unfortunately, state-of-the-art routing algorithms, which define the packet paths through the network, do not utilize this important resource efficiently. Topology- aware routing algorithms become increasingly inapplicable, due to irregular topologies, which either are irregular by design, or most often a result of hardware failures. Exchanging faulty network components potentially requires whole system downtime further increasing the cost of the failure. This management approach becomes more and more impractical due to the scale of today’s networks and the accompanying steady decrease of the mean time between failures.
    [Show full text]
  • The Deadlock Problem
    The deadlock problem n A set of blocked processes each holding a resource and waiting to acquire a resource held by another process. n Example n locks A and B Deadlocks P0 P1 lock (A); lock (B) lock (B); lock (A) Arvind Krishnamurthy Spring 2004 n Example n System has 2 tape drives. n P1 and P2 each hold one tape drive and each needs another one. n Deadlock implies starvation (opposite not true) The dining philosophers problem Deadlock Conditions n Five philosophers around a table --- thinking or eating n Five plates of food + five forks (placed between each n Deadlock can arise if four conditions hold simultaneously: plate) n Each philosopher needs two forks to eat n Mutual exclusion: limited access to limited resources n Hold and wait void philosopher (int i) { while (TRUE) { n No preemption: a resource can be released only voluntarily think(); take_fork (i); n Circular wait take_fork ((i+1) % 5); eat(); put_fork (i); put_fork ((i+1) % 5); } } Resource-allocation graph Resource-Allocation & Waits-For Graphs A set of vertices V and a set of edges E. n V is partitioned into two types: n P = {P1, P2, …, Pn }, the set consisting of all the processes in the system. n R = {R1, R2, …, Rm }, the set consisting of all resource types in the system (CPU cycles, memory space, I/O devices) n Each resource type Ri has Wi instances. n request edge – directed edge P1 ® Rj Resource-Allocation Graph Corresponding wait-for graph n assignment edge – directed edge Rj ® Pi 1 Deadlocks with multiple resources Another example n P1 is waiting for P2 or P3, P3 is waiting for P1 or P4 P1 is waiting for P2, P2 is waiting for P3, P3 is waiting for P1 or P2 n Is there a deadlock situation here? Is this a deadlock scenario? Announcements Methods for handling deadlocks th n Midterm exam on Feb.
    [Show full text]
  • Deadlock Problem Mutex T M1, M2;
    The deadlock problem mutex_t m1, m2; void p1 (void *ignored) { lock (m1); lock (m2); /* critical section */ unlock (m2); unlock (m1); } void p2 (void *ignored) { lock (m2); lock (m1); /* critical section */ unlock (m1); unlock (m2); } • This program can cease to make progress – how? • Can you have deadlock w/o mutexes? 1/15 More deadlocks • Same problem with condition variables - Suppose resource 1 managed by c1, resource 2 by c2 - A has 1, waits on c2, B has 2, waits on c1 • Or have combined mutex/condition variable deadlock: - lock (a); lock (b); while (!ready) wait (b, c); unlock (b); unlock (a); - lock (a); lock (b); ready = true; signal (c); unlock (b); unlock (a); • One lesson: Dangerous to hold locks when crossing abstraction barriers! - I.e., lock (a) then call function that uses condition variable 2/15 Deadlocks w/o computers • Real issue is resources & how required • E.g., bridge only allows traffic in one direction - Each section of a bridge can be viewed as a resource. - If a deadlock occurs, it can be resolved if one car backs up (preempt resources and rollback). - Several cars may have to be backed up if a deadlock occurs. - Starvation is possible. 3/15 Deadlock conditions 1. Limited access (mutual exclusion): - Resource can only be shared with finite users. 2. No preemption: - once resource granted, cannot be taken away. 3. Multiple independent requests (hold and wait): - don’t ask all at once (wait for next resource while holding current one) 4. Circularity in graph of requests • All of 1–4 necessary for deadlock to occur • Two approaches to dealing with deadlock: - pro-active: prevention - reactive: detection + corrective action 4/15 Prevent by eliminating one condition 1.
    [Show full text]
  • Deadlock Immunity: Enabling Systems to Defend Against Deadlocks
    Deadlock Immunity: Enabling Systems To Defend Against Deadlocks Horatiu Jula, Daniel Tralamazza, Cristian Zamfir, George Candea Dependable Systems Laboratory EPFL Switzerland Abstract new executions that were not covered by prior testing. Deadlock immunity is a property by which programs, Furthermore, modern systems accommodate extensions once afflicted by a given deadlock, develop resistance written by third parties, which can introduce new dead- against future occurrences of that and similar deadlocks. locks into the target systems (e.g., Web browser plugins, We describe a technique that enables programs to auto- enterprise Java beans). matically gain such immunity without assistance from Debugging deadlocks is hard—merely seeing a dead- programmers or users. We implemented the technique lock happen does not mean the bug is easy to fix. for both Java and POSIX threads and evaluated it with Deadlocks often require complex sequences of low- several real systems, including MySQL, JBoss, SQLite, probability events to manifest (e.g., timing or workload Apache ActiveMQ, Limewire, and Java JDK. The results dependencies, presence or absence of debug code, com- demonstrate effectiveness against real deadlock bugs, piler optimization options), making them hard to repro- while incurring modest performance overhead and scal- duce and diagnose. Sometimes deadlocks are too costly ing to 1024 threads. We therefore conclude that deadlock to fix, as they entail drastic redesign. Patches are error- immunity offers programmers and users an attractive tool prone: many concurrency bug fixes either introduce new for coping with elusive deadlocks. bugs or, instead of fixing the underlying bug, merely de- crease the probability of occurrence [16]. 1 Introduction We expect the deadlock challenge to persist and likely Writing concurrent software is one of the most challeng- become worse over time: On the one hand, software ing endeavors faced by software engineers, because it re- systems continue getting larger and more complex.
    [Show full text]
  • Edsger Wybe Dijkstra
    In Memoriam Edsger Wybe Dijkstra (1930–2002) Contents 0 Early Years 2 1 Mathematical Center, Amsterdam 3 2 Eindhoven University of Technology 6 3 Burroughs Corporation 8 4 Austin and The University of Texas 9 5 Awards and Honors 12 6 Written Works 13 7 Prophet and Sage 14 8 Some Memorable Quotations 16 Edsger Wybe Dijkstra, Professor Emeritus in the Computer Sciences Department at the University of Texas at Austin, died of cancer on 6 August 2002 at his home in Nuenen, the Netherlands. Dijkstra was a towering figure whose scientific contributions permeate major domains of computer science. He was a thinker, scholar, and teacher in renaissance style: working alone or in a close-knit group on problems of long-term importance, writing down his thoughts with exquisite precision, educating students to appreciate the nature of scientific research, and publicly chastising powerful individuals and institutions when he felt scientific integrity was being compromised for economic or political ends. In the words of Professor Sir Tony Hoare, FRS, delivered by him at Dijkstra’s funeral: Edsger is widely recognized as a man who has thought deeply about many deep questions; and among the deepest questions is that of traditional moral philosophy: How is it that a person should live their life? Edsger found his answer to this question early in his life: He decided he would live as an academic scientist, conducting research into a new branch of science, the science of computing. He would lay the foundations that would establish computing as a rigorous scientific discipline; and in his research and in his teaching and in his writing, he would pursue perfection to the exclusion of all other concerns.
    [Show full text]