Compressed Sensing for Distributed Systems
https://doi.org/10.1007/978-981-287-390-3
Discover Books. Explore Knowledge.
Search and discover peer-reviewed scholarly literature, open-access articles, and research citations across DOAJ, PubMed Central, and OpenAlex.
https://doi.org/10.1007/978-981-287-390-3
https://doi.org/10.1007/978-3-319-14472-6
Software designed to function in a hard-real-time environment where strict timing constraints must be met often entails implicit assumptions about a programming language and the underlying system which supports it. Programs which are logica...
The work described in this thesis is the result of aresearch program started in 1981 to find better ways ofprogramming Telecom applications. These applications are largeprograms which despite careful testing will probably containmany errors...
Distributed systems, which consist of a collection of high performance systems interconnected via high performance networks (e.g. ATM), are becoming feasible platforms for execution of large-scale, complex problems. We address various issue...
https://doi.org/10.1109/hpdc.1998.710015
A checkpoint/rollback algorithm is presented for multiple processes in a distributed system that uses message passing for communication. Each process in the system can initiate the algorithm autonomously. If only one instance of the algorit...
https://doi.org/10.1109/icde.1988.105457
This paper describes a methodology that provides detailed predictive performance information throughout the software design and implementation cycles. It is structured around a hierarchy of performance models that describe the computing sys...
https://doi.org/10.1177/109434200001400306
OBJECTIVE: This article aims to explore the nature and resolution of breakdowns in coordinated decision making in distributed safety-critical systems. BACKGROUND: In safety-critical domains, people with different roles and responsibilities ...
https://doi.org/10.1177/0018720810372104
https://doi.org/10.1007/11556992_35
Three different load balancing algorithms for distributed systems that consist of a number of identical processors and a CSMA communication system are presented in this paper. Some of the properties of a multi-resource system and the balanc...
https://doi.org/10.1145/1010631.801689
Despite their wide deployment, distributed systems remain notoriously hard to reason about. Unexpected interleavings of concurrent operations and failures may lead to undefined behaviors and cause serious consequences. We present Morpheus, ...
https://doi.org/10.1145/3373376.3378484
Clients in a distributed system place their confidence in many servers, and servers themselves rely on other servers for file storage, authentication, authorization, and payment. When a system spans administrative boundaries it becomes hard...
https://doi.org/10.1145/191177.191215
Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, the approach suffers from high overhead associated with the che...
https://doi.org/10.1109/71.737697
https://doi.org/10.1007/b94014
Loosely-coupled distributed systems have significant scale and cost advantages over more traditional architectures, but the availability of the nodes in these systems varies widely. Availability modeling is crucial for predicting per-machin...
We present a parametric calculus for contract-based computing in distributed systems. By abstracting from the actual contract language, our calculus generalises both the contracts-as-processes and contracts-as-formulae paradigms. The calcul...
https://doi.org/10.4204/eptcs.59.11
https://doi.org/10.1007/978-3-540-24663-3_16
The definitions of the predicates Possibly φ and Definitely φ, where φ is a global predicate of a distributed computation, lead to the definitions of two predicate transformers P and D . We show that P plays the same role with respect to ti...
https://doi.org/10.1145/200994.201005
https://doi.org/10.1007/978-1-4471-2416-0