Languages such as High Performance Fortran are used to implement parallel algorithms by distributing large data structures across a multicomputer system. To hide communication behind computation, we introduce an optimization scheme, message strip-mining. By using this scheme, the communication overhead is almost completely overlapped with the subsequent computation. We have implemented the prop...

We propose a hybrid architecture for the simulation of plants. Its core is a Petri Net executor based on a new class of Petri Nets called Extended Simple Colored Petri Nets. The executor is supervised by an expert system. Our architecture is very well-suited for the software-engineering development of plant simulators, as development times and errors can be dramatically reduced. The validity of...

In this paper a modelling methodology for business systems simulation is introduced. The methodology is based on the business transaction concept in conjunction with Petri nets notations. Next to these two components, the Arena simulation package is discussed to build an animated simulation model. Since the simulation model will be demonstrated using the software, it is not included into this p...

| This paper deals with the problem of planning and controlling the motion of a car like mobile moving in a dynamic and roadway like environment. The contribution presented here is a motion controller which executes in a reactive way a given nominal motion plan. Such a plan is made up of a smooth trajectory C and of time constraints of the type \reach location l at time t l ". Data concerning t...

Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime example is a loop accessing an array where the array indices are themselves functions of another array determined only at run-time. To parallelize such loops, it is necessary to perform a run-time analysis. We describe a ne...

Many scientific applications involve array operations that are sparse in nature, ie array elements depend on the values of relatively few elements of the same or another array. When parallelised in the shared-memory model, there are often inter-thread dependencies which require that the individual array updates are protected in some way. Possible strategies include protecting all the updates, o...