IEEE Transactions on Parallel and Distributed Systems
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Locating mobile agents in a wide distributed environment
IEEE Transactions on Parallel and Distributed Systems - 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
Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links
IEEE Transactions on Parallel and Distributed Systems - Tập 13 Số 9 - Trang 866-881 - 2002
We extend dominating-set-based routing to networks with unidirectional links.
Specifically, an efficient localized algorithm for determining a dominating and
absorbant set of vertices (mobile hosts) is given and this set can be easily
updated when the network topology changes dynamically. A host /spl nu/ is called
a dominating neighbor (absorbant neighbor) of another host u if there is a
directed ...
#Intelligent networks #Wireless networks #Routing protocols #Wireless sensor networks #Bandwidth #Network topology #Mobile radio mobility management #Base stations #Distributed computing #Military computing
An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs
IEEE Transactions on Parallel and Distributed Systems - 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
Communications directed by bound types in Linda: presentation and formal model
IEEE Transactions on Parallel and Distributed Systems - 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
Adaptive bandwidth reservation and admission control in QoS-sensitive cellular networks
IEEE Transactions on Parallel and Distributed Systems - 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
Scalable stability detection using logical hypercube
IEEE Transactions on Parallel and Distributed Systems - 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
A study of adaptive forward error correction for wireless collaborative computing
IEEE Transactions on Parallel and Distributed Systems - Tập 13 Số 9 - Trang 936-947 - 2002
This paper addresses the problem of reliably multicasting Web resources across
wireless local area networks (WLANs) in support of collaborative computing
applications. An adaptive forward error correction (FEC) protocol is described,
which adjusts the level of redundancy in the data stream in response to packet
loss conditions. The proposed protocol is intended for use on a proxy server
that suppo...
#Forward error correction #Collaboration #Wireless LAN #Multicast protocols #Computer applications #Computer networks #Application software #Redundancy #Network servers #Software architecture
On load balancing for distributed multiagent computing
IEEE Transactions on Parallel and Distributed Systems - 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
Learning to classify parallel input/output access patterns
IEEE Transactions on Parallel and Distributed Systems - Tập 13 Số 8 - Trang 802-813 - 2002
Input/output performance on current parallel file systems is sensitive to a good
match of application access patterns to file system capabilities. Automatic
input/output access pattern classification can determine application access
patterns at execution time, guiding adaptive file system policies. In this
paper, we examine and compare two novel input/output access pattern
classification methods b...
#File systems #Pattern classification #Hidden Markov models #Pattern matching #Adaptive systems #Neural networks #Feedforward neural networks #Pattern recognition #Interleaved codes
On the asymptotical optimality of multilayered decentralized consensus protocol
IEEE Transactions on Parallel and Distributed Systems - 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
Tổng số: 17
- 1
- 2