IEEE Transactions on Parallel and Distributed Systems
2161-9883
Cơ quản chủ quản: N/A
Lĩnh vực:
Các bài báo tiêu biểu
Locating mobile agents in a wide distributed environment
Tập 13 Số 8 - Trang 844-864 - 2002
Finding the position of a mobile agent in a wide distributed system still represents an open research issue. The paper proposes a naming scheme and a location protocol of general validity for mobile agents able to effectively meet all the typical requirements of mobile agent environments and, thus, easy to integrate into different platforms. The paper identifies the main characteristics which an a......
#Mobile agents #Protocols #Programming profession #Performance evaluation #Power system modeling #Scalability #Humans
Scalable stability detection using logical hypercube
Tập 13 Số 9 - Trang 972-984 - 2002
This paper proposes to use a logical hypercube structure for detecting message stability in distributed systems. In particular, a stability detection protocol that uses such a superimposed logical structure is presented, and its scalability is compared with other known stability detection protocols. The main benefits of the logical hypercube approach are scalability, fault-tolerance, and refrainin......
#Stability #Hypercubes #Scalability #Network topology #Multicast protocols #Telecommunication network reliability #Middleware #Analytical models #Intersymbol interference #Communication standards
Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks
Tập 13 Số 9 - Trang 963-971 - 2002
Nodes in a hexagonal network are placed at the vertices of a regular triangular tessellation, so that each node has up to six neighbors. The network is proposed as an alternative interconnection network to a mesh connected computer (with nodes serving as processors) and is used also to model cellular networks where nodes are the base stations. In this paper, we propose a suitable addressing scheme......
#Routing #Intelligent networks #Land mobile radio cellular systems #Base stations #Multiprocessor interconnection networks #Broadcasting #Computer networks #Mobile handsets #Costs #Tracking
On load balancing for distributed multiagent computing
Tập 13 Số 8 - Trang 787-801 - 2002
Multiagent computing on a cluster of workstations is widely envisioned to be a powerful paradigm for building useful distributed applications. The agents of the system span across all the machines of a cluster. Just like the case of traditional distributed systems, load balancing becomes an area of concern. With different characteristics between ordinary processes and agents, it is both interestin......
#Load management #Distributed computing #Multiagent systems #Workstations #Software agents #Computer networks #Humans #Measurement #Clustering algorithms #Software systems
Communications directed by bound types in Linda: presentation and formal model
Tập 13 Số 8 - Trang 828-843 - 2002
Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to solve it, and we show why they are not sufficient. In this framework, our goal is to propose an extens......
#Application software #Parallel programming #Associative memory #Concurrent computing #Distributed computing #Computer architecture #Parallel processing #Variable speed drives #Power system economics #Power generation economics
Optional and responsive fine-grain locking in Internet-based collaborative systems
Tập 13 Số 9 - Trang 994-1008 - 2002
Locking is a standard technique used in distributed computing and database systems to ensure data integrity by prohibiting concurrent conflicting updates on shared data objects. Internet-based collaborative systems are a special class of distributed applications which support human-to-human interaction and collaboration over the Internet. In this paper, a novel optional and responsive fine-grain l......
#Internet #Collaboration #Distributed computing #Delay #Database systems #Real time systems #Collaborative work #Sun #Protocols #Usability
Adaptive bandwidth reservation and admission control in QoS-sensitive cellular networks
Tập 13 Số 9 - Trang 882-897 - 2002
How to keep the probability of hand-off drops within a prespecified limit is a very important quality-of-service (QoS) issue in cellular networks because mobile users should be able to maintain ongoing sessions even during their hand-off from one cell to another. We design and evaluate predictive and adaptive schemes for bandwidth reservation for the hand-offs of ongoing sessions and the admission......
#Programmable control #Adaptive control #Bandwidth #Admission control #Land mobile radio cellular systems #Quality of service #Maintenance #Aggregates #History #Navigation
Data gathering algorithms in sensor networks using energy metrics
Tập 13 Số 9 - Trang 924-935 - 2002
Gathering sensed information in an energy efficient manner is critical to operating the sensor network for a long period of time. The LEACH protocol presented by Heinzelman et al. (2000) is an elegant solution where clusters are formed to fuse data before transmitting to the base station. In this paper, we present an improved scheme, called PEGASIS (power-efficient gathering in sensor information ......
#Protocols #Base stations #Delay #Clustering algorithms #Energy efficiency #Fuses #Sensor systems #Information systems #Energy capture #Costs
An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs
Tập 13 Số 9 - Trang 985-993 - 2002
In the literature, there are quite a few sequential and parallel algorithms for solving problems on distance-hereditary graphs. With an n-vertex and m-edge distance-hereditary graph G, we show that the efficient domination problem on G can be solved in O(log/sup 2/ n) time using O(n + m) processors on a CREW PRAM. Moreover, if a binary tree representation of G is given, the problem can be optimall......
#Parallel algorithms #Phase change random access memory #Binary trees #Tree graphs #Bipartite graph #Joining processes #Concurrent computing #Codes #Resource management #Parallel processing
On the asymptotical optimality of multilayered decentralized consensus protocol
Tập 13 Số 8 - Trang 769-786 - 2002
A decentralized consensus protocol refers to a process for all nodes in a distributed system to collect the information/status from every other node and reach a consensus among them. Two classes of decentralized consensus protocols have been studied before: the one without an initiator and the one with an initiator. While the one without an initiator has been well studied in the literature, it is ......
#Protocols #Performance analysis #Distributed computing #Message passing #Distributed processing #Availability #Costs #Clocks #Synchronization #Broadcasting