Parallel and Distributed Processing, 1999. PDP '99. Proceedings of the Seventh Euromicro Workshop on

3-5 Feb. 1999

Filter Results

Displaying Results 1 - 25 of 50
  • Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (257 KB)
    Freely Available from IEEE
  • Index of authors

    Publication Year: 1999, Page(s):381 - 382
    Request permission for commercial reuse | PDF file iconPDF (193 KB)
    Freely Available from IEEE
  • Work load balance approaches for branch and bound algorithms on distributed systems

    Publication Year: 1999, Page(s):155 - 162
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4928 KB)

    Branch and Bound is a standard method for searching an optimal solution in the scope of continuous and discrete Global Optimization. It iteratively creates a search tree where each node represents a problem which is decomposed in several subproblems provided that a feasible solution can be found by solving this set of subproblems. The computational power needed to solve most of the Branch and Boun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support for tailoring CSCW systems: adaptation by composition

    Publication Year: 1999, Page(s):146 - 152
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    In the last few years it has been realized that flexibility and tailorability are key requirements for software systems in general and for CSCW (Computer Supported Cooperative Work) systems in particular. An important mechanism for providing tailorability is the creation of compound functionality by the composition of specialized modules. In this paper we identify two variants of this composition ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilising parallel resources by speculation

    Publication Year: 1999, Page(s):339 - 343
    Cited by:  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    This paper introduces Simultaneous Speculation Scheduling, a new compiler technique that enables speculative execution of alternative program paths. In our approach concurrently executed threads are generated that represent alternative program paths. Each thread is the result of a speculation on the outcome of one or more branches. All threads are simultaneously executed although only one of them ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting cooperative WWW browsing: a proxy-based approach

    Publication Year: 1999, Page(s):138 - 145
    Cited by:  Papers (14)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    The paper presents a system for synchronous cooperative browsing that permits users within a workgroup to share information and cooperate toward a common goal. The system implementation is based on a Java proxy, to achieve portability without requiring modification neither to browsers nor to servers. In addition, the paper shows that the implemented system defines a general framework for interacti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A special purpose hybrid SIMD processor for logic event simulation

    Publication Year: 1999, Page(s):74 - 83
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    This paper introduces a hybrid associative memory/SIMD parallel processor, APPLES, which has been specifically designed for logic simulation. It reviews the computational structure which permits parallel execution of logic gate evaluations in memory. This facilitates fine grain execution on a massive scale of the basic tasks inherent in VLSI logic simulation. Furthermore, unlike other SIMD approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct mapped cache performance modeling for sparse matrix operations

    Publication Year: 1999, Page(s):331 - 338
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    Sparse matrices are in the kernel of numerical applications. Their compressed storage, which permits both operations and memory savings, generates irregular access patterns, reducing the performance of the memory hierarchy In this work we present a probabilistic model for the prediction of the number of misses of a direct mapped cache memory, considering sparse matrices with a uniform entries dist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent-based systems co-operation

    Publication Year: 1999, Page(s):130 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    Information exchange between sites within network is currently based on automated data exchange at the protocol level and unfortunately only on supervised information exchange at the user level. Automation of information exchange is as difficult, as still no domain-independent general semantics can be defined users of small systems, as well as those of large interactive systems that are connected ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel resolution of alternating-line processes by means of pipelining techniques

    Publication Year: 1999, Page(s):289 - 296
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    The aim of this paper is to present an easy and efficient method to implement alternating-line processes on current parallel computers. First we show how data locality has an important impact on global efficiency, which leads us to the conclusion that one-dimensional compositions are the most convenient ones for 2D problems. Once this is asserted, a parallel algorithm is presented for the solution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A RAID reconfiguration scheme for gracefully degraded operations

    Publication Year: 1999, Page(s):66 - 73
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    One distinct advantage of Redundant Array of Independent Disks (RAID) is fault tolerance. But the performance of a disk array in degraded mode is so poor that no one uses the RAID after failure. Continuous operation of RAID in degraded mode is very important in many real time applications, which can not be interrupted in providing continuous services. In this paper, we propose an efficient archite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of the bubble algorithm: benefits for k-ary n-cubes

    Publication Year: 1999, Page(s):349 - 356
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The bubble algorithm evaluated in this paper assures message deadlock freedom in k-ary, n-cube network without using virtual channels. This algorithm is based both on a dimension order I outing (DOR) and on a restricted injection policy extended to the dimension changes. An exhaustive comparison between the bubble mechanism and the classical deterministic virtual channels solution is presented her... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An atmosphere-ocean forecast system on a hybrid architecture

    Publication Year: 1999, Page(s):309 - 314
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    An operational forecast system is being developed at ENEA, which consists of a high resolution meteorological limited area model coupled with ocean models for the prediction of the state of the Mediterranean Sea and of high water events in the Venice Lagoon. In order to satisfy the operational requirement (3-days forecasts in a few hours) a very effective two level parallelization strategy was ado... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large scale simulations of quantum chromodynamics in a Europe wide SIMD-MIMD environment

    Publication Year: 1999, Page(s):321 - 327
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Large scale simulations of Quantum Chromodynamics are extremely CPU time demanding. Today, simulations in a heterogeneous SIMD-MIMD environment can be an interesting step towards simulations on Teracomputers, as already available for Japanese and US groups View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance models for I/O bound SPMD applications on clusters of workstations

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

    Clusters of workstations represent today a satisfactory alternative to MPPs and supercomputers in many areas of application. The rapidly reduction of the cost of high performance workstations/PCs makes this technology ever more available. Moreover, new concepts for the integration of individual workstations through Local Area Networks are emerging. High speed interconnection networks and optimized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic coupling of grid-based multidisciplinary applications

    Publication Year: 1999, Page(s):249 - 255
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    The GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are devoted to a single discipline, can be interconnected to a complex simulation system via the GRISSLi coupling interface without recoding the participating programs. We introduce a data model to establish the links between ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Termination handling in inter-organisational workflows-an exception management approach

    Publication Year: 1999, Page(s):122 - 129
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The co-ordination of business processes across organisational boundaries requires assigning responsibility for costs to the involved business partners, in particular in case of termination of a sub process that is outsourced to another organisation. The circumstances in which business partners can terminate ongoing processes and the assignment of costs are usually specified in a contract. It defin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling advanced modular avionics architectures for early real-time performance analysis

    Publication Year: 1999, Page(s):181 - 188
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Behavioral simulation including the impact of architectural choices is required to help the designer in reducing design ambiguities and errors of embedded complex systems which are distributed (for performance and reliability requirements) and present hard real-time features (time critical avionics functions), as early in the product life cycle as possible. This paper presents a modeling and simul... View full abstract»

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

    Publication Year: 1999, Page(s):19 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    The parallel computing model presented in this paper, the Collective Computing model (CCM), is an improvement of the well-known Bulk Synchronous Parallel (BSP) model. The synchronicity imposed by the BSP model restricts the set of available algorithms and prevents the overlapping of computation and communication. Other models, like the LogP model, allow asynchronous computing and overlapping but d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to mapping parallel programs on hypercube multiprocessors

    Publication Year: 1999, Page(s):221 - 225
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (28 KB)

    In this work, we propose a heuristic algorithm based on genetic algorithm for the task-to-processor mapping problem in the context of local-memory multiprocessors with a hypercube interconnection topology. Hyper-cube multiprocessors have offered a cost effective and feasible approach to supercomputing through parallelism at the processor level by directly connecting a large number of low-cost proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method to solve the scalability problem in managing massively parallel processing on the Internet

    Publication Year: 1999, Page(s):256 - 262
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    A set of computers connected by the Internet can be seen as a MIMD virtual parallel computer with distributed memory. We call such a computer a Massively Parallel Virtual Computer (MPVC). The implementation of an MPVC will be feasible in the next few years, as new technologies brine to Internet communication speeds undreamed of nowadays. Problems such as Monte Carlo simulations and image processin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis on CRAY T3E

    Publication Year: 1999, Page(s):241 - 248
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    One of the reasons why parallel programming is considered to be a difficult task is that users frequently cannot predict the performance impact of implementation decisions prior to program execution. This results in a cycle of incremental performance improvements based on run-time performance data. While gathering and analyzing performance data is supported by a large number of tools, typically in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A replicated resource architecture for high performance network service

    Publication Year: 1999, Page(s):105 - 111
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    Distributed Learning Environments represent the hope that communications and information technology can improve and widen access to education while maintaining and improving its quality. Such environments consist of network applications and services. Good interactive response time is crucial to their success. Slow responses can quickly dissuade teachers and learners alike from investing their time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective Monte Carlo simulation on System-V massively parallel associative string processing architecture

    Publication Year: 1999, Page(s):281 - 288
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    We show that the latest version of massively parallel processing associative string processing architecture (System-V) is applicable for fast Monte Carlo simulation if an effective on-processor random number generator is implemented. Our lagged Fibonacci generator can produce 10 8 random numbers on a processor string of 12 K PE-s. The time dependent Monte Carlo algorithm of the one-dime... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The impact of cache organisation on the instruction issue rate of a superscalar processor

    Publication Year: 1999, Page(s):58 - 65
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB)

    Much of the research on multiple-instruction-issue processor architecture assumes a perfect memory hierarchy and concentrates on increasing the instruction issue rate of the processor either through aggressive out-of-order instruction issue or through static instruction scheduling. In this paper we describe a trace driven simulation tool that we have developed to quantify the impact of the memory ... View full abstract»

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