scientific article
From MaRDI portal
Publication:3992743
zbMath0758.68023MaRDI QIDQ3992743
No author found.
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
distributed systemsmemory managementvirtual machineconcurrent processesprotectionfile systemdeadlocksemaphoresoperating systemcpu scheduling
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Related Items
Deadlock avoidance with a modified banker's algorithm, Deadlock analysis in networks of communicating processes, A simulation tool for the performance evaluation of parallel branch and bound algorithms, Une approche quantitative de l'exclusion mutuelle, FUN: a dynamic method for scheduling problems, A temporal logic for real-time partial-ordering with named transactions, A temporal logic for real-time partial ordering with named transactions, Data structures and algorithms for tilings I, Automated analysis of mutual exclusion algorithms using CCS, High level synthesis of synchronous parallel controllers, MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS, Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN, Code aware resource management, ESFLIB: A library to compute the element-free Galerkin shape functions, Communicating processes, scheduling, and the complexity of nontermination, Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming, Probabilistic analysis of some distributed algorithms, The stack-size of tries: A combinatorial study, A contracting model for flexible distributed scheduling, Asymptotic analysis of an optimized quicksort algorithm., Efficient minimization of deterministic weak \(\omega\)-automata
