Search Results - "Proceedings of the 16th International Conference on Distributed Computing Systems"

Data mining for path traversal patterns in a web environment by Ming-Syan Chen, Jong Soo Park, Yu, P.S.

“…In this paper, we explore a new data mining capability which involved mining path traversal patterns in a distributed information providing environment like…”
Get full text

A low-overhead recovery technique using quasi-synchronous checkpointing by Manivannan, D., Singhal, M.

“…In this paper, we propose a quasi-synchronous checkpointing algorithm and a low-overhead recovery algorithm based on it. The checkpointing algorithm preserves…”
Get full text

An approach for constructing mobile applications using service proxies by Hokimoto, A., Kurihara, K., Nakajima, T.

“…In this paper, we propose software architecture using a notion of service proxies, that is a new framework for constructing applications in mobile computing…”
Get full text

Fault-tolerant file transmission by information dispersal algorithm in rotator graphs by Hamada, Y., Bao, F., Mei, A., Igarashi, Y.

“…A directed graph G=(V, E) is called the n-rotator graph if V={a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/|a/sub 1/a/sub 2//spl middot//spl…”
Get full text

A simulation-based evaluation of a disk I/O subsystem for a massively parallel computer: JUMP-1 by Nakajo, H., Ohtani, S., Kaneda, Y.

“…JUMP-1 is a distributed shared-memory massively parallel computer and is composed of multiple clusters of inter-connected network called RDT (Recursive…”
Get full text

A framework for customizing coherence protocols of distributed file caches by Uehara, K., Inohara, S., Miyazawa, H., Yamamoto, K., Masuda, T.

“…In cooperative applications such as group CAD and group software development systems, multiple processes communicate with each other by sharing complex data…”
Get full text

How to recover efficiently and asynchronously when optimism fails by Damani, O.P., Garg, V.K.

“…We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts-a…”
Get full text

Scaling heterogeneous databases and the design of Disco by Tomasic, A., Raschid, L., Valduriez, P.

“…Access to large numbers of data sources introduces new problems for users of heterogeneous distributed databases. End users and application programmers must…”
Get full text

Synchronization protocols in distributed real-time systems by Sun, J., Liu, J.

“…In many distributed real-time systems, the workload can be modeled as a set of periodic tasks, each of which consists of a chain of subtasks executing on…”
Get full text

The relative importance of concurrent writers and weak consistency models by Keleher, P.J.

“…This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our…”
Get full text

Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs by Shigang Chen, Yi Deng, Attie, P., Wei Sun

“…We present a new algorithm for detecting generalized deadlocks in distributed systems. Our algorithm incrementally constructs and reduces a wait-for graph…”
Get full text

Energy efficient filtering of nonuniform broadcast by Kian-Lee Tan, Yu, J.X.

“…In a wireless environment, information is broadcast on communication channels to clients using powerful, battery-operated palmtops. To conserve the usage of…”
Get full text

An efficient causal ordering algorithm for mobile computing environments by Prakash, R., Raynal, M., Singhal, M.

“…Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between…”
Get full text

An evaluation of the Amoeba group communication system by Kaashoek, M.F., Tanenbaum, A.S.

“…The Amoeba group communication system has two unique aspects: (1) it uses a sequencer-based protocol with negative acknowledgements for achieving a total order…”
Get full text

To send or not to send: implementing deferred transmissions in a mobile host by Badrinath, B.R., Sudame, P.

“…As mobile hosts move, they encounter changing network characteristics. Characteristics such as bandwidth, reliability can change drastically when a mobile host…”
Get full text

Reducing the cost for non-blocking in atomic commitment by Guerraoui, R., Larrea, M., Schiper, A.

“…Non-blocking atomic commitment protocols enable a decision (commit or abort) to be reached at every correct participant, despite the failure of others. The…”
Get full text

Totally ordered multicast in large-scale systems by Rodrigues, L.E.T., Fonseca, H., Verissimo, P.

“…Totally ordered multicast protocols have proved to be extremely useful in supporting fault-tolerant distributed applications. This paper compares the…”
Get full text

Exception handling and resolution in distributed object-oriented systems by Romanovsky, A., Jie Xu, Randell, B.

“…We address the problem of how to handle exceptions in distributed object-oriented systems. In a distributed computing environment exceptions may be raised…”
Get full text

Making trust explicit in distributed commerce transactions by Ketchpel, S.P., Garcia-Molina, H.

“…In a distributed environment where nodes are independently motivated, many transactions or commercial exchanges may be stymied due to a lack of trust between…”
Get full text

Fast dynamic process migration by Roush, E.T., Campbell, R.H.

“…Dynamic process migration supports load sharing and processor fault tolerance. We present the new freeze free algorithm for process migration, which uses six…”
Get full text