By Topic

Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001

29-29 June 2001

Filter Results

Displaying Results 1 - 25 of 107
  • Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (433 KB)
    Freely Available from IEEE
  • A scalable yet transparent infrastructure for distributed applications: core design of Jasmine ii framework

    Publication Year: 2001, Page(s):31 - 36
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (661 KB) | HTML iconHTML

    At the beginning of the new millennium we continue to witness in the modern information technology industry two fundamental trends: ongoing Internet revolution and global consolidation. IT departments of all kinds have their resources free to deal with the consequences of these phenomena. Integration of data and services is rapidly becoming their number one task. Information stored in different ty... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load-balancing in a data parallel object-oriented system

    Publication Year: 2001, Page(s):279 - 286
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (665 KB) | HTML iconHTML

    In this paper, a parallel object collection (POC) model is introduced to support data parallelism in a parallel object-oriented system. This model is based on the idea of data partitioning and method replication. To achieve load-balancing, partition objects are dynamically migrated at runtime according to the system load situation. A threshold-based strategy is used in the dynamic load-balancing. ... View full abstract»

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

    Publication Year: 2001, Page(s):789 - 792
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • Tightening of cell discarding method in RED for improving TCP over ATM network

    Publication Year: 2001, Page(s):588 - 591
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    TCP suffers from low performance over Asynchronous Transfer Mode networks. This is mainly because during the phase of congestion, ATM drops cells without taking into account the effect this has on the upper layer protocols. We propose an enhancement of the cell discarding method in the RED algorithm supporting TCP over ATM traffic with an UBR service. We call this method TCD-RED (tightening of cel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the performance of TCP Vegas in a heterogeneous environment

    Publication Year: 2001, Page(s):581 - 587
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    Many results indicate that TCP Vegas exhibits better throughput and higher stability than TCP Reno in homogeneous cases where a single version exists, but it performs poorly in heterogeneous cases where two versions coexist. Hence users are delaying, even protesting, the adoption of TCP Vegas. The difference in performance is due to the fact that Reno vibrates in the high throughput level and Vega... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ethernet Wrapper: extension of the TCP Wrapper

    Publication Year: 2001, Page(s):573 - 580
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB) | HTML iconHTML

    One of the popular network security programs supporting host access control is the `TCP Wrapper' (Venema, 1992). TCP Wrapper is a software-only system and many computers connected to the Internet are using it. However, TCP Wrapper does `IP address-based' access control. The IP address is not such a reliable source when authenticating a host. We point out two possible attacks against the TCP Wrappe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A server framework for scheduling multimedia applications in open system environment

    Publication Year: 2001, Page(s):562 - 569
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    We propose methods for scheduling multimedia soft real-time tasks in an open system environment. We discuss two issues, guaranteeing the schedulability of every task in the application and meeting the QoS of multimedia soft real-time tasks. First, when a real-time application is composed of a heterogeneous task set, hard real-time tasks and multimedia soft real-time tasks, the operating system mus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of artificial life based optimization system

    Publication Year: 2001, Page(s):429 - 436
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    Describes the computer middleware called the Hyper Artificial Life (HAL) optimization system, which is based on artificial life theories and which is effective for almost all kinds of combinatorial optimization problems in our actual world. This middleware aids the efficient development of parallel processing of an application program for combinatorial optimization problems by adopting a conventio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic voltage scaling on MPEG decoding

    Publication Year: 2001, Page(s):633 - 640
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    A number of research efforts have been devoted to reduce energy consumption of a processor without impacting the performance through the use of dynamic voltage scaling (DVS). The paper presents two DVS algorithms on MPEG decoding. One is DVS with delay and drop rate minimizing algorithm (DVS-DM) where voltage is determined based on previous workload only. Another algorithm scales the supply voltag... View full abstract»

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

    Publication Year: 2001, Page(s):525 - 532
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB) | HTML iconHTML

    An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2n n-dimensional hypercubes. The diameter of an HCN(n), which is equal to n+[(n+1)/3]+1, is about two-thirds the diameter of a comparable hypercube, although it uses about half as many links per node. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of an HCN(n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric scheduling of 2-D uniform dependence loops

    Publication Year: 2001, Page(s):259 - 264
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this work, the problem of scheduling using wavefront prediction is presented. The geometric concepts of time instance subspaces and execution pattern are introduced. A quite simple and low complexity scheduling algorithm is presented. The index ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multicast delivery scheme for VCR operations in a large VOD system

    Publication Year: 2001, Page(s):555 - 561
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB) | HTML iconHTML

    Multicast transmission is one of the solutions to reduce the cost in large VOD systems. However, it is difficult to implement the interactive operations for an individual user in a multicast transmission system. We propose a frame based multicast transmission scheme to serve a large number of users and reduce additional channels while supporting VCR operations. This scheme supports both normal pla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and distributed mining with ensemble self-generating neural networks

    Publication Year: 2001, Page(s):423 - 428
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    In this paper, we present the improving capability of accuracy and the parallel efficiency of ensemble self-generating neural networks (ESGNNs) for classification on a MIMD parallel computer. Self-generating neural networks (SGNNs) are originally proposed for classification or clustering by automatically constructing self-generating neural tree (SGNT) from given training data. ESGNNs are composed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS-based method for compensating multimedia objects

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

    Distributed applications are manipulating multiple multimedia objects. QoS of an object is manipulated in addition to the state of the object. After objects are manipulated, they may need to be rolled back in order to undo the manipulation. It is not easy to take a checkpoint of the object because the state is larger and the data structure is more complex than traditional data. We discuss an appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiphase minimal fault-tolerant wormhole routing in 2D meshes

    Publication Year: 2001, Page(s):323 - 330
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB) | HTML iconHTML

    A fault-tolerant wormhole routing algorithm using multiphase minimal routing paths for mesh networks is proposed in this paper. When routing messages come in contact with a fault region, they always select a local shortest path around the fault-region in clockwise or counter clockwise direction. The proposed algorithm can tolerate convex fault-connected regions with four virtual channels per physi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On some properties of k-ary n-cubes

    Publication Year: 2001, Page(s):517 - 524
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB) | HTML iconHTML

    The k-ary n-cube has been used as the underlying topology for most practical multicomputers, and has been extensively studied in the past. We investigate some properties of this network. In particular, we study the problem of finding the number of nodes located i hops away from a given node (surface area) and the number of nodes located within i hops away from a given node (volume) in both the uni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal data reduction on reconfigurable tori

    Publication Year: 2001, Page(s):249 - 256
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB) | HTML iconHTML

    Data reduction is a fundamental operation of parallel computing. We derive lower bounds on communication latency for global data reduction and multiple global data reduction on reconfigurable tori. We present optimal global data reduction algorithms and multiple global data reduction algorithms on reconfigurable tori of any dimension. The formal reduction algorithms we give can make reduction and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic update of aggregated routing information for hierarchical QoS routing in ATM networks

    Publication Year: 2001, Page(s):653 - 660
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    For achieving scalable and QoS-ware in large ATM networks, the ATM Private Network-to-Network Interface (PNNI) adopts hierarchical routing which reduces nodal and link information. In order to perform hierarchical routing efficiently, the network will consist of subnetworks, called peer groups, and peer groups will advertise the aggregated information periodically which is based on the time-based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schemes for utilizing efficiently disk bandwidth and buffer in video server

    Publication Year: 2001, Page(s):549 - 554
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB) | HTML iconHTML

    A video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. For this purpose, the storage system of the video server needs a large disk bandwidth and buffer capacity. However, because the given disk bandwidth and buffer capacity are limited, technologies that utilize effectively the given disk bandwidth and buffer capacit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the performance of broadcasting in ad hoc wireless networks

    Publication Year: 2001, Page(s):69 - 74
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    Broadcasting is an often seen operation in the wireless network environment. In an ad hoc wireless network, because of the mobility of each host, it is not an easy job for every mobile host to receive the broadcast message. Applications such as current time synchronisation, paging, finding the route to a particular destination, etc., all need to broadcast frequently. A simple broadcasting strategy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Membership: a partition model for reliable mobile communication

    Publication Year: 2001, Page(s):45 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB) | HTML iconHTML

    We give a formal specification of a new model called Network Membership for reliable mobile communication in asynchronous distributed systems. Our approach is new in the sense that the Network Membership service does not have any join or leave procedures. We let the system flow, views are not forced and are installed with stability. The model is less restrictive than others since no consensus is r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An active scheduler: autonomous concurrency control of parallel programs in a distributed environment

    Publication Year: 2001, Page(s):415 - 422
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB) | HTML iconHTML

    We propose a new scheduling method that can simultaneously achieve two main goals of task scheduling in distributed parallel systems; i.e., to minimize the execution time of a parallel job without disturbing the execution of other jobs. We challenge to achieve those goals by introducing a new scheduler, called active scheduler, that controls the priority of parallel programs dynamically and balanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic expression for extra degree added to hypercube interconnection network in case of multiple edge-faults

    Publication Year: 2001, Page(s):621 - 624
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    Researchers have used more than one method for implementing algorithms on faulty hypercube interconnection networks. Some modified the structures of the hypercube whilst others didn't, implementing their operations on a faulty hypercube. Modifying the structure of a hypercube entails adding extra degrees to each node, called reconfiguration of hypercubes. I improved an algebraic expression for add... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant routing and disjoint paths in dual-cube: a new interconnection network

    Publication Year: 2001, Page(s):315 - 322
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r l... View full abstract»

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