Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management
Ant routing is a method for network routing in the agent technology. Although its effectiveness and efficiency have been demonstrated and reported in the literature, its properties have not yet been well studied. This paper presents some preliminary ...
Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array
In a two- or three-dimensional image array, the computation of Euclidean distance transform (EDT) is an important task. With the increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array. ...
Constructing Edge-Disjoint Spanning Trees in Product Networks
A Cartesian product network is obtained by applying the cross operation on two graphs. In this paper, we study the problem of constructing the maximum number of edge-disjoint spanning trees (abbreviated to EDSTs) in Cartesian product networks. LetG=(V_G,...
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
Given an integer\sigma > 1 , a vector(\delta_1, \delta_2, \ldots, \delta_{\sigma-1})of nonnegative integers, and an undirected graphG=(V,E) , anL(\delta_1, \delta_2, \ldots,\delta_{\sigma-1}){\hbox{-}}\rm coloringofGis a functionffrom the vertex setVto ...
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
Effective scheduling strategies to improve response times, throughput, and utilization are an important consideration in large supercomputing environments. Parallel machines in these environments have traditionally used space-sharing strategies to ...
Probabilistic Reliable Dissemination in Large-Scale Systems
The growth of the Internet raises new challenges for the design of distributed systems and applications. In the context of group communication protocols, gossip-based schemes have attracted interest as they are scalable, easy to deploy, and resilient to ...
A Progressive Approach to Handling Message-Dependent Deadlock in Parallel Computer Systems
Handling deadlocks is essential for providing reliable communication paths between processing nodes in parallel computer systems. The existence of multiple message types and associated intermessage dependencies may cause message-dependent deadlocks in ...
Processor Allocation in the Mesh Multiprocessors Using the Leapfrog Method
The mesh-connected multiprocessor has become popular for its simple and regular structure. In this paper, a new data structure, theR{\hbox{-}}{\rm{array}} , is proposed to represent the mesh at first. The element in theR{\hbox{-}}{\rm{array}}stores the ...
Interagent Communication and Synchronization Support in the DaAgent Mobile Agent-Based Computing System
This paper describes the design, implementation, and evaluation of interagent communication and synchronization models in the DaAgent mobile-agent based computing system. Based on the requirements of some sample Internet computing applications, eight ...
On the Parallel Execution Time of Tiled Loops
Many computationally-intensive programs, such as those for differential equations, spatial interpolation, and dynamic programming, spend a large portion of their execution time in multiply-nested loops that have a regular stencil of data dependences. ...
Statistical Real-Time Communication over Ethernet
In order to realize real-time communication over Ethernet or fast Ethernet, one must be able to bound the medium access time within an acceptable limit. The multiple access nature of Ethernet makes it impossible to guarantee a deterministic medium ...
