scientific article; zbMATH DE number 1033414
From MaRDI portal
Publication:4344125
zbMath0883.68037MaRDI QIDQ4344125
P. Galvín, Abraham Silberschatz
Publication date: 14 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (14)
Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Parameterized Complexity of Fair Feedback Vertex Set Problem ⋮ Fluid limits for shortest job first with aging ⋮ Decycling bipartite graphs ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ Multicoloring trees. ⋮ Appraising two decades of distributed computing theory research ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Real-time scheduling with resource sharing on heterogeneous multiprocessors ⋮ Waiting patterns for a printer ⋮ Exact localisations of feedback sets ⋮ Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs ⋮ Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions ⋮ Parameterized analysis of paging and list update algorithms
This page was built for publication:
