No abstract

Complex operational environments require improved tactical mission command capabilities with a high level of interoperability among coalition control and command (C2) systems. This paper focuses on two areas of interest: decision support based on automated planning and Service Oriented Architecture (SOA) for rapid service development. Previous experiments were performed bilaterally by US, France and Germany to focus on collaborative mission planning using Web Services (WSs). The results reported herein were obtained from a unified experiment performed by US, France and Germany involving a common scenario. The operational benefit from the experimentation has been to improve mutual understanding among allied forces, to dynamically plan for assistance among ground support troops (logistics, MEDEVAC, and other areas) as well as to improve their coordination. The effort addressed system design, and integration within an experimental framework. It enabled the evolution of the CERDEC Mission Command Gateway (MCG) architecture as well as a constraint based planner ORTAC, developed by French DGA and Sagem. It takes into account near real-time multimodal Situation Awareness and readiness status from tactical edge units. The trilateral experiment, entitled From Data to Decision included Net-Centric manned and unmanned assets from all three nations (France Germany US) operating as a cohesive coalition force while preserving command and support relationships as required through their respective chains of command.

This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applications where c oarse or medium grain scheduling techniques can be u s e d, DSP applications integrate several thousand of tasks and hence n e cessitate ne grain considerations. Moreover nding an e ective mapping imperatively require t o t a k e i n t o a c count both architectural resources constraints and real time constraints. The main contribution of this paper is to show how it is possible to handle and to solve data partitioning, and ne-grain scheduling under the above operational constraints using Concurrent Constraints Logic Programming languages (CCLP). Our concurrent resolution technique undertaking linear and non linear constraints takes advantage of the special features of signal processing applications and provides a solution equivalent to a manual solution for the representative Panoramic Analysis (PA) application.Keywords: parallelizing compiler, scheduling, constraint logic programming 1: IntroductionThe post World War II era has resulted in the trend of using Digital Signal Processing (DSP) technologies for both military and civilian applications. The growing requirements for sophisticated algorithms, especially those used for 3-D applicative domains, lead to process in real time large multi-dimensional arrays of data. These applications are executed on parallel computers, that o er enough computing power 25].The mapping of DSP applications onto parallel machines raises new problems. The real time and target machine constraints are imperative. The solution must t the available hardware: the local memory, the number of processors, the processor communications. The application latency must meet the real time requirements. This necessitates ne-grain optimizations. Combining both kinds of constraints is still out of the scope of automation and requires deep human skills. This paper presents a new technique to map automatically DSP application, represented by a sequence of loop nests, onto a SPMD distributed memory machine. This technique is based on formalizations of the architectural, applicative and mapping models by constraints. The result is (1) a ne grain a ne schedule of computations, (2) their distribution onto processors and (3) a memory allocation. Computations are distributed in a block-cyclic 1 Ecole des Mines de Paris/CRI 77305

Future Network based Operations (NbO) will necessitate new approach to deal with assymetric context, urban area and tactical mobility. These operations will have to cope with multiple collaborative actions in a complex and changing environment. In NbO, collaborative actions stresses coordination and synchronisation requirements, both in terms of complexity and tempo. Consequently, NbO deeply impacts plan elaboration and task scheduling processes performed by the different units. This paper presents a constraint-based method for automating mission planning and scheduling services in the context of Network based Operations. The approach is experimented on realistic benchmarks and during the Phoenix'07 experiment. Results show that mission planning and scheduling tools can be used to develop, experiment and evaluate the NbO concept.

No abstract