Готові списки джерел за темами / Asynchronous Executions

Добірка наукової літератури з теми "Asynchronous Executions"

Автор: Grafiati

Опубліковано: 6 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Asynchronous Executions".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Asynchronous Executions"

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

Повний текст джерела

Анотація:

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 та ін.

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

Повний текст джерела

Анотація:

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 та ін.

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 (June 2013): 866–75. http://dx.doi.org/10.1016/j.jpdc.2013.03.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (January 9, 2023): 367–95. http://dx.doi.org/10.1145/3571206.

Повний текст джерела

Анотація:

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 та ін.

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (August 2008): 619–36. http://dx.doi.org/10.1142/s0218194008003799.

Повний текст джерела

Анотація:

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 та ін.

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 (March 1998): 55–76. http://dx.doi.org/10.1142/s0218194098000066.

Повний текст джерела

Анотація:

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 та ін.

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

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (May 1994): 498–508. http://dx.doi.org/10.1109/71.282560.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

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 (May 18, 2021): 11299–307. http://dx.doi.org/10.1609/aaai.v35i13.17347.

Повний текст джерела

Анотація:

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 та ін.

Більше джерел

Дисертації з теми "Asynchronous Executions"

PARIS, JEAN-PIERRE. "Execution de taches asynchrones depuis esterel." Nice, 1992. http://www.theses.fr/1992NICE4602.

Повний текст джерела

Анотація:

De nombreux systemes informatiques sont consideres comme des systemes reactifs car ils maintiennent une interaction synchrone permanente avec leur environnement. Le langage parallele esterel est specialement concu pour programmer de tels systemes. L'hypothese de synchronisme parfait d'esterel s'enonce ainsi: les sorties d'un programme esterel sont delivrees en meme temps que les entrees, les reactions d'un programme se faisant idealement en temps nul. Cette hypothese est utilisee par le compilateur pour engendrer l'automate represente par la source esterel et doit etre validee a posteriori lors de l'implementation. Cependant cette validation pose probleme lorsque le programme doit realiser des calculs qui durent. Dans cette these, nous presentons une extension d'esterel qui permet de lancer des actions de duree non nulle: les taches asynchrones. La presentation s'appuie sur une semantique formelle d'esterel incluant une nouvelle primitive exec mais excluant variables et signaux values pour des raisons de simplicite de l'expose. Cette semantique est illustree par des exemples d'execution de programmes. Ensuite, nous presentons les modifications realisees dans le compilateur pour traiter cette nouvelle primitive. A cette occasion, nous decrivons les codes intermediaires de la chaine de compilation esterel-v3. Les modifications traitent le langage esterel complet: nous montrons ici comment resoudre les problemes d'atomicite entre retour des arguments des taches asynchrones et interruption de ces taches par des gardes temporelles. Finalement, nous decrivons le producteur de code developpe pour simplifier l'implementation d'un automate utilisant exec.

Стилі APA, Harvard, Vancouver, ISO та ін.

Byrnes, Denise Dianne. "Static scheduling of hard real-time control software using an asynchronous data-driven execution model /." The Ohio State University, 1992. http://rave.ohiolink.edu/etdc/view?acc_num=osu14877799148243.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shiu, Chih-Chiang, and 許志強. "The Design of Execution, Memory Access, and Writeback of Asynchronous Processor." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/04433818295986957899.

Повний текст джерела

Анотація:

碩士
國立交通大學
資訊工程系
90
Asynchronous processors have become a new aspect of modern computer architecture research in these years. An asynchronous processor is by no means synchronized by global clock. However, it employs communication protocols doing synchronization instead. Basically, in contrast with synchronous processors, asynchronous processors possess certain advantages while definitely encounter new challenges. Therefore, we were interested in asynchronous processor, and we desired to design it thus. We design an asynchronous processor based on the MIPS R2000 instruction set architecture. Specifically, in the co-study with another research-mate, we accomplish the design of an asynchronous processor named Asynchronous MIPS (AMIPS). Actually, the AMIPS is implemented by SystemC. The SystemC is a hardware description language like Verilog, which contains C++ object-oriented features in it. In this thesis we achieve part of AMIPS including execution unit, memory access unit, and write back unit, with other parts fulfilled by the research-mate. We introduce the concept and research of asynchronous architecture, our design of AMIPS, and how to implement it by using SystemC in the thesis. The two parts of design and implementation of the asynchronous processor are carried out separately, and then they are integrated. Finally, we check the AMIPS by each and almost every instruction, and also test it by several programs coded by us. All of the results of these checks and tests are matched the expected functionality.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tiwari, Manasi. "Communication Overlapping Krylov Subspace Methods for Distributed Memory Systems." Thesis, 2022. https://etd.iisc.ac.in/handle/2005/5990.

Повний текст джерела

Анотація:

Many high performance computing applications in computational fluid dynamics, electromagnetics etc. need to solve a linear system of equations $Ax=b$. For linear systems where $A$ is generally large and sparse, Krylov Subspace methods (KSMs) are used. In this thesis, we propose communication overlapping KSMs. We start with the Conjugate Gradient (CG) method, which is used when $A$ is sparse symmetric positive definite. Recent variants of CG include a Pipelined CG (PIPECG) method which overlaps the allreduce in CG with independent computations i.e., one Preconditioner (PC) and one Sparse Matrix Vector Product (SPMV). As we move towards the exascale era, the time for global synchronization and communication in allreduce increases with the large number of cores available in the exascale systems, and the allreduce time becomes the performance bottleneck which leads to poor scalability of CG. Therefore, it becomes necessary to reduce the number of allreduces in CG and adequately overlap the larger allreduce time with more independent computations than the independent computations provided by PIPECG. Towards this goal, we have developed PIPECG-OATI (PIPECG-One Allreduce per Two Iterations) which reduces the number of allreduces from three per iteration to one per two iterations and overlaps it with two PCs and two SPMVs. For better scalability with more overlapping, we also developed the Pipelined s-step CG method which reduces the number of allreduces to one per s iterations and overlaps it with s PCs and s SPMVs. We compared our methods with state-of-art CG variants on a variety of platforms and demonstrated that our method gives 2.15x - 3x speedup over the existing methods. We have also generalized our research with parallelization of CG on multi-node CPU systems in two dimensions. Firstly, we have developed communication overlapping variants of KSMs other than CG, including Conjugate Residual (CR), Minimum Residual (MINRES) and BiConjugate Gradient Stabilised (BiCGStab) methods for matrices with different properties. The pipelined variants give up to 1.9x, 2.5x and 2x speedup over the state-of-the-art MINRES, CR and BiCGStab methods respectively. Secondly, we developed communication overlapping CG variants for GPU accelerated nodes, where we proposed and implemented three hybrid CPU-GPU execution strategies for the PIPECG method. The first two strategies achieve task parallelism and the last method achieves data parallelism. Our experiments on GPUs showed that our methods give 1.45x - 3x average speedup over existing CPU and GPU-based implementations. The third method gives up to 6.8x speedup for problems that cannot be fit in GPU memory. We also implemented GPU related optimizations for the PIPECG-OATI method and show performance improvements over other GPU implementations of PCG and PIPECG on multiple nodes with multiple GPUs.

Стилі APA, Harvard, Vancouver, ISO та ін.

"Development and performance of distributed teams: Examining differences between asynchronous and synchronous communication in planning task execution." CAPELLA UNIVERSITY, 2010. http://pqdtopen.proquest.com/#viewpdf?dispub=3366091.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Asynchronous Executions"

Ouyang, Pei. Execution of regular DO loops on asynchronous multiprocessors. New York: Courant Institute of Mathematical Sciences, New York University, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rodeheffer, Thomas L. Compiling ordinary programs for execution on an asynchronous multiprocessor. Pittsburgh, Pa: Carnegie-Mellon University, Dept. of Computer Science, 1985.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Asynchronous Executions"

