Proceedings - International Conference on Distributed Computing Systems
SCOPUS (1982,1984,1986-2024)
1063-6927
Mỹ
Cơ quản chủ quản: Institute of Electrical and Electronics Engineers Inc.
Lĩnh vực:
Computer Networks and CommunicationsSoftwareHardware and Architecture
Phân tích ảnh hưởng
Các bài báo tiêu biểu
Balancing performance, energy, and quality in pervasive computing
- Trang 217-226
We describe Spectra, a remote execution system for battery-powered clients used
in pervasive computing. Spectra enables applications to combine the mobility of
small devices with the greater processing power of static compute servers.
Spectra is self-tuning: it monitors both application resource usage and the
availability of resources in the environment, and dynamically determines how and
where to...
#Pervasive computing #Availability #Speech recognition #Natural languages #Batteries #Computer networks #Network servers #Costs #Distributed computing #Energy conservation
A reliable multicast algorithm for mobile ad hoc networks
- Trang 563-570
A reliable multicast algorithm, called RMA, for mobile ad hoc networks is
presented that is based on a new cost criterion, called link lifetime, for
determining the optimal path between a pair of nodes. The algorithm has the
characteristics of using an undirected graph for its routing operations rather
than a fixed structure like a tree or a mesh. Previously proposed routing
metrics for mobile ad ...
#Multicast algorithms #Mobile ad hoc networks #Routing #Ad hoc networks #Analytical models #Bandwidth #Cost function #Tree graphs #Stability #Performance analysis
Non-blocking transactional mobile agent execution
- Trang 443-444
Mobile agents are computer programs that act autonomously on behalf of a user
and travel through a network of heterogeneous machines. To enable mobile agent
technology for e-business, transaction support needs to be provided, in
particular execution atomicity. Execution atomicity ensures that either all
operations of the agent succeed, or none at all, and needs to be ensured also in
the face of in...
#Mobile agents #Computer crashes #Laboratories #Books #Computer networks #Distributed computing #Throughput #Logic
Fast Collect in the absence of contention
- Trang 537-543
We present a generic module, called Fast Collect. Fast Collect is an
implementation of single-writer multi-reader (SWMR) shared-memory in an
asynchronous system in which a processor updates its cell and then reads in any
order all the other cells. Our simple implementation of Fast Collect uses some
multiwriter multi-reader (MWMR) variables and one local Boolean per processor,
such that eventually,...
#Concurrent computing #Costs #Software algorithms #Adaptive algorithm #Chromium #Distributed algorithms #Computer bugs #Mathematics #Computer science #Steady-state
Incremental replication for mobility support in OBIWAN
- Trang 249-256
The need for sharing is well known in a large number of distributed
collaborative applications. These applications are difficult to develop for wide
area (possibly mobile) networks because of slow and unreliable connections. For
this purpose, we developed a platform called OBIWAN that: i) allows the
application to decide, in run-time, the mechanism by which objects should be
invoked, remote method...
#Personal digital assistants #Internet #Runtime #Portable computers #Collaboration #Programming profession #Mechanical factors #Prototypes #Java #Collaborative work
Improving the scalability of fault-tolerant database clusters
- Trang 477-484
Replication has become a central element in modem information systems playing a
dual role: increase availability and enhance scalability. Unfortunately, most
existing protocols increase availability at the cost of scalability; This paper
presents architecture, implementation and performance of a middleware based
replication tool that provides both availability and better scalability than
existing ...
#Scalability #Fault tolerance #Databases #Availability #Modems #Information systems #Protocols #Costs #Middleware #Broadcasting
Dynamic replica control based on fairly assigned variation of data with weak consistency for loosely coupled distributed systems
- Trang 280-289
This paper proposes a replica control method based on a fairly assigned
variation of numerical data that has weak consistency for loosely coupled
systems managed or used by different organizations. This method dynamically
distributes the variation of numerical data to replicas according to their
demands while achieving fairness among them. By assigning the variation, a
replica can determine the po...
#Control systems #Availability #Scalability #Database systems #Delay #Telegraphy #Telephony #Computational modeling #Computer networks #Humans
Dynamic QoS-aware multimedia service configuration in ubiquitous computing environments
- Trang 311-318
Ubiquitous computing promotes the proliferation of various stationary, embedded
and mobile devices interconnected by heterogeneous networks. It leads to a
highly dynamic distributed system with many devices and services coming and
going frequently. Many emerging distributed multimedia applications are being
deployed in such a computing environment. In order to make the experience for a
user truly ...
#Multimedia computing #Ubiquitous computing #Pervasive computing #Quality of service #NASA #Distributed computing #Runtime environment #Contracts #Intelligent networks #Computer networks
Invariant consistency: a mechanism for inter-process ordering in distributed shared memory systems
- Trang 447-448
We propose the notion of invariant consistency that allows programmers to
specify inter-process ordering requirements. In our approach, we allow a
programmer to label a program and provide an ordering specification. In
particular, we associate a counter count/sub l/ with each label l that counts
the number of times the operation labeled l has been executed. The ordering
specification is given by a...
#Programming profession #Access protocols #Concurrent computing #Multiprocessing systems #Counting circuits #Distributed computing #Multiprocessor interconnection networks #Message passing #Sufficient conditions #Contracts
RICA: a receiver-initiated approach for channel-adaptive on-demand routing in ad hoc mobile computing networks
- Trang 84-91
To support truly peer-to-peer applications in ad hoc wireless mobile computing
networks, a judicious and efficient ad hoc routing protocol is needed. Much
research has been done on designing ad hoc routing protocols and some well known
protocols are also being implemented in practical situations. However, one major
drawback in existing state-of-the-art protocols, such as the AODV routing
protocol,...
#Mobile computing #Computer networks #Routing protocols #Peer to peer computing #Throughput #Wireless application protocol #Channel coding #Modulation coding #Protection #Delay