By Topic

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date 10-12 May 2004

Filter Results

Displaying Results 1 - 25 of 112
  • Optimal adaptive fault diagnosis of cubic Hamiltonian graphs

    Publication Year: 2004, Page(s):162 - 167
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1372 KB) | HTML iconHTML

    We study the problem of adaptive fault diagnosis for multiprocessor systems modeled by cubic Hamiltonian graphs. Each node in a system is either faulty or fault-free, and the aim of fault diagnosis is to identify correctly faulty/fault-free status of all nodes. In order to achieve it, each node tests their neighbors and output the results of tests. If the test node is fault-free, it always outputs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing sequentially consistent programs on processor consistent platforms

    Publication Year: 2004, Page(s):326 - 331
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1373 KB) | HTML iconHTML

    This paper investigates the existence of compilers to convert programs that use shared read/write variables, with sequentially consistent memory semantics, to programs that use read/write variables with the semantics of one variant of processor consistency, known as PC-G. We first provide a simple program transformation, and prove that it compiles any 2-process program with only single-writer vari... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ring embedding in faulty augmented cubes

    Publication Year: 2004, Page(s):155 - 160
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1388 KB) | HTML iconHTML

    In this paper, we consider the fault hamiltonicity and the fault Hamiltonian connectivity of the augmented cubes AQn. Assume that F ⊆ V(AQn) ∪ E(AQn) and n ≥ 4. We prove that AQn - F is Hamiltonian if |F| ≤ 2n-3 and that AQn - F is Hamiltonian connected if |F| ≤ 2n - 4. Moreover, these bounds are tight. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deeper study on segment shared protection

    Publication Year: 2004, Page(s):319 - 325
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1432 KB) | HTML iconHTML

    This paper studies the survivable routing problem for segment shared protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the integer linear program (ILP) formulation for SSP by additionally considering the constraint on the restoration time for each connection request and the switching/mergi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fault tolerance of 3-dimensional mesh networks

    Publication Year: 2004, Page(s):149 - 154
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1366 KB) | HTML iconHTML

    In this paper, we study the fault tolerance of 3D mesh networks under a more realistic model in which each network node has an independent failure probability. We develop a novel technique to formally derive lower bounds on the connectivity probability for 3D mesh networks. Our study shows that 3D mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three-layered mediator architecture based on DHT

    Publication Year: 2004, Page(s):313 - 318
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1350 KB) | HTML iconHTML

    The interchange of data between client and heterogeneous sources requires an efficient and dynamic approach to mediation. Our framework features three layers of mediators: presence, integration, and homogenization. On arrival of a request for data exchange, a session initiation server forks to the mediator group to elect one mediator as global presence mediator that is responsible for data caching... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining and knowledge discovery from the Web

    Publication Year: 2004, Page(s):4 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1594 KB) | HTML iconHTML

    The World Wide Web presents an interesting opportunity for data mining and knowledge discovery, and this area is growing rapidly as both a research topic and a business activity. In this survey we describe some of the problems that are addressed, and elements of the WebFountain infrastructure that we have built for addressing them. Our focus here is on describing some of the lessons learned and so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing in dynamic networks

    Publication Year: 2004, Page(s):193 - 200
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1559 KB) | HTML iconHTML

    Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area mainly focused on static networks. However, observations show that diffusive algorithms, originally designed for these networks, can also be applied in nonstatic scenarios. In this paper we prove that the general diffusion scheme can be deployed on dynamic networks and show tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Particle swarm optimization algorithm in signal detection and blind extraction

    Publication Year: 2004, Page(s):37 - 41
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1353 KB) | HTML iconHTML

    The particle swarm optimization (PSO) algorithm, which originated as a simulation of a simplified social system, is an evolutionary computation technique. In this paper the binary and real-valued versions of PSO algorithm are exploited in two important signal processing paradigm: multiuser detection (MUD) and blind extraction of sources (BES), respectively. The novel approaches are effective and e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive fault-tolerant wormhole routing with two virtual channels in 2D meshes

    Publication Year: 2004, Page(s):142 - 148
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1461 KB) | HTML iconHTML

    An adaptive fault-tolerant wormhole routing algorithm based on a convex fault model in 2D meshes is presented. With the algorithm, a normal routing message, when blocked by faulty processors, would detour along some special polygons around the fault region. The result is that the proposed algorithm can tolerate convex faults with only two virtual channels per physical channel regardless of the ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge states for the caching problem in shared memory multiprocessor systems

    Publication Year: 2004, Page(s):307 - 312
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1447 KB) | HTML iconHTML

    Multiprocessor systems with a global shared memory provide logically uniform data access. To hide latencies when accessing global memory each processor makes use of a private cache. Several copies of a data item may exist concurrently in the system. To guarantee consistency when updating an item a processor must invalidate copies of the item in other private caches. To exclude the effect of classi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolution of interconnection networks: the impact on the of parallel algorithms

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

    Summary form only given. In the design of parallel algorithms, especially those involve various collective communication patterns, such as various types of one-to-all, all-to-one, and all-to-all communications, the underlying communication technology plays a vital role in determining the communication efficiency of these algorithms. We have repeatedly investigated the same problem, e.g., broadcast... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new method for independent task scheduling in nonlinearly DAG clustering

    Publication Year: 2004, Page(s):187 - 192
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1350 KB) | HTML iconHTML

    For the parallel tasks represented by the directed acyclic graph (DAG), if it is linearly clustered, the ordering of the execution time of the tasks in each cluster is based on their arrows in the DAG. But for nonlinearly clustering, the ordering of the independent tasks in each cluster is not easily decided. Improper ordering of these independent tasks will greatly increase the scheduling length ... View full abstract»

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

    Publication Year: 2004, Page(s):351 - 356
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1353 KB) | HTML iconHTML

    The emergence of the next generation Internet (NGI) is mainly oriented toward a series of serious challenges that cannot be solved through limited improvement under the current network architecture. Therefore NGI means a series of revolutionary changes including the architecture. The fundamental concept of NGI is illustrated and the current situation of the development of NGI is comprehensively di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical routing and torus assignment for RDT

    Publication Year: 2004, Page(s):30 - 35
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1406 KB) | HTML iconHTML

    The connection topology of interconnection networks and the routing algorithm often dominate system performance in MPCs. RDT has already been proved to be one of the best interconnection networks used in such systems. It supports a smaller diameter and degree than most at the size of one thousand to tens of thousands nodes. The floating vector routing algorithm is very effective for transferring m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checkpointing in hybrid distributed systems

    Publication Year: 2004, Page(s):136 - 141
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1407 KB) | HTML iconHTML

    To provide fault tolerance to computer systems suffering from transient faults, checkpointing and rollback recovery is widely-used. Among other techniques, two primary checkpointing schemes have been proposed: independent and coordinated schemes. However, most existing work addresses only the need to employ a single checkpointing and rollback recovery scheme to a target system. In this paper, issu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to achieve message efficient early-stopping uniform consensus protocols

    Publication Year: 2004, Page(s):300 - 305
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB) | HTML iconHTML

    Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t+1 processes engaging in sending message... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel sorting by exact splitting

    Publication Year: 2004, Page(s):92 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1374 KB) | HTML iconHTML

    A new algorithm of parallel sorting by exact splitting suitable for MIMD multiprocessors is presented in the paper. The algorithm locates the splitter accurately using a flexible locating splitter algorithm. The time complexity and communication cost is pretty good compared with other con-generic algorithms, and could even be better in particular situations benefitting from the flexibility of its ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strategies for exploring large scale data

    Publication Year: 2004
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1273 KB) | HTML iconHTML

    Summary form only given. We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree-like hierarchical model for distributed micro-security system

    Publication Year: 2004, Page(s):594 - 599
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3425 KB) | HTML iconHTML

    This paper presents a large-scale dynamic self-immune security architecture. In this architecture, a network is modeled as a hierarchy of administrators and hosts. We use a tree-like hierarchical model to guarantee security, scalability and availability of the system. We adopt a simple SSL-based authentication protocol to avoid unauthorized access to administrators, a group management mechanism fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal loop scheduling with register constraints using flow graphs

    Publication Year: 2004, Page(s):180 - 185
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1349 KB) | HTML iconHTML

    We present a novel loop scheduling approach using a generalized flow graph model of the resource constraints. From this model we derive a new flow graph to incorporate register constraints. Our linear programming implementation produces an optimum loop schedule, respecting the constraints on functional units and registers in a single optimization problem. Moreover, the iteration interval is treate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An embedded Web server for equipment

    Publication Year: 2004, Page(s):345 - 350
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1392 KB) | HTML iconHTML

    In this paper a design concept is proposed to accomplish a full function Web server on a strictly limited resource space. Through this embedded Web server user can access their equipments remotely. The equipment mentioned here could be home appliances and factory devices. This paper is focused on realization of the TCP/IP suite and user development platform for this embedded Web server. A key goal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient anycast routing protocol based on multi-metrics

    Publication Year: 2004, Page(s):24 - 29
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1378 KB) | HTML iconHTML

    Anycast communication can be used to provide effective routing to server members in a replicated server group that is represented by an anycast address. This paper proposes a novel anycast routing protocol called anycast routing protocol based on multi-metrics (ARMM). ARMM protocol sets up the routing by taking hop number, data transmission delay, residual bandwidth, and server load as the server ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor mapping technique for communication free data redistribution on symmetrical matrix

    Publication Year: 2004, Page(s):214 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1454 KB) | HTML iconHTML

    In this paper, we present the processor mapping technique to eliminate amount of data exchange in runtime data redistribution on symmetric matrices. The main idea of the proposed technique is to develop mathematical functions for mapping destination processors to a new sequence of processor id. The realigned order of destination processors is then used to perform data redistribution in the receivi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing relay control in Wireless 1394 network

    Publication Year: 2004, Page(s):54 - 59
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB) | HTML iconHTML

    Relay control ought to be performed when a direct communication link cannot be established between the source station and the target station. We propose in this paper how such function can be accomplished effectively in Wireless 1394 based networks. Simulation results yield the fact that the proposed scheme not only can optimize the data relay control from the perspectives of the premium (the lowe... View full abstract»

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