41 research outputs found
Implementing Multithreaded Protocols for Release Consistency on Top of the Generic DSM-PM2 Platform
10.1007/3-540-47840-X_18DSM-PM2 is an implementation platform designed to facilitate the experimental studies with consistency protocoles for distributed shared memory. This platform provides basic building blocks, allowing for an easy design, implementation and evaluation of a large variety of multithreaded consistency protocols within a unified framework. DSM-PM2 is portable over a large variety of cluster architectures, using various communication interfaces (TCP, MPI, BIP, SCI, VIA, etc.). This paper presents the design of two multithreaded protocols implementing the release consistency model. We evaluate the impact of these consistency protocols on the overall performance of a typical distributed application, for two clusters with different interconnection networks and communication interfaces
Extension de la plate-forme DSM-PM2 pour le support de protocoles de cohérence relùchée multithreads
International audienceDans leur prĂ©sentation traditionnelle, les bibliothĂšques de gestion de mĂ©moire distribuĂ©e virtuel- lement partagĂ©e (MVP, en anglais DSM) [8, 11, 12, 4] permettent Ă des processus de partager un espace d'adressage commun selon un modĂšle de cohĂ©rence fixĂ©. L'objectif du projet DSM-PM2 est de fournir au programmeur d'application distribuĂ©e multithread une plate-forme d'implĂ©men- tation oĂč il puisse dĂ©velopper et optimiser conjointement son application et le protocole de co- hĂ©rence MVP qui la supporte, de maniĂšre portable. DSM-PM2 est actuellement disponible sur des grappes de PC sous Linux, avec les rĂ©seaux Ethernet, Myrinet et SCI, et les interface de communication TCP, MPI, BIP, SISCI, VIA, etc. DSM-PM2 fournit les briques de base pour la construction d'une large classe de protocoles de cohĂ©rence utilisables dans un environnement d'exĂ©cution multithread : il gĂ©nĂ©ralise donc les fonctionnalitĂ©s de MVP comme DSM-Threads [9] et Millipede [5]. Ă partir de ces briques, 6 protocoles de cohĂ©rence sont dĂ©jĂ construits dans la version actuelle. L'utilisateur peut faci- lement les modifier ou en ajouter d'autres. Dans cet article, nous dĂ©crivons la mise en place sous DSM-PM2 des deux protocoles de cohĂ©rence relĂąchĂ©e multithreads et un aperçu de leurs performances
Developing an Effective and Efficient Real Time Strategy Agent for Use as a Computer Generated Force
Computer Generated Forces (CGF) are used to represent units or individuals in military training and constructive simulation. The use of CGF significantly reduces the time and money required for effective training. For CGF to be effective, they must behave as a human would in the same environment. Real Time Strategy (RTS) games place players in control of a large force whose goal is to defeat the opponent. The military setting of RTS games makes them an excellent platform for the development and testing of CGF. While there has been significant research in RTS agent development, most of the developed agents are only able to exhibit good tactical behavior, lacking the ability to develop and execute overall strategies. By analyzing prior games played by an opposing agent, an RTS agent can determine the opponent\u27s strengths and weaknesses and develop a strategy which neutralizes the strengths and capitalizes on the weaknesses. It can then execute this strategy in an RTS game. This research develops such an RTS agent called the Killer Bee Artificial Intelligence (KBAI). KBAI builds a classifier for an opposing RTS agent which allows it to predict game outcomes. It then takes this classifier, uses it to generate an effective counter-strategy, and executes the tactics required for the strategy. KBAI is both effective and efficient against four high-quality scripted agents: it wins 100% of the time, and it wins quickly. When compared to native artificial intelligence, KBAI has superior performance. It exhibits strategic behavior, as well as the tactics required to execute a developed strategy
Gestion des réseaux multi-grappes hétérogÚnes avec la bibliothÚque Madeleine III
This paper introduces the new version of the Madeleine portable multi-protocol communication library. Madeleine version III now includes full, flexible multi-cluster support associated to a redesigned version of the transparent multi-network message forwarding mechanism. Madeleine III works together with a new configuration management module to handle a wide panel of network-heterogeneous multi-cluster configurations. The integration of a new topology information system allows programmers of parallel computing applications to build highly optimized distributed algorithms on top of the transparent multi-network communication system provided by Madeleine III's virtual networks. The preliminary experiments we conducted regarding the new virtual network capabilities of Madeleine III showed interesting results with an asymptotic bandwidth of 43 MB/s over a virtual link made of a SISCI/SCI and a BIP/Myrinet physical link
Extension de la plate-forme DSM-PM2 pour le support de protocoles de cohérence relùchée multithreads
International audienceDans leur prĂ©sentation traditionnelle, les bibliothĂšques de gestion de mĂ©moire distribuĂ©e virtuel- lement partagĂ©e (MVP, en anglais DSM) [8, 11, 12, 4] permettent Ă des processus de partager un espace d'adressage commun selon un modĂšle de cohĂ©rence fixĂ©. L'objectif du projet DSM-PM2 est de fournir au programmeur d'application distribuĂ©e multithread une plate-forme d'implĂ©men- tation oĂč il puisse dĂ©velopper et optimiser conjointement son application et le protocole de co- hĂ©rence MVP qui la supporte, de maniĂšre portable. DSM-PM2 est actuellement disponible sur des grappes de PC sous Linux, avec les rĂ©seaux Ethernet, Myrinet et SCI, et les interface de communication TCP, MPI, BIP, SISCI, VIA, etc. DSM-PM2 fournit les briques de base pour la construction d'une large classe de protocoles de cohĂ©rence utilisables dans un environnement d'exĂ©cution multithread : il gĂ©nĂ©ralise donc les fonctionnalitĂ©s de MVP comme DSM-Threads [9] et Millipede [5]. Ă partir de ces briques, 6 protocoles de cohĂ©rence sont dĂ©jĂ construits dans la version actuelle. L'utilisateur peut faci- lement les modifier ou en ajouter d'autres. Dans cet article, nous dĂ©crivons la mise en place sous DSM-PM2 des deux protocoles de cohĂ©rence relĂąchĂ©e multithreads et un aperçu de leurs performances
Cooperating runtime systems in LiPS
Performing computation using networks of workstations is increasingly becoming an alternative to using a supercomputer. This approach is motivated by the vast quantities of unused idle-time available in workstation networks. Unlike comptuting o a tighty coupled parallel computer, where a fixed number of processor nodes is used within a computation, the number of usable nodes in a workstation network is constantly changing over time. Additionally, workstations are more frequently subject to outages, e.g. due to reboots. The question arises how applications, adapting smoothly to this environment, should be realized. LiPS is a system for distributed computing using idle-cycles in networks for workstations. This system is ints version 2.3 is currently used at the UniversitĂ€t des Saarlandes in SaarbrĂŒcken, Germany to perform computationally intensive applications in the field of cryptography on a net of approximately 250 workstations and should be enhanced to work within an environment of more than 1000 machines all over the world within the next years. In this paper we present the runtime systems of LiPS along with performance measurements taken with the current LiPS development version 2.4
Java on Networks of Workstations (JavaNOW): A Parallel Computing Framework Inspired by Linda and the Message Passing Interface (MPI)
Networks of workstations are a dominant force in the distributed computing arena, due primarily to the excellent price/performance ratio of such systems when compared to traditionally massively parallel architectures. It is therefore critical to develop programming languages and environments that can help harness the raw computational power available on these systems. In this article, we present JavaNOW (Java on Networks of Workstations), a Javaâbased framework for parallel programming on networks of workstations. It creates a virtual parallel machine similar to the MPI (Message Passing Interface) model, and provides distributed associative shared memory similar to the Linda memory model but with a richer set of primitive operations.
JavaNOW provides a simple yet powerful framework for performing computation on networks of workstations. In addition to the Linda memory model, it provides for shared objects, implicit multithreading, implicit synchronization, object dataflow, and collective communications similar to those defined in MPI. JavaNOW is also a component of the Computational Neighborhood, a Javaâenabled suite of services for desktop computational sharing. The intent of JavaNOW is to present an environment for parallel computing that is both expressive and reliable and ultimately can deliver good to excellent performance. As JavaNOW is a work in progress, this article emphasizes the expressive potential of the JavaNOW environment and presents preliminary performance results only
The Hyperion system: Compiling multithreaded Java bytecode for distributed execution
A preliminary version of this work has been presented as a Distinguished Paper at the Euro-Par 2000 Conference, Munich, Germany, August 2000.International audienceOur work combines Java compilation to native code with a runtime library that executes Java threads in a distributed memory environment. This allows a Java programmer to view a cluster of processors as executing a single JAVA virtual machine. The separate processors are simply resources for executing Java threads with true parallelism, and the run-time system provides the illusion of a shared memory on top of the private memories of the processors. The environment we present is available on top of several UNIX systems and can use a large variety of communication interfaces thanks to the high portability of its run time system. To evaluate our approach, we compare serial C, serial Java, and multithreaded Java implementations of a branch and-bound solution to the minimal-cost map-coloring problem. All measurements have been carried out on two platforms using two different communication interfaces: SISCI/SCI and MPI BIP/Myrinet