Results 1  10
of
18
Data structure as topological spaces
 In Proceedings of the 3nd International Conference on Unconventional Models of Computation UMC02
, 2002
"... Abstract. In this paper, we propose a topological metaphor for computations: computing consists in moving through a path in a data space and making some elementary computations along this path. This idea underlies an experimental declarative programming language called mgs. mgs introduces the notion ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, we propose a topological metaphor for computations: computing consists in moving through a path in a data space and making some elementary computations along this path. This idea underlies an experimental declarative programming language called mgs. mgs introduces the notion of topological collection: a set of values organized by a neighborhood relationship. The basic computation step in mgs relies on the notion of path: a path C is substituted for a path B in a topological collection A. This step is called a transformation and several features are proposed to control the transformation applications. By changing the topological structure of the collection, the underlying computational model is changed. Thus, mgs enables a unified view on several computational mechanisms. Some of them are initially inspired by biological or chemical processes (Gamma and the CHAM, Lindenmayer systems, Paun systems and cellular automata).
Topological collections, transformations and their application to the modeling and the simulation of dynamical systems
 In: Rewriting Technics and Applications (RTA’03), LNCS, vol. LNCS 2706
, 2003
"... I take the opportunity given by this invited talk to promote two ideas: (1) a topological point of view can fertilize the notion of rewriting and (2) this topological approach of rewriting is at the core of the modeling and the simulation of an emerging class of dynamical systems (DS): the DS that ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
(Show Context)
I take the opportunity given by this invited talk to promote two ideas: (1) a topological point of view can fertilize the notion of rewriting and (2) this topological approach of rewriting is at the core of the modeling and the simulation of an emerging class of dynamical systems (DS): the DS that exhibit a dynamical
8 1/2: DataParallelism and DataFlow
, 1996
"... We advocate a dataflow approach to dataparallelism to ensure both parallelism expressiveness and efficient exploitation of dataparallel applications on new massively parallel architectures. The rational of this approach is introduced in the first part of the paper. Then we develop an experimental ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We advocate a dataflow approach to dataparallelism to ensure both parallelism expressiveness and efficient exploitation of dataparallel applications on new massively parallel architectures. The rational of this approach is introduced in the first part of the paper. Then we develop an experimental language following these lines and sketch the techniques used to compile such a dataflow dataparallel language. Its compilation, based upon a static execution model enabling an efficient execution of programs, is introduced.
A data parallel Java clientserver architecture for data field computations over ZZn
 in EuroPar’98 Parallel Processing, ser. LNCS
, 1998
"... Abstract. We describe FieldBroker, a software architecture, dedicated to data parallel computations on fields over ZZn. Fields are a natural extension of the parallel array data structure. From the application point of view, field operations are processed by a field server, leading to a client/serv ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
Abstract. We describe FieldBroker, a software architecture, dedicated to data parallel computations on fields over ZZn. Fields are a natural extension of the parallel array data structure. From the application point of view, field operations are processed by a field server, leading to a client/server architecture. Requests are translated successively in three languages corresponding to a tower of three virtual machines processing respectively mappings on ZZn, sets of arrays and flat vectors in core memory. The server is itself designed as a master/multithreadedslaves program. The aim of FieldBroker is to mutually incorporate approaches found in distributed computing, functional programming and the data parallel paradigm. It provides a testbed for experiments with language constructs, evaluation mechanisms, onthefly optimizations, loadbalancing strategies and data field implementations. 1
Introducing Dynamicity in the DataParallel Language
 In EuroPar'96 Parallel Processing
