We present a framework for designing parallel programming languages whose semantics is functional and where communications are explicit. To this end, we specialize Brookes and Geva's generalized concrete data structures with a notion of explicit data layout and obtain a CCC of distributed structures called arrays. We nd that arrays' symmetric replicated structures, suggested by the data-paralle...

Most data-parallel languages use arrays to support paral-lelism. This regular data structure allows a natural development of regular parallel algorithms. The implementation of irregular algorithms requires a programming eeort to project the irregular data structures onto regular structures. We rst propose in this paper a classiication of existing data-parallel languages. We brieey describe thei...

In this work, we assess theoretically the physical response of metamaterial composite structures that emulate the behavior of negative-permittivity materials in certain relevant setups. The metamaterials under analysis consist of metallic parallel-plate implants embedded in a dielectric host in a two-dimensional geometry. Simple design rules and formulas are presented, fully considering the eff...

Symbolic applications often require dynamic irregular data structures, such as linked lists, unbalanced trees, and graphs, and they exhibit unpredictable computational patterns that lead to asynchronous communication and load imbalance when parallelized. In this paper we describe several symbolic applications and their parallelizations. The main problem in parallelization of each application wa...

This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering techniques. It works on the premise that it is possible to find errors by comparing the contents of key data structures at run time between a “working” version and the new code. Previously, our reference implementation of ...

We address the verification problem of networks of communicating pushdown systems modeling communicating parallel programs with procedure calls. Processes in such networks can read the control state of the other processes according to a given communication structure (specifying the observability rights between processes). The reachability problem of such models is undecidable in general. First,...

Direct volume rendering is a popular technique for scientifc visualization. The computation cost of direct volume rendering increases exponentially as the size of the volume dataset increases. Hence, efficient volume rendering has become an important issue. In this work, we study parallel volume rendering algorithms based on sparse data structures. In order to exploit object space coherence, we...

We integrate the semantics of higher-order functional programs with a notion of explicit static processes as used in BSP and PRAM algorithms. The result is the construction of a cartesian closed category (CCC), a model for typed functional languages. Concrete data structures (CDS) yield many useful CCC and Brookes and Geva have generalised (gCDS) and used them as domains of a CCC whose arrows a...

Specification language of NUT has been recently extended with functions for distributed computing. This extension can be used for developing a collection of control structures for parallel compositional programming. The purpose of this thesis is to support distributed and coarse grained parallel computing in the NUT system, on the basis of the rNUT distributed programming toolkit. This work con...