Proceedings International Conference on Parallel Processing

21-21 Aug. 2002

Filter Results

Displaying Results 1 - 25 of 69
  • Proceedings International Conference on Parallel Processing

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • Hardware schemes for early register release

    Publication Year: 2002, Page(s):5 - 13
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (523 KB) | HTML iconHTML

    Register files are becoming one of the critical components of current out-of-order processors in terms of delay and power consumption, since their potential to exploit instruction-level parallelism is quite related to the size and number of ports of the register file. In conventional register renaming schemes, register releasing is conservatively done only after the instruction that redefines the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable MAC layer multicast in IEEE 802.11 wireless networks

    Publication Year: 2002, Page(s):527 - 536
    Cited by:  Papers (23)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    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.
  • Author index

    Publication Year: 2002, Page(s):631 - 632
    Request permission for commercial reuse | PDF file iconPDF (198 KB)
    Freely Available from IEEE
  • MAC layer protocols for real-time traffic in ad-hoc wireless networks

    Publication Year: 2002, Page(s):539 - 546
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    Providing quality of service (QoS) to high bandwidth video, voice and data applications in wireless networks is an important problem. Such applications are in the class of real-time applications; they need communication operations to complete within certain targeted deadlines. Based on this premise, this paper addresses the design of distributed MAC layer protocols that incorporate explicit suppor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ART: robustness of meshes and tori for parallel and distributed computation

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

    We formulate array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumption is made about the availability of a complete submesh or subtorus. Based on ARTs, a very wide variety of problem, including sorting, FFT, total exchange, permutation, and some matrix operations, can be solved with a slowdown factor of 1+o(1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neuron-a wide-area service discovery infrastructure

    Publication Year: 2002, Page(s):455 - 462
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB) | HTML iconHTML

    A wide-area service discovery infrastructure provides a repository in which services over a wide area can register themselves and clients everywhere can inquire about them. We discuss how to build such an infrastructure based on the peer-to-peer model. The proposed system, called Neuron, can be executed on top of a set of federated nodes across the global network and aggregate their resources to p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EMPOWER: a scalable framework for network emulation

    Publication Year: 2002, Page(s):185 - 192
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    The development and implementation of new network protocols and applications need accurate, scalable, reconfigurable, and inexpensive tools for debugging, testing, performance tuning and evaluation purposes. Network emulation provides a fully controllable laboratory network environment in which protocols and applications can be evaluated against predefined network conditions and traffic dynamics. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized broadcast channel access algorithms for ad hoc networks

    Publication Year: 2002, Page(s):151 - 158
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (459 KB) | HTML iconHTML

    The problem of broadcast channel access in single-hop and multihop ad hoc networks is considered. Two novel randomized and distributed channel access algorithms are developed and analyzed for single-hop and multihop networks, respectively. These algorithms are designed based on maximizing the worst-case channel efficiency, by optimizing some key parameters, including the backoff probability distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A best-effort communication protocol for real-time broadcast networks

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

    In this paper, we present a best-effort communication protocol, called ABA, that seeks to maximize aggregate application benefit and deadline-satisfied ratio of asynchronous real-time distributed systems that use CSMA/DDCR broadcast networks. ABA considers an application model where end-to-end timeliness requirements of trans-node application tasks are expressed using Jensen's benefit functions. F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system for monitoring and management of computational grids

    Publication Year: 2002, Page(s):55 - 62
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (807 KB) | HTML iconHTML

    As organizations begin to deploy large computational grids, it has become apparent that systems for observation and control of the resources, services, and applications that make up such grids are needed. Administrators must observe resources and services to ensure that they are operating correctly and must control resources and services to ensure that their operation meets the needs of users. Use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance comparison of location areas and reporting centers under aggregate movement behavior mobility models

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

    Location management deals with how to track mobile users within the cellular network. It consists of two basic operations: location update and paging. The total location management cost is the sum of the location update cost and the paging cost. Location areas and reporting centers are two popular location management schemes. The motivation for the study is the observation that the location update... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative grid-based computing using mobile agents

    Publication Year: 2002, Page(s):109 - 117
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    We describe an environment for the distributed solution of iterative grid-based applications. The environment is built using the MESSENGERS mobile agent system. The main advantage of paradigm-oriented distributed computing is that the user only needs to specify the application-specific sequential code, while the underlying infrastructure takes care of the parallelization and distribution. The two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The tracefile testbed - a community repository for identifying and retrieving HPC performance data

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

    High-performance computing (HPC) programmers utilize tracefiles, which record program behavior in great detail, as the basis for many performance analysis activities. The lack of generally accessible tracefiles has forced programmers to develop their own testbeds in order to study the basic performance characteristics of the platforms they use. Since tracefiles serve as input to performance analys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Honey, I shrunk the Beowulf!

    Publication Year: 2002, Page(s):141 - 148
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1174 KB) | HTML iconHTML

    In this paper, we present a novel twist on the Beowulf cluster - the Bladed Beowulf. Designed by RLX Technologies and integrated and configured at Los Alamos National Laboratory, our Bladed Beowulf consists of compute nodes made from commodity off-the-shelf parts mounted on motherboard blades measuring 14.7" × 4.7" × 0.58". Each motherboard blade (node) contains a 633 MHz Trans-meta TM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst case analysis of a greedy multicast algorithm in k-ary n-cubes

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

    In this paper, we consider the problem of multicasting a message in k-ary n-cubes under the store-and-forward model. The objective of the problem is to minimize the size of the resultant multicast tree by keeping the distance to each destination over the tree the same as the distance in the original graph. In the following, we first propose an algorithm that grows a multicast tree in a greedy mann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Region synchronization in message passing systems

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

    The development of correct synchronization code for distributed programs is a challenging task. In this paper, we propose an aspect oriented technique for developing synchronization code for message passing systems. Our approach is to factor out synchronization as a separate aspect, synthesize synchronization code and then compose it with the functional code. Specifically, we allow the designer of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating trust into grid resource management systems

    Publication Year: 2002, Page(s):47 - 54
    Cited by:  Papers (60)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    Grid computing systems that have been the focus of much research in recent years provide a virtual framework for controlled sharing of resources across institutional boundaries. Security is a major concern in any system that enables remote execution. Several techniques can be used for providing security in grid systems including sandboxing, encryption, and other access control and authentication m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LDBS: a duplication based scheduling algorithm for heterogeneous computing systems

    Publication Year: 2002, Page(s):352 - 359
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph (DAG) onto a set of heterogeneous machines is known to be an NP-hard problem. In this study, we present a duplication based scheduling algorithm, namely the levelized duplication based scheduling (LDBS) algorithm, which solves this problem efficiently. The primary goal of LDBS is to minimize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MOBY-a mobile peer-to-peer service and data network

    Publication Year: 2002, Page(s):437 - 444
    Cited by:  Papers (16)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (463 KB) | HTML iconHTML

    This paper describes the design and implementation of MOBY, a network for mobile peer-to-peer exchange of services and data. Constraints on computing power of mobile devices, limited hardware, networking, and software resources, and ad-hoc nature of mobile clients pose considerable challenges from the points of view of supporting performance goals, ease of service integration, and adaptation. Thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dead timestamp identification in Stampede

    Publication Year: 2002, Page(s):101 - 108
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    Stampede is a parallel programming system to support computationally demanding applications including interactive vision, speech and multimedia collaboration. The system alleviates concerns such as communication, synchronization, and buffer management in programming such real-time stream-oriented applications. Threads are loosely connected by channels that hold timestamped data items. There are tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A selection technique for replicated multicast video servers

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

    In this paper, we propose a selection technique for replicated multicast video servers. We assume that each replicated video server transmits the same video source as different quality levels of multicast streams. Using an IGMP facility like m-trace, each receiver monitors packet count information of those streams on routers and periodically selects the one which is expected to provide low loss ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm for knot detection in a distributed graph

    Publication Year: 2002, Page(s):485 - 492
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    Knot detection in a distributed graph is an important problem and finds applications in several areas such as packet switching, distributed simulation, and distributed database systems. The paper presents a distributed algorithm to efficiently detect the existence of a knot in a distributed graph. The algorithm requires 2e messages and a delay or 2(d+1) message hops to detect if a node in a distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introducing SCSI-to-IP cache for storage area networks

    Publication Year: 2002, Page(s):203 - 210
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB) | HTML iconHTML

    Data storage plays an essential role in today's fast-growing data-intensive network services. iSCSI is one of the most recent standards that allow SCSI protocols to be carried out over IP networks. However, the disparities between SCSI and IP prevent fast and efficient deployment of SAN (storage area network) over IP. This paper introduces STICS (SCSI-To-IP cache storage), a novel storage architec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and evaluation of scalable switching fabrics for high-performance routers

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

    This work considers switching fabrics with distributed packet routing to achieve high scalability and low costs. The considered switching fabrics are based on a multistage structure with different re-circulation designs, where adjacent stages are interconnected according to the indirect n-cube connection style. They all compare favorably with an earlier multistage-based counterpart according to ex... View full abstract»

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