Relevant bibliographies by topics / Asynchronous Executions

Contents

  1. Journal articles

Academic literature on the topic 'Asynchronous Executions'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Asynchronous Executions.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Asynchronous Executions"

1

HADDIX, F. FURMAN. "AN ORDER DEGREE ALTERNATOR FOR ARBITRARY TOPOLOGIES." Parallel Processing Letters 18, no. 02 (2008): 307–22. http://dx.doi.org/10.1142/s0129626408003405.

Full text
Abstract:
An alternator is an arbitrary set of interacting processes that satisfies three conditions. First, if a process executes its critical section, then no neighbor of that process can execute its critical section at the same state. Second, along any infinite sequence of system states, each process will execute its critical section, an infinite number of times. Third, along any maximally concurrent computation, the alternator will stabilize to a sequence of states in which the processes will execute their critical sections in alternation. A principal reason for interest in alternators is their ability to transform systems correct under serial execution semantics to systems that are correct under concurrent execution semantics. An earlier alternator for arbitrary topology required 2q states where q is the dependency graph circumference and after stabilization would wait 2q steps between critical section executions. In a synchronous environment, this alternator requires only 2d+1 states where d is the degree of the graph of process dependencies for the system and after stabilization will require a wait of 2d+1 steps between critical section executions. In an asynchronous environment, the synchronization properties of this alternator must be supplemented with an asynchronous unison algorithm. The asynchronous unison algorithm requires expansion of the required number of states to dt, where t is the longest chordless cycle in the dependency graph; however, the required wait between critical section executions remains O(d).
APA, Harvard, Vancouver, ISO, and other styles
2

ANCEAUME, Emmanuelle. "EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST." International Journal of Foundations of Computer Science 13, no. 05 (2002): 695–717. http://dx.doi.org/10.1142/s0129054102001400.

Full text
Abstract:
Chandra and Toueg proposed in 1993 a new approach to overcome the impossibility of reaching deterministically Consensus — and by corollary Atomic Broadcast — in asynchronous systems subject to crash failures. They augment the asynchronous system with a possibly Unreliable Failure Detector which provides some information about the operational state of processes. In this paper, we present an extension of the Consensus problem that we call Uniform Prefix Agreement. This extension enables all the processes to propose a flow of messages during an execution — instead of one as in the Consensus problem — and uses all these proposed messages to compose the decision value. Prefix Agreement is based on an Unreliable Failure Detector. We use repeated executions of Prefix Agreement to build an efficient Uniform Atomic Broadcast algorithm. This paper describes the Uniform Prefix Agreement and Uniform Atomic Broadcast algorithms, and provides proofs of their correctness.
APA, Harvard, Vancouver, ISO, and other styles
3

Raghavan, Hari K., and Sathish S. Vadhiyar. "Efficient asynchronous executions of AMR computations and visualization on a GPU system." Journal of Parallel and Distributed Computing 73, no. 6 (2013): 866–75. http://dx.doi.org/10.1016/j.jpdc.2013.03.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kallas, Konstantinos, Haoran Zhang, Rajeev Alur, Sebastian Angel, and Vincent Liu. "Executing Microservice Applications on Serverless, Correctly." Proceedings of the ACM on Programming Languages 7, POPL (2023): 367–95. http://dx.doi.org/10.1145/3571206.

Full text
Abstract:
While serverless platforms substantially simplify the provisioning, configuration, and management of cloud applications, implementing correct services on top of these platforms can present significant challenges to programmers. For example, serverless infrastructures introduce a host of failure modes that are not present in traditional deployments. Individual serverless instances can fail while others continue to make progress, correct but slow instances can be killed by the cloud provider as part of resource management, and providers will often respond to such failures by re-executing requests. For functions with side-effects, these scenarios can create behaviors that are not observable in serverful deployments. In this paper, we propose mu2sls, a framework for implementing microservice applications on serverless using standard Python code with two extra primitives: transactions and asynchronous calls. Our framework orchestrates user-written services to address several challenges, such as failures and re-executions, and provides formal guarantees that the generated serverless implementations are correct. To that end, we present a novel service specification abstraction and formalization of serverless implementations that facilitate reasoning about the correctness of a given application’s serverless implementation. This formalization forms the basis of the mu2sls prototype, which we then use to develop a few real-world microservice applications and show that the performance of the generated serverless implementations achieves significant scalability (3-5× the throughput of a sequential implementation) while providing correctness guarantees in the context of faults, re-execution, and concurrency.
APA, Harvard, Vancouver, ISO, and other styles
5

