By Topic

1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)

12-12 Feb. 1999

Filter Results

Displaying Results 1 - 25 of 67
  • 1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (284 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1999, Page(s):vi - ix
    Request permission for commercial reuse | PDF file iconPDF (259 KB)
    Freely Available from IEEE
  • Accelerating ATM: on-line compression of ATM streams

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

    Since ATM switches intended to be simple and inexpensive, a significant part of the network cost is in the cost of the links. A way of increasing the traffic we can send over these expensive links is to transmit compressed ATM cells. This idea, although it seems very simple, is a new one for ATM and in this paper we show that it can significantly increase the bandwidth of a typical ATM network. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contrasting branch characteristics and branch predictor performance of C++ and C programs

    Publication Year: 1999, Page(s):275 - 283
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (919 KB)

    In today's superscalar and superpipelined computers, branch instructions are the main culprits that limit the processor from issuing instructions at a peak rate. Although C++, which is an object-oriented programming language, provides great flexibility to help solve complex programming problems, the cost is a penalty in performance when compared to C. This paper compares the intrinsic branch behav... View full abstract»

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

    Publication Year: 1999, Page(s): 499
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Solving the consensus problem in a mobile environment

    Publication Year: 1999, Page(s):29 - 35
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Atomic broadcast or non-blocking atomic commitment are classic agreement problems encountered when designing fault-tolerant distributed systems. Specific protocols that solve such agreement problems can be designed based on a common building block, namely the consensus service. Unfortunately, the consensus problem has no deterministic solution in an asynchronous distributed system that is subject ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed dynamic channel allocation in mobile networks: combining search and update

    Publication Year: 1999, Page(s):120 - 126
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Distributed dynamic channel allocation techniques are becoming important with the tremendous growth in mobile cellular communication and demand for wireless multimedia applications. These techniques can be categorized as search based or update based. Search based techniques have low messaging complexity and are suited for high system load and low request rates. On the other hand update based schem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space optimal PIF algorithm: self-stabilized with no extra space

    Publication Year: 1999, Page(s):20 - 26
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Recently (1998), we introduced a new self-stabilizing PIF paradigm, called the Propagation of information with Feedback and Cleaning (PFC), for the rooted tree networks. In this paper, we propose the first self-stabilizing PIF scheme for the tree networks without sense of direction-the trees do not have a root and the processors do not maintain any ancestor. The proposed PIF scheme is based on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • POCAT: power control and channel assignment tool for wireless networks

    Publication Year: 1999, Page(s):113 - 119
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    This paper presents a power control and channel assignment tool for wireless network design. It takes the location data of the mobile stations which were generated by a user traffic modeling and simulation tool, computes the operating power levels of the mobile stations, and assigns the mobile stations to the set of base stations with the objective of minimizing the interference. It takes into the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AltiVecTM: bringing vector technology to the PowerPCTM processor family

    Publication Year: 1999, Page(s):437 - 444
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Motorola's AltiVecTM Technology provides a new, SIMD vector extension to the PowerPCTM architecture. AltiVec adds 162 new instructions and a powerful new 128-bit datapath, capable of simultaneously executing up to 16 operations per clock. AltiVec instructions allow parallel operation on either 8, 16 or 32-bit integers, as well as 4 IEEE single-precision floating-point numbers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The most reliable data path transmission

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

    We examine the problem of transmitting a units of data in the most reliable manner along an (s,t) path of a network N=(V,E,c,d,r,s,t). Each edge of a network is assigned a capacity, a delay and a reliability value. In contrast to the similarly defined shortest path problem, it is shown that for this more complex routing problem the subpaths of an optimal path are not necessarily optimal. However, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards the design of a snoopy coprocessor for dynamic software-fault detection

    Publication Year: 1999, Page(s):310 - 317
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Dynamic Monitoring with Integrity Constraints (DynaMICs) is a software-fault monitoring approach in which the constraints are maintained separately from the program. Since the constraints are not entwined in the code, the approach facilitates the maintenance of the application and constraint code. Through code analysis during compilation, the points at which constraint checking should occur are de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error control techniques for wireless ATM networks

    Publication Year: 1999, Page(s):104 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Wireless ATM (Asynchronous Transfer Mode) is an emerging technology where cells are transmitted over wireless channels and part(s) of the connection lies in the wireless network. This introduction of ATM in wireless environment creates many interesting challenges including how to deal with wireless links with possible high and variable error rates. The problem arises as ATM was designed for very l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characteristics of deterministic optimal routing for a simple traffic control problem

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

    This paper deals with a routing problem for a pair of parallel paths connecting a source node and a destination node. The problem is to find the optimal routing that minimizes the average packet delay under the condition that all of the packets' arrival times at the source node as well as all of the packets' sizes are completely deterministic. The numerical solutions of the problem show that the o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalent permutation capabilities between time division optical omega network and non-optical extra stage omega network

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

    Since optical networks must support crosstalk-free (CF) connections, regular N×N multistage interconnection networks (MINs) cannot be directly used to provide connections between N inputs and N outputs. A solution is to use a 2N×2N Cube-Type MIN to provide the N×N connections. C. Qiao (1993) proposed a time domain approach that divides the N optical inputs into several groups suc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput analysis of WDM-based dual-bus local area networks

    Publication Year: 1999, Page(s):426 - 432
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    This paper investigates the possibility of using wavelength division multiplexing to enhance the system capacity of local area networks with the bus topology. We first consider the choice between wavelength fixed and wavelength tunable transceivers based on practical considerations, and we conclude that the use of fixed wavelength transceivers allows one to employ WDM while still using standard in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a single address space operating system for distributed computing and high performance

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

    Recent 64-bit microprocessors have made a huge 18.4 quintillion byte address space potentially available to programs. This has led to the design of Operating Systems that provide a single virtual address space in which all code and data reside in and that spans all levels of storage and all nodes of a distributed system. These operating systems called SASOSs, have characteristics that can be used ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A toolset for assisted formal verification

    Publication Year: 1999, Page(s):489 - 492
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    There has been a growing interest in applying formal methods for functional and performance verification of complex and safety critical designs. Model checking is one of the most common formal verification methodologies utilized in verifying sequential logic due to its automated decision procedures and its ability to provide “counter examples” for debugging. However, model checking has... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing the PCI bus to support real-time streams

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

    In this paper we present an access scheduling scheme for real-time streams (RTS) over the peripheral component interconnect (PCI) bus. We derive a bus model based on the rate monotonic scheduling (RMS) algorithm that guarantees the timing quality of service (QoS) for real-time streams over the PCI bus. The proposed model is valid for constant-bit-rate (CBR) as well as for variable-bit-rate (VBR) s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation evaluation of optimistic replicated filing in mobile environments

    Publication Year: 1999, Page(s):43 - 51
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Optimistic replication of data is becoming increasingly popular in mobile environments, but its performance and scaling characteristics are not well understood. This paper presents a simulation evaluation of optimistic replicated filing in a mobile environment. We first compare full and selective optimistic replication systems to capture the properties required for scaling. We then show that the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session traces: an enhancement to network simulator

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

    This paper discusses a methodology for lifting a sessions trace from a packet trace. The session trace is created from a packet trace by removing many of the physical and network layer control mechanisms from the packet trace. The session trace embodies the true client/server transaction induced on the network link. We show that the session trace is superior to a packet trace for network simulatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a person-based mobility management scheme for PCN

    Publication Year: 1999, Page(s):97 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The concept of person-based number is attractive due to several pressing demands in implementation of current wireless communication systems. Some of these are: sudden proliferation in number of area codes; the need for freedom from number changes due to changes in service provider, location, or area code; and demand for improved and integrated communication service for users. Some important facto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of one prong network restoration algorithms

    Publication Year: 1999, Page(s):210 - 216
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A PowerPC platform full system simulation-from the MOOSE up

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

    Systems simulation is not new. Several instances of varying degrees have appeared over the last few years providing a diverse level of simulation capability. There are also a plethora of simulation kernels and simulation environments available today. Each of these has strengths and weaknesses usually centered around the specific environment to which the simulation is targeted. During the mid-1990s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical routing protocol for large scale ad hoc network

    Publication Year: 1999, Page(s):379 - 385
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The hierarchical network structure significantly reduces the size and maintenance cost of routing table for huge networks. But in ad hoc networks, no fixed host leads to the challenge of the hierarchical structure, since the topology information needs to be updated dynamically due to membership changes caused by mobility. To construct the hierarchical structure of physical locations, we adopt a cl... View full abstract»

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