Andrea C. Arpaci-Dusseau Created 2026-10-13 Updated 2026-11-05
Andrea C. Arpaci-Dusseau coauthored Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others. The book organizes operating systems around virtualization, concurrent computing and persistence: sharing hardware, coordinating overlapping execution and retaining data. Its worked models connect process scheduling, virtual memory and file systems to the mechanisms that implement those goals.[ref]
Portrait of Andrea C. Arpaci-Dusseau
. External portrait hosted by University of Wisconsin–Madison. Source. Bernard Sufrin Created 2026-10-31 Updated 2026-11-05
Bernard Sufrin is a computer scientist whose work includes formal methods, programming language design and tools for mathematical reasoning about programs. His Oxford profile identifies computer support for refinement and proof among his research interests.[ref]
His Communicating Scala Objects by Bernard Sufrin describes a Scala library for concurrent computing through communicating components. Channels and process composition make communication structure explicit; closure and alternation then require specified semantics so that a component can respond coherently to several possible interactions.[ref]
Communicating Scala Objects by Bernard Sufrin. Library description, communication, closure and alternation
Homepage: www.cs.ox.ac.uk/people/bernard.sufrin/
Portrait of Bernard Sufrin
. Source. Concurrent computing Created 2026-10-31 Updated 2026-11-05
Concurrent computing organizes computations whose execution intervals can overlap. They may interleave on one processor or run simultaneously on several; concurrency therefore differs from hardware parallel computing. Two workers incrementing a shared counter by separate read-modify-write steps can lose an update if both read the same old value. Synchronization constrains such interactions, while message passing organizes communication through explicit exchanges. A correct concurrent program must account for permitted schedules, not merely the particular order seen during one successful run.
Database management system 2026-11-05
A database management system is software that defines, stores, queries and updates databases while managing access, integrity and concurrent use. Its components can include a query parser, optimizer, storage manager, transaction manager and recovery mechanism. A database is the managed collection; the database management system supplies the mechanisms and interfaces used to operate on it.
For example, evaluating
SELECT name FROM Person WHERE id = 7 requires interpreting the query, choosing an access path, retrieving visible records and returning the selected field. An index can speed the lookup without changing its logical result. Concurrent updates may require locks or versions, and a crash may require log replay. Merely writing records to a file does not supply those guarantees. PostgreSQL's tutorial illustrates the distinction between client applications, the server process managing database files and connections, and the databases accessed through that server.[ref]Concepts in the PostgreSQL documentation. §2.2, client/server architecture and database organization
Device-driver process 2026-11-05
A device-driver process executes device-management logic as an operating-system process, communicating with clients through an inter-process interface. A microkernel can grant that process access to selected device registers, memory regions and interrupt notifications while keeping unrelated application address spaces separate. The device driver supplies hardware-specific operations; the kernel need only mediate the permitted resources and communication.
For a sensor, a client sends a request, the driver starts a conversion, an interrupt announces completion and the driver returns the measured result to that client. Concurrent requests need identifiers and an ordering rule so that replies cannot be exchanged accidentally. A driver in a separate process can improve fault containment, but it still needs correct memory/DMA permissions and recovery behavior. The seL4 Microkit documents explicit protection domains, mapped memory regions, interrupt handling and communication channels as concrete mechanisms for such component boundaries.[ref]
Fred B. Schneider Created 2026-10-13 Updated 2026-11-05
Fred B. Schneider studies dependable concurrent computing and distributed systems, including fault tolerance and computer security.[ref]
https://www.cs.cornell.edu/fbs/. research statement
He coauthored Defining Liveness by Bowen Alpern and others, which distinguishes a safety property from a liveness property: finite behaviour can establish an irreparable safety violation, whereas every finite behaviour prefix can still be extended to satisfy the liveness requirement.[ref]Portrait of Fred B. Schneider
. Photograph from Cornell University's official researcher profile. Source. Leslie Lamport Created 2026-10-13 Updated 2026-11-05
Leslie Lamport developed mathematical ways to specify and reason about concurrent computing. His 1979 paper How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs by Leslie Lamport defines sequential consistency: the result must agree with some sequential ordering of all operations that preserves each individual CPU's program order. This gives a precise requirement for shared-memory behaviour without requiring all physical operations to occur one at a time.[ref]
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs by Leslie Lamport. definition and sufficient conditions
His first-person publication archive explains the development of this and related work.[ref]https://lamport.azurewebsites.net/pubs/pubs.html. 1979 paper commentary
Parallel computing 2026-11-05
Parallel computing performs multiple parts of a computation simultaneously, typically on several processors or execution units. It requires decomposing work and coordinating data dependencies, communication and synchronization. Concurrent computing also permits overlapping activities on a single processor, so concurrency alone does not imply simultaneous hardware execution.
If fraction of a fixed computation remains serial and the rest divides perfectly among processors, the idealized runtime is . Thus Amdahl's law gives speedupfor . With a 10 percent serial fraction and 10 processors, the ideal speedup is about 5.26, before communication overhead. The calculation assumes a fixed workload; changing the workload size changes the question. Load imbalance and limited memory bandwidth can further reduce the achieved gain.
Paul E. McKenney Created 2026-10-18 Updated 2026-11-05
Paul E. McKenney is a computer scientist known for work on concurrent computing and operating-system kernels. His contributions include read-copy-update, developed for systems in which reads are frequent and updates must coexist with them.[ref]
The key read-copy-update distinction is between removing an object from a shared data structure and reclaiming its storage. An earlier reader may still hold a reference after removal; reclamation waits until the relevant readers have finished. That separation permits lighter synchronization on the read path. It is an example of how the lifetime of a shared object becomes part of a concurrent algorithm.[ref]
What is RCU? in the Linux Kernel documentation. Section 1, RCU Overview
With David Howells, he also authored the kernel guide to circular buffers and their memory barriers.[ref]
Remzi H. Arpaci-Dusseau Created 2026-10-13 Updated 2026-11-05
Remzi H. Arpaci-Dusseau coauthored Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others. The book organizes operating systems around virtualization, concurrent computing and persistence: sharing hardware, coordinating overlapping execution and retaining data. Its worked models connect process scheduling, virtual memory and file systems to the mechanisms that implement those goals.[ref]
Portrait of Remzi H. Arpaci-Dusseau
. External portrait hosted by University of Wisconsin–Madison. Source. Transaction isolation 2026-11-05
Transaction isolation specifies which effects concurrent database transactions may observe and which interleavings are permitted to commit. Serializable isolation requires the combined result to be equivalent to some serial ordering, even when execution actually overlaps. Weaker levels admit particular anomalies; their names require implementation-specific interpretation.[ref]
For example, two doctors are on call. Each transaction reads that both are available and removes its own doctor, intending to leave someone on call. If each sees an old snapshot and they update different rows, both may commit under a snapshot-based level that does not prevent this write skew. No serial ordering would let both checks pass. PostgreSQL Serializable can reject such conflicting executions, so the application must be prepared to retry a whole transaction. Isolation protects a stated concurrency model; it does not repair a faulty business rule within one transaction.




