A Test Suite for High-Performance Parallel Java

The Java programming language has a number of features that make it attractive for writing high-quality, portable parallel programs. A pure object formulation, strong typing and the exception model make programs easier to create, debug, and maintain. The elegant threading provides a simple route to parallelism on shared-memory machines. Anticipating great improvements in numerical performance, this paper presents a suite of simple programs that indicate how a pure Java Navier-Stokes solver might perform. The suite includes a parallel Euler solver. We present results from a 32-processor Hewlett-Packard machine and a 4-processor Sun server. While speedup is excellent on both machines, indicating a high-quality thread scheduler, the single-processor performance needs much improvement

BeSpaceD: Towards a Tool Framework and Methodology for the Specification and Verification of Spatial Behavior of Distributed Software Component Systems

In this report, we present work towards a framework for modeling and checking behavior of spatially distributed component systems. Design goals of our framework are the ability to model spatial behavior in a component oriented, simple and intuitive way, the possibility to automatically analyse and verify systems and integration possibilities with other modeling and verification tools. We present examples and the verification steps necessary to prove properties such as range coverage or the absence of collisions between components and technical details

Parallel and distributed Gr\"obner bases computation in JAS

This paper considers parallel Gr\"obner bases algorithms on distributed memory parallel computers with multi-core compute nodes. We summarize three different Gr\"obner bases implementations: shared memory parallel, pure distributed memory parallel and distributed memory combined with shared memory parallelism. The last algorithm, called distributed hybrid, uses only one control communication channel between the master node and the worker nodes and keeps polynomials in shared memory on a node. The polynomials are transported asynchronous to the control-flow of the algorithm in a separate distributed data structure. The implementation is generic and works for all implemented (exact) fields. We present new performance measurements and discuss the performance of the algorithms.Comment: 14 pages, 8 tables, 13 figure

Fifty years of Hoare's Logic

We present a history of Hoare's logic.Comment: 79 pages. To appear in Formal Aspects of Computin

An investigation on a quantum communication phenomenon between sub-atomic properties of substances by Quantum eraser pattern quantification

The file attached to this record is the author's final peer reviewed version.The proposed novel idea is concerned with the investigation on a probability of sub-atomic quantum communication between the chemical substances by use of “interferometric Quantum eraser” pattern analysis, which would be the first step towards the further comprehensive study on a similar natural communications between the medications and diseased organic tissues. The hypothesis is based on the idea that, sub-atomic particles like photons attempt to access or gain complementary information causing their “wave-particle duality” shifting which is used to observe their time-sequenced activities. Such information would probably be provided by sub-atomic quantum communication action demonstrated between the substances in a chemical reaction. Similarly, the medications may have curing effects on a diseased organic tissue after such “natural” communication, by which a complementary information is transferred from the sub-atomic properties of chemical substance to the diseased organic tissue at same level for the treatment