scientific article; zbMATH DE number 944424
From MaRDI portal
Publication:4715388
zbMath0856.68041MaRDI QIDQ4715388
Publication date: 12 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01) Theory of operating systems (68N25)
Related Items
Formal design and verification of operational transformation algorithms for copies convergence, Nonclairvoyant scheduling, Local and global deadlock-detection in component-based systems are NP-hard, A simple empirical formula for categorizing computing operations, A pi-calculus based semantics for WS-BPEL, A new asymptotic notation: Weak Theta, Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting, Optimizing concurrency under Scheduling by Edge Reversal, Data-race and concurrent-write freedom are undecidable., Batch Coloring Flat Graphs and Thin, Reliability and cost optimization in distributed computing systems., Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems, Anytime classification for a pool of instances, Time-bounded termination analysis for probabilistic programs with delays, Comparison of multiagent inference methods in multiply sectioned Bayesian networks., Synchronous, asynchronous, and causally ordered communication, A FUZZY ALGORITHM FOR SCHEDULING SOFT PERIODIC TASKS IN PREEMPTIVE REAL-TIME SYSTEMS, A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm, SPREADING ACTIVATION OVER ONTOLOGY-BASED RESOURCES: FROM PERSONAL CONTEXT TO WEB SCALE REASONING, Performance prediction of \(N\)-body simulations on a hybrid architecture, Distribution of distinguishable objects to bins: generating all distributions, On paging with locality of reference, Generating all distributions of objects to bins, Fault-tree modelling of computer system security, Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems, Rate-monotonic scheduling for hard-real-time systems, Weighted sum coloring in batch scheduling of conflicting jobs, Investigating the usability of real-time scheduling theory with the Cheddar project, Design and implementation of an agent home scheme strategy for prefetch-based DSM systems, Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints, Stack-up algorithms for palletizing at delivery industry, Linear and quadratic algorithms for scheduling chains and opposite chains, Task swapping networks in distributed systems, PRIORITY-BASED TASK REASSIGNMENTS IN HIERARCHICAL 2D MESH-CONNECTED SYSTEMS USING TABLEAUX, Optimal task allocation and hardware redundancy policies in distributed computing systems
