By Topic

Parallel, Distributed and Network-based Processing, 2002. Proceedings. 10th Euromicro Workshop on

Date 11-11 Jan. 2002

Filter Results

Displaying Results 1 - 25 of 76
  • Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing

    Publication Year: 2002
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    The following topics are dealt with: parallel, distributed and network-based processing; performance analysis; Web computing; failure handling; Java and Jini; parallel and distributed programming tools for grids; unorthodox computing architectures; systems and applications; message passing; scheduling; algorithms; and mobile ad hoc networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session 1: performance analysis [breaker page]

    Publication Year: 2002, Page(s): 5
    Request permission for commercial reuse | PDF file iconPDF (289 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 1: performance analysis [breaker page]

    Publication Year: 2002, Page(s): 5
    Request permission for commercial reuse | PDF file iconPDF (289 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 2: web computing [breaker page]

    Publication Year: 2002, Page(s): 47
    Request permission for commercial reuse | PDF file iconPDF (269 KB) | HTML iconHTML
    Freely Available from IEEE
  • Meta/spl psi/: a Web-based metacomputing environment to build a computational chemistry problem solving environment

    Publication Year: 2002, Page(s):49 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (793 KB) | HTML iconHTML

    The increasing complexity of large distributed scientific applications raises the problem of the coordination of diverse computational resources (computers, data bases, etc.). Multi-disciplinary applications often make use of coupled computational resources that cannot be replicated at a single site. There is the need for smart and user-friendly problem-solving environments that free scientists fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session 3: failure handling [breaker page]

    Publication Year: 2002, Page(s): 79
    Request permission for commercial reuse | PDF file iconPDF (265 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 4: Java and Jini [breaker page]

    Publication Year: 2002, Page(s): 107
    Request permission for commercial reuse | PDF file iconPDF (289 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 5: parallel and distributed programming tools for grids [breaker page]

    Publication Year: 2002, Page(s): 137
    Request permission for commercial reuse | PDF file iconPDF (289 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 6: programming [breaker page]

    Publication Year: 2002, Page(s): 171
    Request permission for commercial reuse | PDF file iconPDF (262 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 7: unorthodox computing architectures [breaker page]

    Publication Year: 2002, Page(s): 209
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (288 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 8: systems and applications [breaker page]

    Publication Year: 2002, Page(s): 251
    Request permission for commercial reuse | PDF file iconPDF (262 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 9: message passing [breaker page]

    Publication Year: 2002, Page(s): 291
    Request permission for commercial reuse | PDF file iconPDF (288 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 10: scheduling [breaker page]

    Publication Year: 2002, Page(s): 317
    Request permission for commercial reuse | PDF file iconPDF (261 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 11: algorithms I [breaker page]

    Publication Year: 2002, Page(s): 351
    Request permission for commercial reuse | PDF file iconPDF (264 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 12: mobile ad hoc networks [breaker page]

    Publication Year: 2002, Page(s): 393
    Request permission for commercial reuse | PDF file iconPDF (266 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 13: algorithms 2 [breaker page]

    Publication Year: 2002, Page(s): 427
    Request permission for commercial reuse | PDF file iconPDF (288 KB) | HTML iconHTML
    Freely Available from IEEE
  • Session 14: algorithms 3 [breaker page]

    Publication Year: 2002, Page(s): 453
    Request permission for commercial reuse | PDF file iconPDF (261 KB) | HTML iconHTML
    Freely Available from IEEE
  • Author index

    Publication Year: 2002, Page(s):479 - 480
    Request permission for commercial reuse | PDF file iconPDF (207 KB)
    Freely Available from IEEE
  • A fault-tolerant reservation-based strategy for scheduling aperiodic tasks in multiprocessor systems

    Publication Year: 2002, Page(s):319 - 326
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    Periodic and aperiodic tasks co-exist in many real-time systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise from arbitrary events. Their time constraints need to be met even in the presence of faults. Considering the unpredictability of aperiodic tasks, this paper proposes a fault-tolerant reservation-based strategy (FTRB) to sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eventually consistent failure detectors

    Publication Year: 2002, Page(s):91 - 98
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    The concept of unreliable failure detector was introduced by T.D. Chandra and S. Toueg (1996) as a mechanism that provides information about process failures. This mechanism has been used to solve different problems in asynchronous systems, in particular the Consensus problem. In this paper, we present a new class of unreliable failure detectors, which we call Eventually Consistent and denote by &... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks

    Publication Year: 2002, Page(s):403 - 410
    Cited by:  Papers (131)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    Devices in mobile ad hoc networks work as network nodes and relay packets originated by other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous not to cooperate. The new routing protocol extensions presented in this paper make it possible to detect and isolate misbehaving nodes, thus ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating MPI and nanothreads programming model

    Publication Year: 2002, Page(s):309 - 316
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    This paper presents a prototype runtime system that integrates MPI, used on distributed memory systems, and nanothreads programming model (NPM), a programming model for shared memory multiprocessors. This integration does not alter the independence of the two models, since the runtime system is based on a multilevel design that supports each of them individually but offers the capability of combin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric scheduling of 2-D UET-UCT uniform dependence loops

    Publication Year: 2002, Page(s):343 - 350
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1578 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards the design of an automatically tuned linear algebra library

    Publication Year: 2002, Page(s):201 - 208
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    In this work we propose the architecture of an automatically tuned linear algebra library, which is composed by a set of linear algebra routines along with their installation routines. During the installation process on a system, the linear algebra routines will be tuned automatically to the system conditions: hardware characteristics and basic libraries used in the linear algebra routines. The de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Execution time prediction for parallel data processing tasks

    Publication Year: 2002, Page(s):31 - 38
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    Nowadays a wide range of highly efficient hardware components are available as possible building blocks for parallel distributed systems, however many questions arise on the software side. There is no common solution for optimal distribution of co-operating tasks, and performance prediction is also an open issue. Efforts are focused on creating and making use of mathematical models in a precise do... View full abstract»

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