Scheduled Maintenance on May 23rd, 2017:
IEEE Xplore will undergo an upgrade from 1:00 - 4:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

1997 IEEE International Performance, Computing and Communications Conference

5-7 Feb. 1997

Filter Results

Displaying Results 1 - 25 of 75
  • IEEE international performance, computing and communications conference

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (380 KB)
    Freely Available from IEEE
  • Fault-tolerant hierarchical routing

    Publication Year: 1997, Page(s):159 - 165
    Cited by:  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (673 KB)

    This paper presents a self-stabilizing, fault-tolerant hierarchical routing algorithm. Hierarchical routing algorithms are less expensive algorithm than traditional all-pairs routing algorithms (i.e., lower memory requirements, faster routing table lookups, and less costly broadcast). The algorithm presented here retains these benefits yet, maintains routing capability between all pairs of connect... View full abstract»

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

    Publication Year: 1997, Page(s): 579
    Request permission for commercial reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • A general repeated snapshot algorithm

    Publication Year: 1997, Page(s):146 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Snapshot algorithms are fundamental for many distributed applications. This paper presents a repeated snapshot algorithm for non-FIFO asynchronous distributed systems. The algorithm attaches numbers of snapshot to messages, uses token passing and needs little space on each process. Its message complexity of control messages for one snapshot is O(n). Using this algorithm, processes can get consiste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voting without version numbers

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

    Voting protocols are widely used to provide mutual exclusion in distributed systems and to guarantee the consistency of replicated data in the presence of network partitions. Unfortunately, the most efficient voting protocols require fairly complex metadata to assert which replicas are up-to-date and to denote the replicas that belong to that set. We present a much simpler technique that does not ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Osculant: a multiprocessor self-organizing task scheduler

    Publication Year: 1997, Page(s):35 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The world of computing is rapidly changing. One model states that in the future a variety of mobile and/or relocatable computational assets will be rapidly configured and synergistically linked together to achieve a desired outcome. From a logistical viewpoint, these assets will be a collection of interconnected heterogeneous resources ranging possibly high-end platforms to simple man portable sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Euler-path-based multicasting model for wormhole-routed networks: its applications to damaged 2D Tori and meshes

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

    We develop a new multicasting model for wormhole-routed networks based on the concept of Euler path in graph theory. The model can support multiple multicasts freely from deadlock and can be applied to any network which is Eulerian or is Eulerian after some links being removed. We demonstrate the power of this model by showing its fault-tolerant capability in supporting multicasting in a damaged 2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance studies of routing schemes for packet switched augmented shuffle exchange network

    Publication Year: 1997, Page(s):49 - 56
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    This paper presents a simulation study to compare the performance of four different routing schemes for a internally buffered packet switched fault-tolerant augmented shuffle exchange network. The performance is measured in terms of throughput and delay for uniform and non-uniform traffic patterns under fault-free and faulty environments. The simulation results indicate that the “look ahead&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monitoring-based flow control for reliable multicast protocols and its evaluation

    Publication Year: 1997, Page(s):403 - 409
    Cited by:  Papers (2)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    A reliable multicast protocol distributing multimedia data such as software, electronic newspapers, and books without errors to a large number of users on the network is highly desirable. This paper presents a new flow control method that makes such a protocol feasible in real environments wherein receiver functions may degrade and/or network quality may deteriorate. The method involves rate-based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm for constructing an Eulerian tour

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

    We present an efficient distributed algorithm for constructing an Eulerian tour in a network. To construct an Eulerian circuit the algorithm requires (1+r)(|E||V|) messages and time units, where |E| is the number of the communication links, |V| is the number of the nodes in the underlying network graph, and 0⩽r<1. The value of r depends on the network topology and on the chosen traversal pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MPEG VBR slice layer model using linear predictive coding and generalized periodic Markov chains

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

    We present an MPEG slice layer model for VBR encoded video using linear predictive coding (LPC) and generalized periodic Markov chains. Each slice position within an MPEG frame is modeled using an LPC autoregressive function. The selection of the particular LPC function is governed by a generalized periodic Markov chain; one chain is defined for each I, P, and B frame type. The model is sufficient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of shared-buffer ATM switches under self-similar traffic

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

    Self-similar (or fractal) is a relatively new concept in traffic modeling that needs to be taken into account in the design and performance evaluation of communication networks. Many studies indicate that self-similar traffic exhibits features such as long-range-dependence and heavy-tailed distributions which are not found in current traffic assumptions. Thus previous results that draw on those as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A case study of authenticated and secure file transfer: the Iowa Campaign Finance Reporting System (ICFRS)

    Publication Year: 1997, Page(s):532 - 538
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The Iowa Campaign Finance Disclosure project (ICFD) is a pilot effort to develop a simple and secure way for candidates running for public office or Political Action Committees (PACs) to disclose required financial information. In the prototype system described in this paper, a candidate or PAC can transmit information to the Iowa Ethics and Campaign Disclosure Board (IECDB) in the state capitol u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of routing concurrent traffic in capacitated multistage networks

    Publication Year: 1997, Page(s):221 - 227
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    This paper examines the complexity of a fundamental traffic routing problem that arises in the design of routing algorithms based on packing a given set of traffic requirements into a few number of passes through a given multistage interconnection network. Two classes of networks are considered: 3-stage networks, and a generalized class of extra-stage indirect binary n-cube networks. For the forme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On predictability and optimization of multiprogrammed caches for real-time applications

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

    For almost two decades caches have been used in conventional computers for better system performance. The performance of cache memory is measured by its hit ratio, which is a probabilistic measure on the percent of memory accesses that can be intercepted by the cache memory to reduce the average memory access time. Despite its effectiveness, the impact of the “probabilistically” reduce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of the ISO class 0 transport protocol: a stepwise refinement based approach

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

    We present the design steps of the ISO Class 0 transport protocol. We apply, for this purpose our protocol synthesis algorithm. This algorithm is based on stepwise refinement of specifications written in an interpreted Petri net model. The starting point for the design is the specification of the ISO transport service. The main advantage of this design strategy is that the correctness of the desig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of coder/decoder reliability on bit error rate performance of wireless communication systems

    Publication Year: 1997, Page(s):117 - 124
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    This paper examines the effect of coder/decoder circuitry failures on the overall performance of a digital wireless information network. A complete system analysis of the error correcting coding scheme performance must include an evaluation of the reliability of the coder/decoder circuitry because their failures also serve as a source of undetected errors. Included in this study are the parity bit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance implications of the PowerPC architecture's hashed page table utilization in Windows NT

    Publication Year: 1997, Page(s):315 - 320
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    Windows NTTM is a portable operating system, and as such has an abstracted view of the underlying processor architecture. One of the most processor-specific portions of an operating system is the management of virtual memory, and NT is no different in this respect. NT abstracts the processor-specific address translation mechanism and manages it as a translation lookaside buffer (TLB). T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing in distributed shared memory systems

    Publication Year: 1997, Page(s):152 - 158
    Cited by:  Papers (5)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    Despite the fast evolution of Distributed Shared Memory (DSM) systems, the load balance problem has not received enough attentions. This problem arises naturally after multithreading was introduced to DSM systems few years ago. The cognizance of it would bring us a significant improvement in system performance. In this paper, we address it by proposing and experimentally evaluating a load balancin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coplanar bus model validation using test board and high speed CMOS driver

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

    Test vehicles consisting of a special arrangement of test boards each mounted with high speed CMOS drivers were prepared for validation of a high speed coplanar bus model. Actual wave delay and deformation through several lines were measured and compared with those in a coplanar line, a stand alone line and a microstrip line. The coplanar bus line was superior to even a microstrip line with a grou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advanced alterable pipeline timer (adapt): a tool to design a high performance PowerPCTM microprocessor

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

    The microprocessor discussed in this paper is a member of the G3 family of PowerPC processors, the third generation of PowerPC microprocessor products. It provides the performance levels required for high end desktop systems while offering the low typical power dissipation and small die size that make it very attractive for portable systems. It is an advanced superscalar design with six execution ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully non-blocking reliable multicast protocol with total ordering

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

    We present an efficient protocol for reliable multicast in an asynchronous network subject to link and process failures. Our protocol preserves total ordering in the sense that as processes or communication links become faulty, each group of non-faulty processes that remain connected will agree on the same sequence of messages delivered. Even processes that get disconnected deliver messages in a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A frequency steered phase locked loop

    Publication Year: 1997, Page(s):76 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Voltage controlled oscillators (VCOs) implemented in digital VLSI IC (integrated circuit) technology typically have very poorly controlled centre frequencies and poor phase noise characteristics, thus severely limiting their use in phase locked loop (PLL) applications. The new technique presented incorporates an accurate local reference frequency into the PLL structure. The key parameters of the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting end-to-end deadlines for soft real-time multimedia applications

    Publication Year: 1997, Page(s):395 - 402
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    With the emergence of multimedia technology, soft real-time applications have assumed increasing importance. Such applications require proper scheduling support for meeting their deadlines. It is often the case that such deadlines have to be met on an end-do-end basis since the applications require processing at multiple resources. We present an algorithm to schedule such tasks in a resource-share... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of multithreading and scheduling on client-server systems

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

    Two approaches to the improvement of the performance of client-server systems, multithreading and scheduling of servers, are investigated. Both of these approaches are observed to have a significant impact on system performance. The use of multithreading improves throughput characteristics of systems whereas the deployment of appropriate scheduling strategies at servers can produce a significant i... View full abstract»

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