[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Volume E89-D, Issue 2February 2006
Publisher:
  • Oxford University Press, Inc.
  • 198 Madison Ave. New York, NY
  • United States
ISSN:0916-8532
EISSN:1745-1361
Reflects downloads up to 19 Dec 2024Bibliometrics
article
Toward Incremental Parallelization Using Navigational Programming*The authors gratefully acknowledge the support of a U.S. Department of Education GAANN Fellowship.

The Navigational Programming (NavP) methodology is based on the principle of self-migrating computations. It is a truly incremental methodology for developing parallel programs: each step represents a functioning program, and each intermediate program ...

article
Development and Implementation of an Interactive Parallelization Assistance Tool for OpenMP: iPat/OMP

iPat/OMP is an interactive parallelization assistance tool for OpenMP. In the present paper, we describe the design concept of iPat/OMP, the parallelization sequence achieved by the tool and its current implementation status. In addition, we present an ...

article
Controller/Precompiler for Portable Checkpointing

This paper presents CPPC (Controller/Precompiler for Portable Checkpointing), a checkpointing tool designed for heterogeneous clusters and Grid infrastructures through the use of portable protocols, portable checkpoint files and portable code. It works ...

article
Message Scheduling for Irregular Data Redistribution in Parallelizing Compilers

In parallelizing compilers on distributed memory systems, distributions of irregular sized array blocks are provided for load balancing and irregular problems. The irregular data redistribution is different from the regular block-cyclic redistribution. ...

article
Realizing Effective MPI-I/O to a Remote Computer Using a Parallel Virtual File System

This paper presents a newly implemented remote MPI-I/O mechanism using a Parallel Virtual File System (PVFS) to achieve high performance data-intensive I/O operations among computers. MPI-I/O extensions were realized in a flexible intermediate library ...

article
DCLUE: A Distributed Cluster Emulator

Given the availability of high-speed Ethernet and HW based protocol offload, clustered systems using a commodity network fabric (e.g., TCP/IP over Ethernet) are expected to become more attractive for a range of e-business and data center applications. ...

article
Analytic Performance Evaluation of OTIS-Hypercubes

In this paper, routing properties of cube-based optoelectronic OTIS networks are explored. We show emulations of various cubical network topologies on their OTIS augmented variants, including the n-D grid networks, shuffle-exchange, and de Brujin ...

article
Performance Analysis of Optical-Level Buffered Optical Burst Switching Node with Retransmission Technique*This work was supported in part by the KOSEF-OIRC project.

In this paper, we develop an analytical model to evaluate the performance of optical burst switching (OBS) node with optical-level buffers for retransmission of blocked bursts. First, currently used burst blocking models and modelling of optical buffers ...

article
Performance Comparison of Task Allocation Schemes Depending upon Resource Availability in a Grid Computing Environment*The earlier version of this paper was presented at the 2003 International Conference on Computational Science (ICCS2003).

Recent improvements in the performance of end-computers and networks have made it feasible to construct a grid system over the Internet. A grid environment consists of many computers, each having a set of components and a distinct performance. These ...

article
Entropy Based Evaluation of Communication Predictability in Parallel Applications

The performance of parallel computing applications is highly dependent on the efficiency of the underlying communication operations. While often characterized as dynamic, these communication operations frequently exhibit spatial and temporal locality as ...

article
Influence of Inaccurate Performance Prediction on Task Scheduling in a Grid Environment*This research is conducted as a program for the "21st Century COE Program" by Ministry of Education, Culture, Sports, Science and Technology, Japan.

Efficient task scheduling is critical for achieving high performance in grid computing systems. Existing task scheduling algorithms for grid environments usually assume that the performance prediction for both tasks and resources is perfectly accurate. ...

article
MORR: A Novel Regional Location Management Scheme Based on User Movement Behavior in Mobile IP

A novel distributed dynamic regional location management scheme called MORR (Mobility Oriented Regional Registration) is proposed for Mobile IP to improve the signaling traffic cost of a mobile node. This improvement is achieved by adjusting each mobile ...

article
Cooperative Reconfiguration of Software Components for Power-Aware Mobile Computing

Mobile applications require software reconfiguration to improve resource usage and availability. We propose a power-aware reconfiguration scheme that (1) moves energy-demanding applications to proxy servers, and (2) adjusts the fidelity of mobile ...

article
Design of a Mobile Application Framework with Context Sensitivities

New service concepts involving mobile devices with a diverse range of embedded sensors are emerging that share contexts supporting communication on a wireless network infrastructure. To promote these services in mobile devices, we propose a method that ...

article
A Distributed Backup Routes Mechanism for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a self-organizing and adaptive wireless network constructed by the dynamic gathering of mobile nodes (MNs). The communication among MNs in MANETs is carried out without base stations or access points and the ...

article
An Adaptive Medium Access Control Protocol for Reliable Broadcast and Unicast in Ad Hoc Networks

An ad hoc network is formed by a group of mobile hosts communicating over wireless channels. There is no any fixed network interaction and centralized administration. Because a routing protocol needs an efficient medium access control (MAC) protocol to ...

article
Path-Adaptive On-Site Tracking in Wireless Sensor Networks

Wireless sensor networks present a promising opportunity for realizing many practical applications. Tracking is one of the important applications of these networks. Many approaches have been proposed in the literature to deal with the tracking problem. ...

article
PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity

Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. A routing efficiency enhancement protocol on top of Chord is illustrated in this paper, which ...

article
Proxy-Based Index Caching for Content-Addressable Networks

Content-Addressable Network (CAN) provides a mechanism that could retrieve objects in a P2P network by maintaining indices to those objects in a fully decentralized manner. In the CAN system, index caching is a useful technique for reducing the response ...

article
Reciprocity: Enforcing Contribution in P2P Perpendicular Downloading

Flash bulk files downloading in style of P2P through perpendicular pattern becomes more popular recently. Many peers download different pieces of shared files from the source in parallel. They try to reconstruct complete files by exchanging needed ...

article
HiPeer: A Highly Reliable P2P System

The paper presents HiPeer, a robust resource distribution and discovery algorithm that can be used for fast and fault-tolerant location of resources in P2P network environments. HiPeer defines a concentric multi-ring overlay networking topology, whereon ...

article
A Multicast Based Anonymous Information Sharing Protocol for Peer-to-Peer Systems

A fundamental problem in a pure Peer-to-Peer (P2P) file sharing system is how to protect the anonymity of peer nodes when providing efficient data access services. Most of existing work mainly focus on how to provide the initiator anonymity, but neglect ...

article
Mapping of Hierarchical Parallel Genetic Algorithms for Protein Folding onto Computational Grids

Genetic algorithms are a general problem-solving technique that has been widely used in computational biology. In this paper, we present a framework to map hierarchical parallel genetic algorithms for protein folding problems onto computational grids. ...

article
An Online Scheduling Algorithm for Assigning Jobs in the Computational Grid

The computational grid provides a promising platform for the deployment of various high-performance computing applications. Problem in implementing computational grid environments is how to effectively use various resources in the system, such as CPU ...

article
Credible Worker Selection Mechanism for Grid Computing

The concept of grid computing emerged with the appearance of high-speed network. Effective grid worker (i.e., computing resource) selection mechanism is important to achieve reliable grid computing system since each worker participate in grid computing ...

article
DRIC: Dependable Grid Computing Framework

Grid computing presents a new trend to distributed and Internet computing to coordinate large scale resources sharing and problem solving in dynamic, multi-institutional virtual organizations. Due to the diverse failures and error conditions in the grid ...

article
ECA Rule-Based Workflow Modeling and Implementation for Service Composition

Changes in recent business and scientific environment have created a necessity for more efficient and effective workflow infrastructure. With increasing emphasis on Service-oriented architecture, service composition becomes a hot topic in workflow ...

article
A Security Middleware Model for Real-Time Applications on Grids

Real-time applications are indispensable for conducting research and business in government, industry, and academic organizations. Recently, real-time applications with security requirements increasingly emerged in large-scale distributed systems such ...

article
A Coarse-Grain Hierarchical Technique for 2-Dimensional FFT on Configurable Parallel Computers*This work was supported in part by the US Department of Energy under grant DE-FG02-03CH11171.

FPGAs (Field-Programmable Gate Arrays) have been widely used as coprocessors to boost the performance of data-intensive applications [1], [2]. However, there are several challenges to further boost FPGA performance: the communication overhead between ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.