Software Engineering for Parallel and Distributed Systems, 1997. Proceedings., Second International Workshop on

17-18 May 1997

Filter Results

Displaying Results 1 - 25 of 32
  • Proceedings of PDSE '97: 2nd International Workshop on Software Engineering for Parallel and Distributed Systems

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (310 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s): 311
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • Concurrency in object oriented language Actel

    Publication Year: 1997, Page(s):291 - 296
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    This paper presents features of an object based concurrent language called Actel. In particular, it introduces the mechanisms of inter and intra-object concurrency and synchronisation. Inter object concurrency is achieved with conventional message passing (value and priority) and also with a new mode of message passing called the semi-reference. Intra-object concurrency may be achieved with parall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Seuss: what the doctor ordered

    Publication Year: 1997, Page(s):284 - 290
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    Reconciling the conflicting goals of simplicity and efficiency has traditionally been a major challenge in the development of concurrent programs. Seuss (see J. Misra, ftp://ftp.cs.utexas.edu/pub/psp/seuss/discipline.ps.Z) is a methodology for concurrent programming that attempts to achieve the right balance between these competing concerns. The goal of Seuss is to permit a disentanglement of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scenario-based hypersequential programming: concept and example

    Publication Year: 1997, Page(s):277 - 283
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Hypersequential programming is a new paradigm of concurrent programming in which the original concurrent program is first serialized, then tested and debugged as a sequential program, and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specifying parallel and distributed systems in Object-Z: the lift case study

    Publication Year: 1997, Page(s):140 - 149
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    There has been an increasing emphasis on formality in software system specification in the last few years. A number of standards bodies are recommending the use of formal notations for specifying software systems. Parallel and distributed systems have their own complex features such as: the concurrent interactions between various system components; the reactive nature of the systems; various messa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling of advanced tasking in Ada-95: a Petri net perspective

    Publication Year: 1997, Page(s):4 - 14
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The Ada language has been designed to support development of concurrent and distributed software. While the Ada-83 standard defined the basic mechanisms of rendezvous-based tasking, the Ada-95 standard significantly extended this capability with the introduction of several advanced tasking constructs. We present and discuss formal models of these key tasking constructs using the Petri net model. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tolerant (parallel) programming with F-nets and Software Cabling

    Publication Year: 1997, Page(s):198 - 209
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1232 KB)

    In order to be truly portable, a program must be tolerant of a wide range of development and execution environments, and a parallel program is just one which must be tolerant of a very wide range. First, the term “tolerant programming” is defined. Then, a formal model called F-Nets is described in which parallel algorithms are expressed as folded partial-orderings of operations, and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance prototyping approach to designing concurrent software architectures

    Publication Year: 1997, Page(s):270 - 276
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A prototyping approach to evaluating the performance of parallel and distributed software architectures is proposed. The approach utilises conventional object-oriented modelling to describe the system requirements. Alternative architectural approaches are then derived and expressed in the PARSE process graph notation, and performance prototyping and formal validation tools allow various aspects of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making distributed applications manageable through instrumentation

    Publication Year: 1997, Page(s):84 - 94
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    The goal of a management system in a distributed computing environment is to provide a centralized and coordinated view of an otherwise distributed and heterogeneous collection of hardware and software resources. Management systems monitor, analyse and control network resources, system resources, and distributed application programs. Many organizations currently depend on mission-critical distribu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic template generation for solving n2-problems on parallel systems with arbitrary topology

    Publication Year: 1997, Page(s):130 - 138
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The authors consider the automatic generation of parallel templates as basis for the implementation of n2-problem solvers on parallel systems. The automatic template generator relies on the embedding of a virtual systolic loop on the given machine's network and optimizes hyper-systolic data communication by means of simulated annealing techniques. They have generated a parallel template... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating library modules into special purpose parallel algorithms

    Publication Year: 1997, Page(s):162 - 173
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    Most programs from scientific computing can benefit from the use of numerical libraries which provide efficient implementations for standard solution methods that often occur in numerical simulations. This is especially true for parallel scientific computing. A methodology that allows the integration of library functions without any additional programming effort would ease this programming style. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical optimization of parallel applications

    Publication Year: 1997, Page(s):222 - 233
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    In order to allow the efficient implementation of parallel application programs, various design decisions have to be made and implemented. These include the task mapping and schedule, the task granularity as well as decisions concerning code optimizations. The paper describes a hierarchical concept for system design and implementation. The concept has been implemented in the DSPL programming envir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Web computing skeleton: a case study

    Publication Year: 1997, Page(s):188 - 197
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1420 KB)

    An approach to provide a Web-based framework for distributed execution of collaborative applications is presented. The work is a part of a wider on-going project whose aim is to make environmental simulation models publicly available to Internet users. The Web computing skeleton has been constructed from prefabricated Web-enabled components with the ability to open and maintain Web connections and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchic architecture model for dynamic reconfiguration

    Publication Year: 1997, Page(s):243 - 254
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1116 KB)

    Dynamic reconfiguration is the ability to modify a parallel or distributed system while it is running. We adopt the framework developed by Kramer et al. (1985) at the system architecture level: changes must occur in a consistent state, which is brought about by “freezing” some system components. The goal is to reduce system disruption, i.e., to minimize: the part of the system to be &l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-stop monitoring and debugging on shared-memory multiprocessors

    Publication Year: 1997, Page(s):263 - 269
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    Monitoring and debugging parallel programs is a difficult activity. There are many situations where the traditional “stop the world, I want to get off” approach to debugging is simply unsuitable. Frequently, nonintrusive monitoring of the program execution is more productive in locating sources of error and also in monitoring “correct” programs for such purposes as performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prototype-oriented development of high-performance systems

    Publication Year: 1997, Page(s):74 - 83
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1512 KB)

    We discuss the problem of developing performance-oriented software and the need for methodologies. We then present the EDPEPPS (Environment for Design and Performance Evaluation of Portable Parallel Software) approach to the problem of designing and evaluating high-performance (parallel) applications. The EDPEPPS toolset is based on a rapid prototyping philosophy, where the designer synthesises a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automated algorithmic recognition technique to support parallel software development

    Publication Year: 1997, Page(s):120 - 129
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Techniques for automatic program recognition, at the algorithmic level, could be of great interest in the area of program parallelization, because the selection of suitable parallelization strategies is driven by algorithmic features of the code. A technique for the specification and automatic recognition of algorithmic concepts is presented. Its flexibility and expressivity power for specifying t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reachability testing of asynchronous message-passing programs

    Publication Year: 1997, Page(s):50 - 61
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    An execution of a message-passing program P with input X exercises a sequence of send and receive events, called a send-receive sequence (or SR-sequence). Assume that every execution of P with input X terminates. Reachability testing of P with input X is to execute all possible SR-sequences of P with input X. To perform reachability testing of P with input X, we first execute P with input X to col... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OPENPRESS-open distributed assessment platform for still image compression schemes

    Publication Year: 1997, Page(s):297 - 303
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    Performance comparison between image compression methods is an activity difficult to realise because of the few standard environments for validation. The objective of this paper is to present OPENPRESS as a single open platform for validation allowing the integration of most of the current and future image compression methods, to facilitate their comparison and validation on a common and coherent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formalizing a design technique for distributed programs

    Publication Year: 1997, Page(s):150 - 159
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    ADL-d is a graphical design technique for parallel and distributed software, in which communication modeling plays a central part. Recently the authors have used formal methods to define ADL-d's semantics. The original objective was to provide well-defined guidelines for future implementations of ADL-d's communication constructs, but, as it turned out, significant feedback resulted to the notation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graphical programming environment for message passing programs

    Publication Year: 1997, Page(s):210 - 219
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    A number of MP interfaces are available today but one of the most popular is the PVM software package. PVM permits the user to configure his own virtual computer by hooking together a heterogeneous collection of UNIX based machines on which the user has a valid login and which are accessible over some network. To provide high-level graphical support for PVM based program development, an integrated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Tuple Channel coordination model

    Publication Year: 1997, Page(s):95 - 106
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    We present a new coordination model and a small set of programming notations for distributed programming that can be integrated into very different programming languages (imperative, declarative or object oriented). Both together, allow distributed programs to be developed in a compositional way, by assembling different independent pieces of (possibly preexisting and heterogeneous) code. This appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing reusable software components following the CSP distributed programming model

    Publication Year: 1997, Page(s):174 - 185
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    The CSP distributed programming model offers formal bases that allow the development of high quality and secure distributed software for multicomputers. However, the model imposes restrictions that make it complicated to reuse software components developed with languages that follow the model. This problem is mainly due to each component in the application interacting with each other according to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling of parallel processing systems based on algorithmic skeletons

    Publication Year: 1997, Page(s):234 - 242
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    We motivate the use of algorithmic skeletons for modeling parallel applications in the context of scheduling. Scalability and other features of the skeletal approach are used to improve the quality of scheduling parallel applications in multiprogramming systems. We show how skeletons can be used to model parallel applications that can perform dynamical remapping. This technique modifies schedules ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.