We have pressented here, for the Control Unit (CU) of Benes Interconnection Network (IN), a new fast parallel computational model named as; Cyclic Cube Engine (CCE), which depends on the Cyclic Cube topology, where the total number of processing elements is φ such that φN(11/h), h is an arbitrary integer, such that 2hlog N. N is number of the data items consisting the permutation. We have presented on this model parallel algorithm for parallel settings of Benes IN in order to realize arbitrary permutation with a setting time of O(h log2 N); (assuming N is base 2) using φN(11/h) processors (i.e., φN). This bound could be achieved by accelerating the parallel setting algorithm by function call of another very fast algorithm named as the accelerator. We have also, proven in the appendix of this paper, that our construction is within the lower bound of setting Benes IN for arbitrary permutation for general nonshared model when φN. Using these algorithms we have constracted a fast parallel setting algorithm to set the switches of Benes IN for arbitrary permutation in parallel time of O(h log2 N) where is hlog2 N. The parallel setting algorithm has been constructed depending on the CCE as the main computational structure suitable for setting Benes IN in parallel.

The system performance is greatly affected by the interprocessor communication, which should be enough to support the various types of permutations functions for the mapping purposes. But if there are many types of manipulations, it becomes necessary to have a rearrengeable IN like the Benes Interconnection Network (IN) so that we can increase the number of stages to 2n-1, where N=2n, and N is the number of input terminals which is base 2. But the control algorithm for this kind of IN is very complex. In this paper we have studied the mapping capabilities of Benes IN to be used into super system and we give a control algorithms for setting this network for groups of manipulation functions proved to be efficiently useful for parallel computation. We have also, shown how to enhance these control algorithm to be used by the system programmers with examples. Also, we have given cases studies for kinds of applications to be applicable in such system, so that to realize the effectiveness of such mechanism.

This paper gives another consideration for Benes rearrangeable IN to be constructed from cascading two blocking Interconnection Networks (IN), in an attempt to make such type of IN more practical for parallel systems. The reverse binary n-Cube, and binary n-Cube multi-stages INs, have been used to construct rearrangeable Benes IN. The control algorithm has two construction phases. The first phase is to confirm and transform any arbitrary permutation into the conflict free form (to control the reverse binary n-Cube IN). The second phase uses the mechanism of Bit-Tag control to map such conflict free permutations and control the second half of Benes IN, (i.e., the Cube). The second phase receives its input from the first phase output, after being transformed into a conflict free permutation. Such construction increases the flexibility in the design of Rearrangeable Multi-stage IN.

This paper describes the design of the reflective concurrent object-oriented specification language RMondel. RMondel is designed for the specification and modeling of distributed systems. It allows the development of executable specifications which may be modified dynamically. Reflection in RMondel is supported by two fundamental features that are: Structural Reflection (SR) and Behavioral Reflection (BR). Reflection is the capability to monitor and modify dynamically the structure and the behavior of the system. We show how the features of the language are enhanced using specific meta-operations and meta-objects, to allow for the dynamic modification of types (classes) and instances using the same language. RMondel specification can be modified by adding or modifying types and instances to get a new adapted specification. Consistency is checked dynamically at the type level as well as at the specification level. At the type level, structural and behavioral constrations are defined to preserve the conformance of types. At the specification level, a transaction mechanism and a locking protocol are defined to ensure the consistency of the whole specification.