El-Zawawy, Mohamed A. "Finding Divergent Executions in Asynchronous Programs." In Computational Science and Its Applications – ICCSA 2016, 410–21. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42092-9_32.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Emmi, Michael, and Akash Lal. "Finding Non-terminating Executions in Distributed Asynchronous Programs." In Static Analysis, 439–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33125-1_29.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zielonka, Wiesław. "Safe executions of recognizable trace languages by asynchronous automata." In Logic at Botik '89, 278–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51237-3_22.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

El-Zawawy, Mohamed A. "Posting Graphs for Finding Non-Terminating Executions in Asynchronous Programs." In Computational Science and Its Applications – ICCSA 2017, 233–45. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62407-5_16.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Donaldson, Val, and Jeanne Ferrante. "Determining asynchronous pipeline execution times." In Languages and Compilers for Parallel Computing, 154–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0017251.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Weng, Tien-hsiung, and Barbara Chapman. "Asynchronous Execution of OpenMP Code." In Lecture Notes in Computer Science, 667–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44864-0_69.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cipolla, Davide, Fabrizio Cosso, Matteo Demartini, Marc Drewniok, Francesco Moggia, Paola Renditore, and Jürgen Sienel. "Web Service Based Asynchronous Service Execution Environment." In Service-Oriented Computing – ICSOC 2007, 304–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93851-4_30.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hsu, Tzu-Han, Borzoo Bonakdarpour, Bernd Finkbeiner, and César Sánchez. "Bounded Model Checking for Asynchronous Hyperproperties." In Tools and Algorithms for the Construction and Analysis of Systems, 29–46. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_2.

Повний текст джерела

Анотація:

AbstractMany types of attacks on confidentiality stem from the nondeterministic nature of the environment that computer programs operate in. We focus on verification of confidentiality in nondeterministic environments by reasoning about asynchronous hyperproperties. We generalize the temporal logic to allow nested trajectory quantification, where a trajectory determines how different execution traces may advance and stutter. We propose a bounded model checking algorithm for based on QBF-solving for a fragment of and evaluate it by various case studies on concurrent programs, scheduling attacks, compiler optimization, speculative execution, and cache timing attacks. We also rigorously analyze the complexity of model checking .

Стилі APA, Harvard, Vancouver, ISO та ін.

Haigh, Karen Zita, and Manuela M. Veloso. "Interleaving Planning and Robot Execution for Asynchronous User Requests." In Autonomous Agents, 79–95. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5735-7_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Sheng, and Takuo Watanabe. "Functional Reactive EDSL with Asynchronous Execution for Resource-Constrained Embedded Systems." In Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, 171–90. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26428-4_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Asynchronous Executions"

Souza, Diego, Ayla Dantas, and Ewerton Lopes. "Testing Asynchronous Information Systems with ThreadControl: a Case Study." In Simpósio Brasileiro de Sistemas de Informação. Sociedade Brasileira de Computação, 2013. http://dx.doi.org/10.5753/sbsi.2013.5687.

Повний текст джерела

Анотація:

This paper presents a case study regarding the use of the ThreadControl Testing Framework to test asynchronous information systems. This framework is intended to help test developers to avoid false positives in the execution of their automatic tests for asynchronous systems. Some of these false positives occur because the tests fail in some executions due to early or late verifications (assertions). In this paper, we have used ThreadControl in the automatic tests of a simple CRM information system that is asynchronous and discuss the main challenges and lessons learned from this use.

Стилі APA, Harvard, Vancouver, ISO та ін.