, 1996
"... . The main motivation of 81/2 is to develop a highlevel language that supports the parallel simulation of dynamical processes [1, 2]. To achieve this goal, a new datastructure, that merges the concept of stream and collection is introduced in a declarative framework. After a brief description of ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
. The main motivation of 81/2 is to develop a highlevel language that supports the parallel simulation of dynamical processes [1, 2]. To achieve this goal, a new datastructure, that merges the concept of stream and collection is introduced in a declarative framework. After a brief description of 81/2 basics, we describe the introduction of dynamicity and symbolic values in the language. We focus on the expressivity and issues brought by the new dynamic possibilities of the language and show, through several paradigmatic examples, that our computation model is able to support parallel symbolic processing. 1 The Declarative DataParallel Language 81/2 1.1 Motivations: the Implicit DataParallel Approach to Parallel Symbolic Processing 81/2 is an experimental language combining features of collection and stream oriented languages in a declarative framework. It tries to promote the construction of parallel programs by isolating the programmer from the complexities of parallel proces...
Computational Models for Integrative and Developmental Biology
, 2002
"... Machine (CHAM) formalism extends these ideas with a focus on the expression of semantic of non deterministic processes [BB90]. The CHAM is an elaboration on the original Gamma formalism introducing the notion of subsolution enclosed in a membrane. It is shown that models of algebraic process calcul ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Machine (CHAM) formalism extends these ideas with a focus on the expression of semantic of non deterministic processes [BB90]. The CHAM is an elaboration on the original Gamma formalism introducing the notion of subsolution enclosed in a membrane. It is shown that models of algebraic process calculi can be defined in a very natural way using a CHAM: the fact that concurrency (between rule application) is a primitive builtin notion makes proof far easier than in the usual process semantics. The motivations of Gamma and the CHAM are the development of a formalism to support the specification and the programming of parallel and non deterministic programs. Multiset rewriting lies at the core of the formalism.
Data Flow Analysis of Recursive Structures
, 1996
"... . Most imperative languages only offer arrays as "firstclass" data structures. Other data structures, especially recursive data structures such as trees, have to be manipulated using explicit control of memory, i.e., through pointers to explicitly allocated portions of memory. We believe ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. Most imperative languages only offer arrays as "firstclass" data structures. Other data structures, especially recursive data structures such as trees, have to be manipulated using explicit control of memory, i.e., through pointers to explicitly allocated portions of memory. We believe that this severe limitation is mainly due to historical reasons, and this paper will try and demonstrate that modern analysis techniques, such as data flow analysis, allow to cope with the compilation problems associated with recursive data structures. As a matter of fact, recursion in the flow of control also is a current open issue in automatic parallelization: to our knowledge, no theory allows the parallelization of, e.g., recursive Pascal programs. This paper uniformly handles both issues. We propose a kernel language that manipulates recursive data structures in an elegant, algebraic way. In this preliminary work, both data and control recursive structures are restricted, so that a data flow a...
A Topological Framework for the Specification and the Simulation of Discrete Dynamical Systems
, 2004
"... MGS is an experimental programming language for the modeling and the simulation of discrete dynamical systems. The modeling approach is based on the explicit specification of the interaction structure between the system parts. This interaction structure is adequately described by topological not ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
MGS is an experimental programming language for the modeling and the simulation of discrete dynamical systems. The modeling approach is based on the explicit specification of the interaction structure between the system parts. This interaction structure is adequately described by topological notions. The topological approach enables a unified view on several computational mechanisms initially inspired by biological or chemical processes (Gamma and the CHAM, Lindenmayer systems, P systems and cellular automata). The expressivity of the language is illustrated by the modeling of a di#usion limited aggregation process on a wide variety of spatial domain: from cayley graphs to arbitrary manifolds.
Array Dataflow Analysis for Imperative Recursive Programs
 Laboratory PRiSM, University of Versailles
, 1996
"... Dataflow analysis is extremely important to detect parallelism. Therefore, the current lack of suitable analysis makes recursion in the control flow still an open problem in automatic parallelization. This paper presents a novel dataflow analysis for imperative recursive programs. The dataflow so ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Dataflow analysis is extremely important to detect parallelism. Therefore, the current lack of suitable analysis makes recursion in the control flow still an open problem in automatic parallelization. This paper presents a novel dataflow analysis for imperative recursive programs. The dataflow sources are represented by closed forms expressions, parametrized with an index on the current node in the call tree. The model of our analysis is based on regular expressions and integer linear programming. We also discuss the implemented software, which is freely distributed. This paper also addresses the dual problem: dataflow analysis of recursive data structures. Moreover, this analysis not only suits automatic parallelization, but has several applications in program checking, optimization of memory usage, etc. Keywords: dataflow analysis, automatic parallelization, compilation, recursion, recursive data structures. 1 Introduction Automatic parallelization has been focusing on nests of...