On the public citation graph

On real-time and non real-time distributed computing

https://doi.org/10.1007/bfb0022137
0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-58468-4_181openalex-snapshot
Scheduling in critical real-time systems: a manifesto
inferredcites →https://doi.org/10.1007/bf00365406openalex-snapshot
On the competitiveness of on-line real-time task scheduling
inferredcites →https://doi.org/10.1007/bf01893145openalex-snapshot
Hard real-time communication in multiple-access networks
inferredcites →https://doi.org/10.1007/bf01940643openalex-snapshot
Competitive distributed decision-making
inferredcites →https://doi.org/10.1016/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1109/2.231276openalex-snapshot
A systematic approach to designing distributed real-time systems
inferredcites →https://doi.org/10.1109/etfa.1995.496774openalex-snapshot
A general approach to real-time message scheduling over distributed broadcast channels
inferredcites →https://doi.org/10.1109/real.1991.160364openalex-snapshot
On the competitiveness of on-line real-time task scheduling
inferredcites →https://doi.org/10.1109/real.1991.160366openalex-snapshot
On non-preemptive scheduling of period and sporadic tasks
inferredcites →https://doi.org/10.1109/sfcs.1994.365676openalex-snapshot
A theory of competitive analysis for distributed algorithms
inferredcites →https://doi.org/10.1145/112600.112627openalex-snapshot
Unreliable failure detectors for asynchronous systems (preliminary version)
inferredcites →https://doi.org/10.1145/129712.129718openalex-snapshot
New algorithms for an ancient scheduling problem
inferredcites →https://doi.org/10.1145/135419.135451openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/186025.186058openalex-snapshot
An old-fashioned recipe for real time
inferredcites →https://doi.org/10.1145/197917.197950openalex-snapshot
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/62546.62593openalex-snapshot
Impossibility and universality results for wait-free synchronization
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.21236/ada253611openalex-snapshot
The Weakest Failure Detector for Solving Consensus

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11408901_3openalex-snapshot
Failure Detection with Booting in Partially Synchronous Systems
inferred← citeshttps://doi.org/10.1007/11795490_26openalex-snapshot
Implementing Reliable Distributed Real-Time Systems with the Θ-Model
inferred← citeshttps://doi.org/10.1007/978-3-540-40981-6_18openalex-snapshot
Revisiting Liveness Properties in the Context of Secure Systems
inferred← citeshttps://doi.org/10.1109/ftdcs.1997.644722openalex-snapshot
Consensus: the big misunderstanding [distributed fault tolerant systems]
inferred← citeshttps://doi.org/10.1109/isorc.1998.666800openalex-snapshot
Asynchronous protocols to meet real-time constraints: is it really sensible? How to proceed?
inferred← citeshttps://doi.org/10.1109/isorc.2002.1003807openalex-snapshot
Wait-free objects for real-time systems?
inferred← citeshttps://doi.org/10.1109/reldis.2001.969730openalex-snapshot
Primary-backup replication: from a time-free protocol to a time-based implementation
inferred← citeshttps://doi.org/10.1109/tc.2002.1024740openalex-snapshot
Fast asynchronous uniform consensus in real-time distributed systems
inferred← citeshttps://doi.org/10.1109/words.2003.1218061openalex-snapshot
Asynchrony and real-time dependable computing
inferred← citeshttps://doi.org/10.1145/311531.311532openalex-snapshot
Fundamentals of fault-tolerant distributed computing in asynchronous environments
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.