Publication:4293112
From MaRDI portal
zbMath0803.68019MaRDI QIDQ4293112
Abraham Silberschatz, P. Galvín
Publication date: 24 May 1994
distributed systems; security; remote procedure calls; UNIX; concurrent programming; protection; storage management; operating systems; Mach; MS-DOS; process management; Windows; ISO/OSI reference model; network file system
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N25: Theory of operating systems
Related Items
Computational Complexity of Atomic Chemical Reaction Networks, Asynchronous group mutual exclusion, Lock-free deques and doubly linked lists, A parallel multi-unit resource deadlock detection algorithm with \(O(\log _2(\min (m, n)))\) overall run-time complexity, An FPT algorithm for edge subset feedback edge set, Transactional contention management as a Non-clairvoyant scheduling problem, Improved algorithms for feedback vertex set problems, Rate-monotonic scheduling for hard-real-time systems, Computing optimal assignments for residual network reliability, Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure, An efficient local search for the feedback vertex set problem, An improved FPT algorithm for almost forest deletion problem, Wait-free Byzantine consensus., An improved exact algorithm for undirected feedback vertex set, A probabilistic framework for cooperative multi-agent distributed interpretation and optimization of communication, Fixed parameterized algorithms for generalized feedback vertex set problems, An Improved Exact Algorithm for Undirected Feedback Vertex Set
