## Parallel Computing Technologies: 6th International Conference, PaCT 2001, Novosibirsk, Russia, September 3-7, 2001 Proceedings, Volume 6Viktor Ė Malyškin, Victor Malyshkin The PaCT-2001 (Parallel Computing Technologies) conference was a four-day conference held in Akademgorodok (Novosibirsk), September 3–7, 2001. This was the sixth international conference in the PaCT series, organized in Russia every odd year. The ?rst conference, PaCT-91, was held in Novosibirsk (Academgorodok), September 7–11, 1991. The next PaCT conferences were held in Obninsk (near Moscow), August 30 – September 4, 1993; in St.Petersburg, September 12–15, 1995; in Yaroslavl September 9–12, 1997; and in Pushkin (near St.Petersburg) from September 6–10, 1999. The PaCT proceedings are published by Springer- Verlag in the LNCS series. PaCT-2001 was jointly organized by the Institute of Computational Mat- maticsandMathematicalGeophysicsoftheRussianAcademyofSciences(No- sibirsk), the State University, and the State Technical University of Novosibirsk. The purpose of the conference was to bring together scientists working with theory, architecture, software, hardware, and solution of large-scale problems in order to provide integrated discussions on parallel computing technologies. The conference attracted about 100 participants from around the world. - thors from 17 countries submitted 81 papers. Of those submitted, 36 papers were selected for the conference as regular ones; there were also 4 invited - pers. In addition there were a number of posters presented. All the papers were internationally reviewed by at least three referees. As usual a demo session was organized for the participants. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A Hybrid Approach to ReactionDiffusion Processes Simulation | 1 |

Formal Verification of Coherence for a Shared Memory Multiprocessor Model | 17 |

Static Analysis for Secrecy and Noninterference in Networks of Processes | 27 |

Consensus in One Communication Step | 42 |

Design Space Exploration for Massively Parallel Processor Arrays | 51 |

Global Cellular Automata A Flexible Parallel Model | 66 |

CellularPipelined Algorithm Architecture for Polynomial Computing | 74 |

A Notation System for Parallel Program Description and Performance Analysis | 80 |

Fusion of Concurrent Invocations of Exclusive Methods | 293 |

Remote Access to HighPerformance Computing | 308 |

Event Logic Programming | 314 |

Techniques for Increasing Performance of CORBA Parallel Distributed Applications | 319 |

ManagerWorker Parallelism versus Dataflow in a Distributed Computer Algebra System | 329 |

Communication Interface CoIn | 344 |

Design of a Tool for Providing Dynamic Network Information to an Application | 350 |

Compilation Principle of a Specification Language Dedicated to Signal Processing | 358 |

FirstOrder 2D Cellular Neural Networks Investigation and Learning | 94 |

Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles | 98 |

A Transaction Processing Model for the Mobile Data Access System | 112 |

Characterizing Timed Net Processes Categorically | 128 |

Execution Time Optimization | 142 |

An On3z3 Reduction Procedure for Determining the Maximum Degree of Parallelism in Parallel Applications | 150 |

Efficient Algorithm for Transport Protocol for Packet Switched Networks | 159 |

Extension of Java Environment by Facilities Supporting Development of SPMD JavaPrograms | 175 |

Mechanisms of Parallel Computing Organization for NeuroCluster | 181 |

Parallel SPMDTasks Graph Description Language for Network Clusters | 186 |

Optimizing Metacomputing with CommunicationComputation Overlap | 190 |

A WebAccessible Cluster Computing System Based on Coordination and Mobility | 205 |

On Using SPiDER to Examine and Debug RealWorld DataParallel Applications | 211 |

Experimental Version of Parallel Programs Translator from Petri Nets to C++ | 226 |

Typing the ISA to Cluster the Processor | 232 |

SendRecv Considered Harmful? Myths and Truths about Parallel Programming | 243 |

A Grid Computing Environment for Distributed and Parallel Computing | 258 |

Parallel Adaptive Mesh Refinement with Load Balancing for Finite Element Method | 266 |

Concurrent Implementation of Structurally Synthesized Programs | 277 |

An Associative Version of the BellmanFord Algorithm for Finding the Shortest Paths in Directed Graphs | 285 |

An Approach to Composing Parallel Programs | 371 |

WebBased Parallel Simulation of AGVs Using Java and JINI | 379 |

On the Parallelezation of Domain Decomposition Methods for 3D Boundary Value Problems | 385 |

Parallel Generation of Percolation Beds Based on Stochastic Cellular Automata | 391 |

Parallel Simulation of 3D Incompressible Flows and Performance Comparison for Several MPP and Cluster Platforms | 401 |

Distributed Simulation of Hybrid Systems with HLA Support | 410 |

Application of the Parallel Computing Technology to a Wave Front Model Using the Finite Element Method | 421 |

A General Parallel Computing Approach Using the Finite Element Method and the Objects Oriented Programming by Selected Data Technique | 428 |

Parallel Implementation of a Corrected DSMC Method | 436 |

Survey of New Generation of Explicit Schemes | 442 |

Tool Environments in CORBABased Medical High Performance Computing | 447 |

Parallel Algorithms for the Analysis of Biological Sequences | 456 |

Some Parallel Monte Carlo Algorithms | 469 |

Implementation of the Parallel Four Points Modified Explicit Group Iterative Algorithm on Shared Memory Parallel Computer | 480 |

A Parallel Expressed Sequence Tag EST Clustering Program | 490 |

Protein Sequence Comparison on the Instruction Systolic Array | 498 |

SCIBased LINUX PCClusters as a Platform for Electromagnetic Field Calculations | 510 |

514 | |

### Other editions - View all

Parallel Computing Technologies: 6th International Conference ..., Volume 6 Victor Malyshkin,Viktor Ė Malyškin No preview available - 2001 |

### Common terms and phrases

algorithm application architecture array Array-OL ARTCP Berlin Heidelberg 2001 bisimulation block cache cell Cellular Automata client cluster collective operations communication components Computer Science concurrent CORBA corresponding CPMD debugging defined distributed Distributed Computing efficient elements environment equations example execution failure detector flow function global graph implementation input integration interface invocations iteration Java language LNCS load Malyshkin mapping matrix memory Message Passing Interface MetaPL method fusion mobile host mobile transactions morphisms nodes object optimal output parallel algorithm parallel computing parallel programs parameters pattern performance Petri Net Petri Nets problem procedure proposed protocol provides send-recv sequence sequential server simulation solution solving space specification SPMD Springer-Verlag Berlin Heidelberg step structure suffix tree synchronization Systola systolic arrays task technique thread transformation UNICORE update variables vector