Futures are special kind of values that allow the synchronisation of different processes. Futures are in fact identifiers for promised results of function calls that are still awaited. When the result is necessary for the computation, the process is blocked until the result is returned. We are interested in this paper in transparent first-class futures, and their use within distributed componen...

A new method of motion deadlock resolving by using fuzzy decision in robot soccer games is proposed in this paper. For the reasons of complex competition tasks and limited intelligence, soccer robots fall into motion deadlocks in many conditions, which is very difficult for robots to decide whether it is needed to retreat for finding new opportunities. Based on the analysis of human decision fo...

Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of routing algorithms. More recently, deadlock recovery strategies have begun to gain acceptance. Progressive deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver deadlocked messages, instead of killing them. However, the di...

The paper describes the modernization of ash slurry drainage and handling from Units A1 A2 devices for receiving, extinguishing transporting bottom fly boiler grate to silos mass/volume process water sumps, with new technical solutions experiences in exploitation. main goal system TPP Kostolac A is improve operation reduce number deadlocks during operation.

Distributed locking is commonly adopted for performing concurrency control in distributed systems. It incorporates additional steps for handling deadlocks. This activity is carried out by methods based on wait-for-graphs or probes. The present study examines detection of conflicts based on enhanced local processing for distributed concurrency control. In the proposed “edge detection” approach, ...

The advent of multicore processors has made concurrent programming languages mandatory. However, most concurrent programming models come with two major pitfalls: non-determinism and deadlocks. By determinism, we mean the output behavior of the program is independent of the scheduling choices (e.g., the operating system) and depends only on the input behavior. A few concurrent programming models...

We demonstrate how the use of synchronization primitives and threading policies in distributed object middleware can lead to deadlocks. We identify that object middleware only has a few built-in synchronizationand threading primitives. We suggest to express them as stereotypes in UML models to allow designers to model synchronization and threading of distributed object systems at appropriate le...

Contemporary operating systems heavily rely on single system images with shared memory constructs that may not scale well to large core counts. We consider the challenge of distributed job allocation, where each job is comprised of a set of tasks to be mapped to disjoint cores. A naive solution performing fragmented allocations may quickly escalate to deadlocks, where jobs hold and wait for cor...

A variety of deadlock control policies based on Petri nets have been proposed for automated manufacturing systems (AMSs). Most of them prevent deadlocks by adding monitors for emptiable siphons that, without an appropriate control policy, can cause deadlocks, where the resources in a system under consideration are assumed to be reliable. When resources are unreliable, it is infeasible or imposs...

Multicast operation is an important operation in multicomputer communication systems and can be used to support several other collective communication operations. A signi cant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose a tree based multicasting algorithm for Multistage Interconnection Networks (MIN). We rst analyze...