This review paper discusses the Reo coordination language in the wider context of its research area. It explains the concept of coordination and argues its significance. Those concepts, models and languages that were of considerable importance in the preliminary research that lead up to the development of Reo, are explained, discussed and evaluated. In particular Linda, Manifold, and Reo itself...

We present an architecture for digit-serial multiplication in finite fields GF(2m) with applications to cryptography. The proposed design uses polynomial basis representation and interleaves multiplication steps with degree reduction steps. An M-bit multiplier works with arbitrary irreducible polynomials and can be used for any binary field of order 2m ≤ 2M . We introduce a new method for degre...

One of the most recent techniques for propagating resource constraints in Constraint Based scheduling is Energy Constraint. This technique focuses in precedence based scheduling, where precedence relations are taken into account rather than the absolute position of activities. Although, this particular technique proved to be efficient on discrete unary resources, it provides only loose bounds f...

This paper presents a new algorithm that obtains an approximation of the Critical Path in schedules generated using the disjunctive graph model that represents the Job Shop Scheduling Problem (JSSP). This algorithm selects a set of operations in the JSSP, where on the average ninety nine percent of the total operations that belong to the set are part of the critical path. A comparison is made o...

A graph G is called a P≥k-factor deleted if – e has for any e∈E(G). (P≥k,n)-factor critical every subset V′⊆V(G) with |V′|=n, the G−V′ deleted. Zhou, Bian and Pan [Discrete Appl. Math. (2021) in press] showed that an (n+2)-connected (P≥3,n)-factor its binding number bind(G)>n+32. In this paper, we give new condition graphs, which improves above result.

Many monitoring and diagnosis systems have been proposed based on causal tracing for end-to-end executions in distributed systems as more and more modern computer applications become distributed systems. These applications are based on metadata propagation along the request’s executions, which has been closely tied to the application logic, the metadata formats, and the developer APIs. Such kin...

We present a compile time list heuristic scheduling algorithm called Low Cost Critical Path algorithm (LCCP) for the distributed memory systems. LCCP has low scheduling cost for both homogeneous and heterogeneous systems. In some recent papers list heuristic scheduling algorithms keep their scheduling cost low by using a fixed size heap and a FIFO, where the heap always keeps fixed number of ta...

In this paper, a practical method is developed in an attempt to address the fundamental matters and limitations of existing methods for critical-path method ~CPM! based resource scheduling, which are identified by reviewing the prior research in resourceconstrained CPM scheduling and repetitive scheduling. The proposed method is called the resource-activity critical-path method ~RACPM!, in whic...