Fukuda, Hiroaki, and Paul Leger. "A library to modularly control asynchronous executions." In SAC 2015: Symposium on Applied Computing. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2695664.2696034.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kang, Yu, Yangfan Zhou, Hui Xu, and Michael R. Lyu. "DiagDroid: Android performance diagnosis via anatomizing asynchronous executions." In FSE'16: 24nd ACM SIGSOFT International Symposium on the Foundations of Software Engineering. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2950290.2950316.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fukuda, Hiroaki, Paul Leger, and Nicolás Cardozo. "Layer Activation Mechanism for Asynchronous Executions in JavaScript." In COP '22: International Workshop on Context-Oriented Programming and Advanced Modularity. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3570353.3570354.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

De Sa, Christopher, Kunle Olukotun, and Christopher Ré. "Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs Sampling." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/672.

Повний текст джерела

Анотація:

Gibbs sampling is a Markov chain Monte Carlo technique commonly used for estimating marginal distributions. To speed up Gibbs sampling, there has recently been interest in parallelizing it by executing asynchronously. While empirical results suggest that many models can be efficiently sampled asynchronously, traditional Markov chain analysis does not apply to the asynchronous case, and thus asynchronous Gibbs sampling is poorly understood. In this paper, we derive a better understanding of the two main challenges of asynchronous Gibbs: bias and mixing time. We show experimentally that our theoretical results match practical outcomes.

Стилі APA, Harvard, Vancouver, ISO та ін.

Folino, Gianluigi, Andrea Giordano, and Carlo Mastroianni. "Scalable asynchronous execution of cellular automata." In NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms”. Author(s), 2016. http://dx.doi.org/10.1063/1.4965363.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xu, Jia. "Pre-Run-Time Scheduling of Asynchronous and Periodic Processes With Offsets, Release Times, Deadlines, Precedence and Exclusion Relations." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87769.

Повний текст джерела

Анотація:

Utilizing non-zero offsets when scheduling real-time periodic processes significantly increases the chances of satisfying all the timing constraints in a real-time system. In this paper, a method that enables the utilization of non-zero offsets in the pre-run-time scheduling of asynchronous and periodic processes with release times, deadlines, precedence and exclusion relations on either a uniprocessor or on a multiprocessor in real-time embedded systems is presented. This paper also identifies for the first time, the set of general conditions that a periodic process newpi with release time rnewpi, computation time cnewpi, deadline dnewpi, period prdnewpi, permitted range of offset onewpi, must satisfy, in order to satisfy the timing constraints of any given asynchronous process ai with computation time cai, deadline dai, minimum time between two consecutive requests minai, and earliest time that asynchronous process ai can make a request for execution lai. A method based on these general conditions for converting asynchronous processes with earliest request times into new periodic processes with offset constraints is also introduced.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhou, Jiale, Andreas Johnsen, and Kristina Lundqvist. "Formal execution semantics for asynchronous constructs of AADL." In the 5th International Workshop. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2432631.2432639.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cairl, Brian. "Deterministic, asynchronous message driven task execution with ROS." In ROSCon2018. Mountain View, CA: Open Robotics, 2018. http://dx.doi.org/10.36288/roscon2018-900273.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cairl, Brian. "Deterministic, asynchronous message driven task execution with ROS." In ROSCon2018. Mountain View, CA: Open Robotics, 2018. http://dx.doi.org/10.36288/roscon2018-900817.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Asynchronous Executions"

Teranishi, Keita, Keita Teranishi, and Robert L. Clay. FY18 ASC CSSE L2 Milestone 6362: Local Failure Local Recovery (LFLR) Resiliency for Asynchronous Many Task (AMT) Programming and Execution Models: Executive Summary. Office of Scientific and Technical Information (OSTI), September 2018. http://dx.doi.org/10.2172/1493835.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Teranishi, Keita, Keita Teranishi, and Robert L. Clay. FY18 ASC P&EM L2 Milestone 6362: Local Failure Local Recovery (LFLR) Resiliency for Asynchronous Many Task (AMT) Programming and Execution Models: Executive Summary. Office of Scientific and Technical Information (OSTI), September 2018. http://dx.doi.org/10.2172/1475107.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!