Kashyap, Amlesh, Sathish S. Vadhiyar, Ravi S. Nanjundiah, and P. N. Vinayachandran. "Asynchronous and synchronous models of executions on Intel® Xeon Phi™ coprocessor systems for high performance of long wave radiation calculations in atmosphere models." Journal of Parallel and Distributed Computing 102 (April 2017): 199–212. http://dx.doi.org/10.1016/j.jpdc.2016.12.018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

MUSCALAGIU, IONEL, JOSE M. VIDAL, VLADIMIR CRETU, HORIA EMIL POPA, and MANUELA PANOIU. "EXPERIMENTAL ANALYSIS OF THE EFFECTS OF AGENT SYNCHRONIZATION IN ASYNCHRONOUS SEARCH ALGORITHMS." International Journal of Software Engineering and Knowledge Engineering 18, no. 05 (2008): 619–36. http://dx.doi.org/10.1142/s0218194008003799.

Full text
Abstract:
The asynchronous searching techniques are characterized by the fact that each agent instantiates its variables in a concurrent way. Then, it sends the values of its variables to other agents directly connected to it by using messages. These asynchronous techniques have different behaviors in the case of delays in sending messages. This article presents the opportunity for synchronizing the execution of agents in the case of asynchronous techniques. It investigates and compares the behaviors of several asynchronous techniques in two cases: agents process the received messages asynchronously (the real situation) and the synchronous case, when a synchronization of the execution of agents is done, i.e. the agents perform a computing cycle in which they process a message from a message queue. After that, the synchronization is done by waiting for the other agents to finalize the processing of their messages. The experiments show that the synchronization of the agents execution leads to lower costs in searching for solutions. A solution for synchronizing the agents execution is suggested for the analyzed asynchronous techniques.
APA, Harvard, Vancouver, ISO, and other styles
7

Krämer, Bernd J., and Thomas Koch. "Distributed Systems Management Software-in-the-Loop." International Journal of Software Engineering and Knowledge Engineering 08, no. 01 (1998): 55–76. http://dx.doi.org/10.1142/s0218194098000066.

Full text
Abstract:
IT experts expect open distributed processing to become the predominant computing infrastructure in the late nineties. All computer supported work places of large enterprises and organizations will then be networked and will be integrated into cross-regional and cross-sector business and information processes. The size and complexity of such applications, the local autonomy, distribution and heterogeneity of participating subsystems, and their asynchronous interaction, however, require new architectures, strategies, and tools for their technical management. In previous work we placed a production rule interpreter into the monitoring, decision, control action loop to provide flexible, operational semantics of well-understood management policies. In this article we extend this work in two directions. First we map the structure and dynamic behavior of policies into a graph representation. This semantic representation enables a systematic prediction of the effects of policy executions and allows for a better impact analysis in case of policy changes. Then we introduce a declarative event definition mechanism. It supports a causal and temporal correlation of individual events and serves to instantiate and adapt a predefined generic event handler to the specific needs of the actual management application. Such event handlers join in the interaction between monitoring agents and policy interpreter. By event correlation they may reduce the number of events triggering management actions significantly and help to filter secondary events.
APA, Harvard, Vancouver, ISO, and other styles
8

Gilbert, Martin S., and Ramalingam Sridhar. "AMEC — Asynchronous microprogram execution controller." Microprocessing and Microprogramming 36, no. 1 (1992): 9–25. http://dx.doi.org/10.1016/0165-6074(92)90003-p.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Malloy, B. A., E. L. Lloyd, and M. L. Soffa. "Scheduling DAG's for asynchronous multiprocessor execution." IEEE Transactions on Parallel and Distributed Systems 5, no. 5 (1994): 498–508. http://dx.doi.org/10.1109/71.282560.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Okumura, Keisuke, Yasumasa Tamura, and Xavier Défago. "Time-Independent Planning for Multiple Moving Agents." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 13 (2021): 11299–307. http://dx.doi.org/10.1609/aaai.v35i13.17347.

Full text
Abstract:
Typical Multi-agent Path Finding (MAPF) solvers assume that agents move synchronously, thus neglecting the reality gap in timing assumptions, e.g., delays caused by an imperfect execution of asynchronous moves. So far, two policies enforce a robust execution of MAPF plans taken as input: either by forcing agents to synchronize or by executing plans while preserving temporal dependencies. This paper proposes an alternative approach, called time-independent planning, which is both online and distributed. We represent reality as a transition system that changes configurations according to atomic actions of agents, and use it to generate a time-independent schedule. Empirical results in a simulated environment with stochastic delays of agents' moves support the validity of our proposal.
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Asynchronous Executions' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography