default search action
11th ICDCS 1991: Arlington, Texas, USA
- 10th International Conference on Distributed Computing Systems (ICDCS 1991), May 20-24, 1991, Arlington, Texas, USA. IEEE Computer Society 1991, ISBN 0-8186-2144-3
- Carl D. Tait, Dan Duchamp:
Detection and exploitation of file working sets. 2-9 - Raymond C. Chen, Partha Dasgupta:
Implementing consistency control mechanisms in the Clouds distributed operating system. 10-17 - Marvin Theimer, Barry Hayes:
Heterogeneous process migration by recompilation. 18-25 - Yiping Ding, Howard A. Sholl, Lester Lipsky:
Approximations of the mean resequencing waiting time in M/GI/c systems. 28-35 - Philip H. Enslow Jr., Ian F. Akyildiz, K. Wang:
Performance optimization of integrated network control schemes in packet-switched networks. 36-43 - Vincenzo Catania, L. Mazzola, Antonio Puliafito, Lorenzo Vita:
Performance analysis of DQDB behaviour with priority levels. 44-51 - Chris Clifton, Hector Garcia-Molina:
Distributed processing of filtering queries in HyperFile. 54-64 - Steven S. Popovich, Shyhtsun Felix Wu, Gail E. Kaiser:
An object-based approach to implementing distributed concurrency control. 65-72 - Brent Hailpern, Gail E. Kaiser:
Dynamic reconfiguration in an object-based programming language with distributed shared data. 73-80 - Michael F. Schwartz, Darren R. Hardy, William K. Heinzman, Glenn C. Hirschowitz:
Supporting resource discovery among public Internet archives using a spectrum of information quality. 82-89 - Rong N. Chang, Chinya V. Ravishankar:
A service acquisition mechanism for the client/service model in Cygnus. 90-97 - K. Ravindran, K. K. Ramakrishnan:
A model of naming for fine-grained service specification in distributed systems. 98-105 - S. Krishnaprasad, Behrooz A. Shirazi, Ali R. Hurson:
Exploiting problem dynamics through result sharing in dataflow environments. 108-115 - S. Dandamudi, C.-Y. Chow:
Performance of transaction scheduling policies for parallel database systems. 116-124 - Tzung-Pei Hong, Shian-Shyong Tseng:
Models of parallel learning systems. 125-132 - Neel Madhav, Sigurd Meldal:
An object-oriented approach to formal specification of reactive systems. 134-141 - H.-M. Järvinen, Reino Kurki-Suonio:
DisCo specification language: marriage of actions and objects. 142-151 - Dominique Decouchant, P. Le Dot, Michel Riveill, Cécile Roisin, Xavier Rousset de Pina:
A synchronization mechanism for an object oriented distributed system. 152-159 - Rajive L. Bagrodia, Chien-Chung Shen:
Integrated design, simulation, and verification of real-time systems. 164-171 - Akkihebbal L. Ananda, B. H. Tay, E. K. Koh:
ASTRA-an asynchronous remote procedure call facility. 172-179 - Mohan Ahuja:
An implementation of F-channels, a preferable alternative to FIFO channels. 180-187 - Salim Hariri, Hasan B. Mutlu:
A hierarchical modeling of availability in distributed systems. 190-197 - Hector Garcia-Molina, Ben Kao, Daniel Barbará:
Aggressive transmissions over redundant paths. 198-207 - Asit Dan, Philip S. Yu:
Performance comparisons of buffer coherency policies. 208-217 - M. Frans Kaashoek, Andrew S. Tanenbaum:
Group communication in the Amoeba distributed operating system. 222-230 - Joshua S. Auerbach, Madan Gopal, Marc A. Kaplan, Shay Kutten:
Multicast group membership management in high speed wide area networks. 231-238 - Akihito Nakamura, Makoto Takizawa:
Reliable broadcast protocol for selectively partially ordering PDUs (SPO protocol). 239-246 - Niranjan G. Shivaratri, Mukesh Singhal:
A transfer policy for global scheduling algorithms to schedule tasks with deadlines. 248-255 - Po-Jen Chuang, Nian-Feng Tzeng:
An efficient submesh allocation strategy for mesh computer systems. 256-263 - Hwa-Chun Lin, Cauligi S. Raghavendra:
A dynamic load balancing policy with a central job dispatcher (LBC). 264-271 - Mustaque Ahamad, Phillip W. Hutto, Ranjit John:
Implementing and programming causal distributed shared memory. 274-281 - A. K. Singh:
On the validity of the global time assumption. 282-289 - Alan Olson, Kang G. Shin:
Probabilistic clock synchronization in large distributed systems. 290-297 - Dilip D. Kandlur, Kang G. Shin, Domenico Ferrari:
Real-time communication in multi-hop networks. 300-307 - Cheng-Chew Lim, Lijun Yao, Wei Zhao:
A comparative study of three token ring protocols for real-time communications. 308-317 - Joseph Kee-Yin Ng, Jane W.-S. Liu:
Performance of local area network protocols for hard real-time applications. 318-326 - Margaret A. Schaar, Kemal Efe, Lois M. L. Delcambre, Laxmi N. Bhuyan:
Load balancing with network cooperation. 328-335 - Phillip Krueger, Rohit Chawla:
The Stealth distributed scheduler. 336-343 - Mikhail J. Atallah, Christina Lock, Dan C. Marinescu, Howard Jay Siegel, Thomas L. Casavant:
Co-scheduling compute-intensive tasks on a network of workstations: model and algorithms. 344-352 - Mitchell L. Neilsen, Masaaki Mizuno:
A DAG-based algorithm for distributed mutual exclusion. 354-360 - Masaaki Mizuno, Mitchell L. Neilsen, Raghavendra Rao:
A token based distributed mutual exclusion algorithm based on quorum agreements. 361-368 - Douglas Washabaugh, Dennis G. Kafura:
Distributed garbage collection of active objects. 369-376 - Thomas L. Casavant, Peter C. Bates, Thomas Bemmerl, Gary M. Koob, Daniel A. Reed, Zary Segall:
Debugging and performance monitoring for distributed systems: problems and prospects. 378-383 - Jong Kim, Chita R. Das:
Modeling wormhole routing in a hypercube. 386-393 - Phillip Krueger, Ten-Hwang Lai, V. A. Radiya:
Processor allocation vs. job scheduling on hypercube computers. 394-401 - Xiaoshu Qian, Qing Yang:
Load balancing on generalized hypercube and mesh multiprocessors with LAL. 402-409 - Akhil Kumar:
A randomized voting algorithm. 412-419 - Peter Triantafillou, David J. Taylor:
Using multiple replica classes to improve performance in distributed systems. 420-428 - Nabil R. Adam, Rajiv Tewari:
Regeneration with virtual copies for replicated databases. 429-436 - Seyed H. Hosseini, Nizar Jamal:
Efficient distributed processor level fault diagnosis of multiple processor systems. 438-445 - Sampath Rangarajan, Donald S. Fussell:
Rectifying corrupted files in distributed file systems. 446-453 - Tong-Ying Tony Juang, S. Venkatesan:
Crash recovery with little overhead. 454-461 - Suresh Singh, James F. Kurose:
Electing leaders based upon performance: the delay model. 464-471 - Gurdip Singh:
Efficient distributed algorithms for leader election in complete networks. 472-479 - Louise E. Moser, P. M. Melliar-Smith, Vivek Agrawala:
Membership algorithms for asynchronous distributed systems. 480-488 - Elango Ganesan, Dhiraj K. Pradhan:
The hyper-deBruijn multiprocessor networks. 492-499 - Jayashree Ramanathan, Lionel M. Ni:
Critical factors in NUMA memory management. 500-507 - Onat Menzilcioglu, Steven Schlick:
Nectar CAB: a high-speed network processor. 508-515 - Kemal Efe:
A statistical approach for parallel optimization with application to VLSI placement. 518-525 - Nasser G. Azari, Soo-Young Lee:
Hybrid partitioning for particle-in-cell simulation on shared memory systems. 526-533 - Reid A. Baldwin, Moon-Jung Chung, Yunmo Chung:
Overlapping window algorithm for computing GVT in Time Warp. 534-541 - Richard H. Carver, Kuo-Chung Tai:
Static analysis of concurrent software for deriving synchronization constraints. 544-551 - William S. Lloyd, Phil Kearns:
Using tracing to direct our reasoning about distributed programs. 552-559 - James M. Purtilo, Christine Hofmeister:
Dynamic reconfiguration of distributed programs. 560-571 - Sungchang Lee, Mi Lu:
BNB self-routing permutation network. 574-581 - Ge-Ming Chiu, Suresh Chalasani, Cauligi S. Raghavendra:
Flexible, fault-tolerant routing criteria for circuit-switched hypercubes. 582-589 - Sumit Sur, Pradip K. Srimani:
Super Star: a new optimally fault tolerant network architecture. 590-597 - Pen-Nan Lee, Yiwei Chen, J. M. Holdman:
DRISP: a versatile scheme for distributed fault-tolerant queues. 600-607 - Jong Tae Lim, Song Chun Moon:
A checkpointing scheme for heterogeneous distributed database systems. 608-615 - Anupam Bhide, E. N. Elnozahy, Stephen P. Morgan, A. Siegel:
A comparison of two approaches to build reliable distributed file servers. 616-623 - Mark P. Pearson, Partha Dasgupta:
CLIDE: a distributed, symbolic programming system based on large-grained persistent objects. 626-633 - Ying Liu, Ambuj K. Singh:
Parallel programming: achieving portability through abstraction. 634-640 - Bernd Bruegge, Peter Steenkiste:
Supporting the development of network programs. 641-648
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.