By Topic

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

Date 7-9 Dec. 2005

Filter Results

Displaying Results 1 - 25 of 90
  • 8th International Symposium on Parallel Architectures,Algorithms and Networks - Cover

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (252 KB)
    Freely Available from IEEE
  • 8th International Symposium on Parallel Architectures,Algorithms and Networks - Title Page

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • 8th International Symposium on Parallel Architectures,Algorithms and Networks - Copyright

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • 8th International Symposium on Parallel Architectures,Algorithms and Networks - Table of contents

    Publication Year: 2005, Page(s):v - xx
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2005, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (91 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference

    Publication Year: 2005, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (113 KB) | HTML iconHTML
    Freely Available from IEEE
  • Robust resource allocations in parallel computing systems: model and heuristics

    Publication Year: 2005
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    The resources in parallel computer systems (including heterogeneous clusters) should be allocated to the computational applications in a way that maximizes some system performance measure. However, allocation decisions and associated performance prediction are often based on estimated values of application and system parameters. The actual values of these parameters may differ from the estimates; ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classic and quantum network coding

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (82 KB) | HTML iconHTML

    Summary form only given. The notion of network coding is often explained by using the butterfly network. In its quantum version, classical channels are replaced by quantum channels with the same capacity. Any unitary operation is allowed at each node. (But note that fan-out is not free in quantum.) From the analogy of the above classical result, the natural attempt is to try sending two quantum bi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clio: a schema mapping tool for information integration

    Publication Year: 2005
    Cited by:  Papers (1)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (74 KB) | HTML iconHTML

    The summary form only given. Information integration typically requires the construction of complex artifacts like federated databases, ETL scripts, data warehouses, applications for accessing multiple data sources, and applications that ingest or publish XML. For many companies, it is one of the most complicated IT tasks they face today. To reduce the overall cost, intelligent tools are needed to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative exon prediction based on heuristic coding region alignment

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Identifying protein coding genes is one of most challenging problems in computational molecular biology. With increasing numbers of sequenced eukaryotic genomes and syntenic maps across species, it is possible to apply genomic comparison for gene recognition. Here, we propose a program, EXONALIGN, which simultaneously aligns and predicts exons between homologous genomic sequences. The program appl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line Time-Constrained Scheduling Problem for the Size on kappa machines

    Publication Year: 2005, Page(s):20 - 24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    In this paper we consider the problem of scheduling online jobs on kappa identical machines. Technically, our system is composed of kappa identical machines and each job is defined by a triplet r = (l,r,p) where l denotes its left border, its right border and p its length. When a job is revealed, it can be rejected or scheduled on one of the kappa machines In this last case, it can suppress alread... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of instruction re-ordering on the correctness of shared-memory programs

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Sequential consistency is an intuitive consistency model that simplifies reasoning about concurrent multiprocessor programs. Most implementations of high-performance multiprocessors, however, utilize mechanisms that al low instructions to execute out of order resulting in consistency models that are weaker than sequential consistency and further complicating the job of programmers. This paper inve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reactive spin-locks: a self-tuning approach

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Reactive spin-lock algorithms that can automatically adapt to contention variation on the lock have received great attention in the field of multiprocessor synchronization, since they can help applications achieve good performance in all possible contention conditions. However, in existing reactive spin-locks the reaction relies on (i) some fixed experimentally tuned thresholds, which may get freq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological properties of necklace networks

    Publication Year: 2005
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    We study a class of interconnection networks for multiprocessors, called the Necklace-G network that is based on the base graph G by attaching an array of processors to each two adjacent nodes of G. One of the interesting features of the proposed topology is its scalability while preserving most of the desirable properties of the underlying base network G. We conduct a general study on the topolog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs

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

    A bipartite graph G is bipancyclic if G has a cycle of length l for every even 4 ≤l≤|V(G)|. For a bipancyclic graph G and any edge e, G is edge-bipancyclic if e lies on a cycle of any even length I of G. In this paper, we show that the bubble-sort graph Bn is bipancyclic for n≥ 4, and also show that it is edge-bipancyclic for n≥5. To obtain this results, we also prove that w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant routing schemes in RDT(2,2,1)/α-based interconnection network for networks-on-chip design

    Publication Year: 2005
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    It has been well recognized that the fault-tolerance capability is vital for a NoC system, since one faulty link/processor may isolate a large fraction of processors. Continuing from a previous paper where a RDT(2,2,1)/α-based interconnection network for NoC designs was proposed, we investigate fault-tolerant routing schemes on NoC systems featuring a RDT-based interconnection network. In pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On some combinatorial properties of the star graph

    Publication Year: 2005
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    The star graph, as an interesting network topology, has been extensively studied in the past. In this paper, we address some of the combinatorial properties of the star graph. In particular, we consider the problem of calculating the surface area of the star graph, answering an open problem previously posed in (K. Qiu et al., 1995). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An enhanced application-level multicast protocol: a QoS perspective

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Ubicast, an enhanced application-level multicast protocol, is presented in this paper. It is built upon Pastry, a robust and self-organizing peer-to-peer substrate overlay, and leverages its merits of reliable application-level routing and object location. Ubicast is mainly applied to real-time multimedia applications with QoS heterogeneity. It tries to minimize the delay radius of the multicast t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient distributed algorithm for constructing delay- and degree-bounded application-level multicast tree

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    In this paper we investigate the problem of finding a delay- and degree-bounded maximum sum of nodes application level multicast tree. We then proved the problem is NP-hard, and its relationship with the well-studied degree-bounded minimum maximum-delay multicast tree problem. We propose a distributed algorithm - OverStream, which adopts PPAF heuristic for father node to choose optimal child nodes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design issues of a novel toolkit for parallel application performance monitoring and analysis in cluster and grid environments

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3992 KB) | HTML iconHTML

    The low-cost and availability of network of workstations have made them attractive solution for high performance computing. Striking progress of network technology in enabling high-performance global computing, with the utilization of cluster and grid technologies, in which computational and data resources in a local or wide area network are transparently employed to solve large-scale problems. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-cost high-bandwidth tree network for PC clusters based on tagged-VLAN technology

    Publication Year: 2005
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    In the present paper, we propose a practical and feasible method to construct VLAN-based fat tree network that provides wide bisection bandwidth on a tree network constructed with cheap Layer-2 Gigabit Ethernet switches for high-performance PC clusters. The proposed method provides a complete flat IP address space with multiple upper-level links and switches to configure a fat tree based on simple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A better algorithm for uniform metrical task systems with few states

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    We give a randomized algorithm (the "Wedge Algorithm") of competitiveness for any metrical task system on a uniform space of k points. This algorithm has better competitiveness than the Irani-Seiden algorithm if k is smaller than 108. The algorithm is better by a factor of 2 if k < 47. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • External double hashing with choice

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB) | HTML iconHTML

    A novel extension to external double hashing providing significant reduction to both successful and unsuccessful search lengths is presented. The experimental and analytical results demonstrate the reductions possible. This method does not restrict the hashing table configuration parameters and utilizes very little additional storage space per bucket. The runtime performance for insertion is sligh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An online partially fractional knapsack problem

    Publication Year: 2005
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    The knapsack problem can and has been used to model many resource sharing problems. The allocation of a portion of a resource to a particular agent provides a benefit to the system, but also blocks other agents from utilizing that portion of the resource. For a problem where the number of agents as well as each agent's demand and potential benefit are known prior to any decision being made, the op... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transshipment and time windows in vehicle routing

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Transshipment problems and vehicle routing problems with time windows (VRPTW) are common network flow problems and well studied. Combinations of both are known as intermodal transportation problems. This concept describes some real world transportation problems more precisely and can lead to better solutions. But they are examined rarely as mathematical optimization problems. In this paper two app... View full abstract»

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