Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000

7-9 Dec. 2000

Filter Results

Displaying Results 1 - 25 of 42
  • Proceedings International Symposium On Parallel Architectures, Algorithms And Networks [front matter]

    Publication Year: 2000, Page(s):i - vii
    Request permission for commercial reuse | PDF file iconPDF (223 KB)
    Freely Available from IEEE
  • Parallel real-time computation: sometimes quantity means quality

    Publication Year: 2000, Page(s):2 - 11
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1180 KB)

    We show that within the paradigm of real time computation, some classes of problems have the property that a solution to a problem in the class, when computed in parallel, is far superior in quality than the best one obtained on a sequential computer. Examples from these classes are presented. In each case, the solution obtained in parallel is significantly, provably, and consistently better than ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (590 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2000, Page(s): 297
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • The minimum spanner problem on butterfly graphs

    Publication Year: 2000, Page(s):210 - 215
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    Given a connected graph G, a spanning subgraph G' of G is called a t-spanner if every pair of two adjacent vertices in G has a distance of at most t in G'. A t-spanner of a graph G is minimum if it contains minimum number of edges among all t-spanners of G. Finding minimum spanners for general graphs is rather difficult. Most of the previous results were obtained for some particular graphs, e.g., ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parametrically described regular semigroup interconnection networks for large-scale multicomputers

    Publication Year: 2000, Page(s):202 - 209
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    We propose a new topology for multicomputer networks: parametrically described, regular, and based on semigroups (PRS) networks (or Rs(N, v, g) graphs with the order N, the degree v, the girth g, and the number of equivalence classes s). Many classes of networks such as hypercubes, circulants, cube-connected cycles, etc. are shown to be special cases of the proposed network. We explore ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal location of high-speed facility in heterogeneous networks

    Publication Year: 2000, Page(s):246 - 251
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    This paper discuss a problem of locating a facility on tree networks. The facility takes the form of a path- or a tree-shaped subgraph on the network To construct efficient network, we must set the facility to optimal location. In this paper, we propose new evaluation function, all-pair distancesum, which is the sum of distance of all pairs of nodes on the network. Then we show some characteristic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical 3D-torus interconnection network

    Publication Year: 2000, Page(s):50 - 56
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    Three dimensional (3D) stacked implementation has been proposed as a new technology for massively parallel computers. However, two major limitations have hindered the progress in this direction: the technology of vertical interconnects and the cost in terms of area for these vertical interconnects. Each vertical interconnect requires 300 μm×300 μm area, thus liberal is prohibited. Clea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pipelining router design improves parallel system performance

    Publication Year: 2000, Page(s):195 - 200
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Efficient communication on fetching remote data is a critical parameter in distributed shared-memory multiprocessors (DSM) in order to achieve high performance. Message passing techniques are used in many modern communication systems and routers are essential building blocks for these communication systems. Hence, in this paper emphasis is placed on the design of routers for 2-ary n-cube networks.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel algorithms for multi-dimensional matrix operations

    Publication Year: 2000, Page(s):224 - 229
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Matrix operations are the core of many linear systems. Efficient matrix multiplication is critical to many numerical applications, such as climate modeling, molecular dynamics, computational fluid dynamics and etc. Much research work has been done to improve the performance of matrix operations. However, the majority of these works is focused on two-dimensional (2D) matrix. Very little research wo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Super recursive baselines: a family of new interconnection networks with high performance/cost ratios

    Publication Year: 2000, Page(s):260 - 265
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    Under the current condition of the VLSI technique, 8×8 switches used in MINs have the best performance/cost ratios. Based on Delta network, Baseline network and current VLSI technique development level, this paper puts forward the idea of a new family of MINs using 8×8 switches which is called Super Recursive Baseline Interconnection Network (SRB), expounds its network topological Prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Environment for multiprocessor simulator development

    Publication Year: 2000, Page(s):64 - 71
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Performance estimation is essential for designing and investigating new architectures including multiprocessors. Software simulation is one of the most common methods, since there is no limitation on device technology nor hardware configuration. Although lots of software simulators have been developed and used, they must be modified for each distinct target system. For designers of new architectur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaborative and interactive room design on the web

    Publication Year: 2000, Page(s):238 - 245
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    Design on the Web raises challenging questions concerning how users interact with objects, applications, and other users. In this work, we propose a collaborative and interactive client-server design framework and implement a room design system for our study. We have integrated technologies used in distributed computation (Java and CORBA) and computer graphics (VRML). It divides the design process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcasting multiple messages in hypercubes

    Publication Year: 2000, Page(s):274 - 281
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We investigate Tm(Qd), the time required to broadcast m⩾1 messages in a d-dimensional hypercube under the telephone model. We give exact values for Tm(Qd) for m⩽2d-1 and for m⩾2d+1. For 2d-1 +1⩽m⩽2d, we produce an upper bound which is 1 larger than the lower bound. One consequence of our res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Competitive analysis of on-line algorithms for on-demand data broadcast scheduling

    Publication Year: 2000, Page(s):292 - 296
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    We consider a communication problem, in which requests for data items arrive from time to time via a terrestrial network and at each broadcast tick the single server chooses a data item to broadcast via a satellite downlink to satisfy all the requests for the item. The goal of the server to minimize the total wait time of the requests. In this paper, we examine two well-known on-line algorithms us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the effect of link failures in fibre channel storage area networks

    Publication Year: 2000, Page(s):102 - 111
    Cited by:  Papers (4)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    The fast growth of data intensive applications has caused a change in the traditional storage model. The server-to-disk approach is being replaced by storage area networks (SANs), which enable storage to be externalized from servers, thus allowing storage devices to be shared among multiple servers. The prominent technology for implementing SANs is Fibre Channel, due to its suitability for storage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system for efficiently self-reconstructing E-1½ track switch torus arrays

    Publication Year: 2000, Page(s):44 - 49
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    A mesh-connected processor array consists of many similar processing elements (PEs), which can be executed in both parallel and pipeline processing. For the implementation of an array of large numbers of processors, it is necessary to consider some fault tolerant issues to enhance the (fabrication-time) yield and the (run-time) reliability. We introduce the E-1½-TS torus array ray model and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An accurate analysis of reliability parameters in meshes with fault-tolerant adaptive routing

    Publication Year: 2000, Page(s):88 - 93
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The traditional approach to study fault-tolerance in multicomputer interconnection networks consists of determining the worst possible combination of faulty components that causes a network failure, and then assuming that this will occur. But the worst possible combination does not always occur, and the routing algorithm allows the network to work in the presence of a greater number of failures. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal one-to-many disjoint paths in folded hypercubes

    Publication Year: 2000, Page(s):148 - 153
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Routing functions have been shown to be effective in deriving disjoint paths in the hypercube. In this paper, by the aid of a minimal routing function, k+1 disjoint paths from one node to another k+1 distinct nodes are constructed in the folded hypercube whose maximal length is not greater than [k/2]+1, where k is the dimension and [k/2] is the diameter of the folded hypercube. The maximal length ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-the-fly sending: a low latency high bandwidth message transfer mechanism

    Publication Year: 2000, Page(s):186 - 193
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Low latency high bandwidth network interface architectures are described. This paper proposes two types of architectures, atomic on-the-fly (OTF) sending with a header TLB, and block on-the-fly sending with protection stampable window memory. These techniques work very effectively with MEMOnet which is a class of network interface card (NIC) plugged into a memory slot. We are developing a network ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User level communication on Alpha Linux systems

    Publication Year: 2000, Page(s):36 - 41
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Recent advances in commodity network interface technology enable scientists and engineers to build clusters of workstations or PCs to execute parallel applications. However, raw-hardware network performance is rarely delivered to applications because of the overheads of communication software and operating systems. To reduce these overheads, a technique called user-level communication can be used ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelength assignment in WDM rings with splitable lightpaths

    Publication Year: 2000, Page(s):216 - 221
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    This paper presents a new practical approximation algorithm for wavelength assignment to splitable lightpaths over WDM (wavelength division multiplexing) rings, with the objective of minimizing the number of SONET ADMs (add-drop multiplexers). Allowing the splitting of traffic streams can significantly reduce the number of required ADMs. Moreover, while finding the best assignment is proved to be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiprocessor scheduling problem with probabilistic execution costs

    Publication Year: 2000, Page(s):121 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    In this paper, we propose a method for tolerating an inaccuracy of the estimated execution cost of tasks that is usually assumed to be accurate in static multiprocessor scheduling algorithms. In the proposed method, tasks are assigned onto processors in such a way to minimize the maximum expected execution cost rather than the worst case or best case execution costs. A detailed analysis of the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel processor architecture for prefetching

    Publication Year: 2000, Page(s):254 - 259
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Prefetching brings data into the cache before it is expected by the processor, thereby eliminating a potential cache miss. There are two major prefetching schemes. In a software scheme, the compiler predicts the memory access pattern and places prefetch instructions into the code. In a hardware scheme the hardware predicts the memory access pattern and brings data into the cache before required by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the diameter of the generalized de Bruijn graphs UGB(n, n2+1)

    Publication Year: 2000, Page(s):57 - 61
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    The generalized de Bruijn graph UGB(n, n2+1) is the graph with vertex set V={0, 1, ..., n2} and the neighborhood N(i) of i∈V is N(i)=X(i)∩Y(i) where X(i)={in+d(modn2+1):α∈D and [(2i-αn)+(n2+1)Z]∩D=Ø}, Y(i)={(β-i)n(modn2+1):β∈D and [(β-2i)n+(n 2+1)Z]∩D=Ø}.... View full abstract»

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