eugene@eos (Eugene Miya) (08/30/88)
Time to send news into the ozone. Here's the DCS88 conference.
Annotations or additional keywords (and corrections) appreciated by mail.
I typed on this one, the secretaries are swamped.
Another gross generalization from
--eugene miya, NASA Ames Research Center, eugene@aurora.arc.nasa.gov
resident cynic at the Rock of Ages Home for Retired Hackers:
"Mailers?! HA!", "If my mail does not reach you, please accept my apology."
{uunet,hplabs,ncar,decwrl,allegra,tektronix}!ames!aurora!eugene
"Send mail, avoid follow-ups. If enough, I'll summarize."
========================= cut here============
%A Partha Dasgupta
%A Richard J. LeBlanc, Jr.
%A William F. Appelbe
%Z Georgia Tech.
%T The Clouds Distributed Operating System:
Function Description, Implementation Details and Related Work
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 2-9
%K object-oriented distributed systems, transparency,
programming paradigm, integration of resource management, autonomy,
ethernet, VAX-11/750, object/threads paradigm,
%A David V. Pitts
%A Partha Dasgupta
%Z Georgia Tech.
%T Object Memory and Storage Management Clouds Kernel
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 10-17
%K object-oriented distributed systems, object location, object recovery,
%A Kentaro Shimizu
%A Mammoru Maekawa
%A Jun Mamano
%Z Univ. of Tokyo
%T Hierarchical Object Groups in Distributed Operating Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 18-24
%K object-oriented distributed systems, GALAZY, network transparent,
object-based, distributed OS, replication, IPC,
%A Israel Koren
%A Zahava Koren
%Z Univ. of MA
%T On the Bandwidth of a Multi-Stage Network in the Presence of
Faulty Components
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 26-32
%K interconnection architectures, multiprocessors, redundancy,
fault-tolerance,
%A Menkae Jeng
%A Howard Jay Siegel
%T Dynamic Partitioning in a Class of Parallel Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 33-40
%K interconnection architectures, PASM, MINs, Omega networks,
extra stage cubes,
%A Michael W. Strevell
%A Harvey G. Cragon
%T High-Speed Transforms of Primitive Data Types in a Heterogeneous
Distributed Computer System
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 41-46
%K interconnection architectures, Compact LISP Machine, CLM,
%A Kiam S. Yap
%A Pankaj Jalote
%A Satish Tripathi
%Z Univ. of Maryland
%T Fault Tolerant Remote Procedure Call
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 48-54
%K remote invocation mechanisms, IPC, proposed scheme, SUNs, ethernet,
%A David L. Cohrs
%A Barton P. Miller
%A Lisa A. Call
%Z Univ. of Wisc, Madison
%T Distributed Upcalls: A Mechanism for Layering Asynchronous Abstractions
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 55-62
%K remote invocation mechanisms, CLAM system, bundler, RPC, IPC, tasks,
SUN, C++, running as of this date,
%A Klaus-Peter Lohr
%A Joachim Muller
%A Lutz Nentwig
%Z Freie Universitat Berlin
%T DAPHNE Support for Distributed Applications Programming
in Heterogeneous Computer Networks
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 63-71
%K remote invocation mechanisms, RPC, IPC, Modula-2,
SUN, C++, running as of this date,
%A Kenneth C. Sevcik
%A Xiao-Nan Tan
%T An Interconnection Network that Exploits Locality of Communication
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 74-85
%K tree and cube connected architectures, Omega net, shuffle/exchange,
binary tree, combination routing, exchange/unshuffle,
%A Hee Yong Youn
%A Adit D. Singh
%Z U. Mass.
%T Near Optimal Embedding of Binary Tree Architecture in VLSI
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 86-93
%K grecommended, tree and cube connected architectures, evaluation criteria,
area efficiency, propagation delay, maximum edge length (MEL),
Gordon's scheme,
%X This paper received the Best Paper award on this conference.
%A Ophir Frieder
%A Chaitanya K. Baru
%T Query Scheduling and Site Selection Algorithms for a
Cube-Connected Multicomputer System
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 94-101
%K tree and cube connected architectures, NCUBE,
relational database algorithms, hypercube,
total active sequence count (TASC, ASC, Maximum, least ASC))
%A Michael J. Litzkow
%A Miron Livny
%A Matt W. Mutka
%Z COMPUTER SCIENCES DEPARTMENT, UNIVERSITY OF WISCONSIN, MADISON, WI
%T Condor - A Hunter of Idle Workstations
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 104-111
%K load distribution, remote Unix, up-down algorithm, leverage, scheduling,
%d December 1987
%r TR 730
%X This paper presents the design, implementation, and performance
of the Condor scheduling system. Condor operates a workstation environment.
The system aims to maximize the utilization of workstations with as little
interference as possible between the jobs it schedules and the activities of
the people who own workstations. It identifies idle workstations and
schedules background jobs on them. When the owner of a workstation resumes
activity at a station, Condor checkpoints the remote job running on the
station and transfers it to another workstation. The system guarantees
that the job will eventually complete, and that very little, if any,
work will be performed more than once. The system has been operational
for more than three months. In this paper we present a
performance profile of the system based on data that was accumulated
from 23 stations during one month. During the one-month period,
nearly 1000 jobs were scheduled by Condor. The system was
used by heavy users and light users who consumed approximately 200 CPU days.
An analysis of the response times observed by the different users is a clear
display of the capacity. Since a user of Condor has to devote some local
capacity to support the remote execution of his/her jobs, the effectiveness
of the remote scheduling system depends on the amount of this capacity.
We show that this overhead is very small. On the average, a user has to
sacrifice less than one minute of local CPU capacity to acquire a day
of remote CPU capacity. Condor has proven to be an extremely effective
means to improve the productivity of our computing environment.
%X Great name!
%A Marvin Theimer
%A Keith A. Lantz
%T Finding Idle Machines in a Workstation-based Distributed System
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 112-122
%K load distribution, computational servers, scheduling, metrics,
%A Phillip Krueger
%A Miron Livny
%T A Comparison of Preemptive and Non-Preemptive Load Balancing
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 123-130
%K load distribution, scheduling, process transfer, process placement,
process migration, receiver initiated, sender initiated, response time,
response ratio,
%A V. Pallios
%A T. Antonakopoulos
%A V. Makios
%Z Univ. of Patras, Greece
%T Architecture and Implementation of the Access Mechanism for a
Bus-Structured Multiservice LAN
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 132-137
%K analysis of bus structures,
asynchronous dynamic Time Division Multiplexing (TDM),
%A Jang-Ping Sheu
%A Wen-Tsuen Chen
%T Performance Analysis of Multiple Bus Interconnection Networks with
Hierarchical Request Modeling
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 138-144
%K analysis of bus structures, partial bus networks with K classes,
%A S. Akhtar
%A A. K. Sood
%A K. Y. Srinivasan
%T An Extended Token Bus Protocol for Embedded Networks
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 145-152
%K analysis of bus structures, token bus, performance evaluation,
multi-access protocol, deterministic protocol, broadcast medium,
bus protocol, protocol performance, embedded networks, local-area networks,
Automatic Guided Vehicles, Improved token bus Multi-Access Protocol (IMAP),
CSMA/CD, channel utilization,
%A Peter C. Dibble
%A Michael L. Scott
%A Carla Schlatter
%T Bridge: A High-Performance File System for Parallel Processors
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 154-161
%K operating system facilities for multiprocessors, aggregate I/O,
interleaved file, BBN butterfly, parallel processor, RAM disk,
disk striping, separate local file system (LFS), Cronus,
%A C. Scheurich
%A M. Dubois
%Z UCLA
%T Dynamic Page Migration in Multiprocessors with Distributed
Global Memory
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 162-169
%K operating system facilities for multiprocessors,
Distributed Global Memory Systems (DGMS), pivot mechanism,
mesh connected,
%A Scott. J. Warren
%A Joan M. Francioni
%Z Michigan Tech.
%T Reduction of Communication Delays in Hypercube Program
Based on Run Time Statistics
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 170-177
%K operating system facilities for multiprocessors, Intel iPSC/d5,
communication redirection (CRD), process-to-node mapping,
%A Lothar Mackert
%A Ralf Meyer
%A Ulrich Scheere
%A Jurgen Schneider
%A Roelof Jan Velthuys
%A Jorg Burmeister
%A Jan de\ Meer
%A Ilona Schroer
%T A Generalized Conformance Test Tool for Communication Protocols
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 180-188
%K evaluation of protocols and networks, OSI, Test Processing System (TPS),
language of temporal ordering specification (LOTOS),
communicating rule system (CRS), tree and tabular combination notation (TTCN),
%A V. Cherkassky
%A H. Lari-Najafi
%A N. L. Lawrie
%A D. Masson
%A D. W. Pritty
%T Architectural Development and Performance of a Real Time LAN
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 189-196
%K evaluation of protocols and networks, Instanet,
performance evaluation, preemptive resume, priority interrupt, real-time,
sensor fusion, token ring,
%A Dan Cristian Marinescu
%T Scheduled and Nonscheduled Access in a Distributed System based upon
a Functional Communications Model
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 197-204
%K evaluation of protocols and networks, timed token protocol,
availability driven multiple access (ADMA), server nodes (S-nodes),
client nodes (C-nodes),
%A Steve Benford
%Z Nottingham
%T Dynamic Definition of Entries and Attributes in the Directory Service
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 563-568
%K distributed system services, directory information tree (DIT),
directory information base (DIB), directory access protocol (DAP),
directory service agents (DSA), directory user agents (DUA),
%X sdb@cs.nott.ac.uk (pointer on page 206)
%A G. Harter
%A K. Geihs
%T An Accounting Service for Heterogeneous Distributed Environments
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 207-214
%K distributed system services, distributed academic computing (DAC),
network OS (DACNOS), remote service call (RSC),
%X Smells of IBM.
%A Douglas Comer
%A Jim N. Griffioen
%A Rajendra Yavatkar
%Z Dept. of Computer Sciences, Purdue University, W. Lafayette,
IN 47907-2004
%T Shadow Editing: A Distributed Service for Supercomputer Access
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 215-221
%r TR #722
%d 11/18/87
%K distributed system services,
%K Cypress, file diffs, ftp, file transfer, 9.6 Kb to 56. Kb/s,
flow control,
%X This paper has missed some of the other distributed editing work
at rutgers (1984?) and LLNL (emacs on PCs to Cray/CTSS).
%A Marina Roesler
%A Walter A. Burkhard
%A Kenneth B. Cooper
%Z UCSD
%T Efficient Deadlock Resolution for Lock-Based Concurrency
Control Schemes
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 224-233
%K distributed system algorithms, probes and antiprobes,
object management, transaction based, false deadlock detection,
%A Shyan-Ming Yuan
%A Ashok K. Agrawala
%Z Univ. of Maryland
%T A Class of Optimal Decentralized Commit Protocols
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 234-241
%K distributed system algorithms, message passing,
message complexity, finite automata, consensus protocols,
%A Jing-Jang Hwang
%A Yuan-Chieh Chow
%A Frank Anger
%T An Analysis of Multiprocessing Speedup with Emphasis on the
Effect of Scheduling Methods
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 242-248
%K distributed system algorithms, extended list scheduling (ELS),
earliest task first (ETF), efficiency loss,
%A Gail E. Kaiser
%A Simon M. Kaplan
%T Rapid Prototyping of Concurrent Programming Languages
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 250-255
%K concurrent programming languages, action equations, events,
unification, attribute grammar, synchronization, CSP,
%A Prasad Vishnubhotia
%Z OSU
%T Synchronization and Scheduling in ALPS Objects
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 256-264
%K concurrent programming languages, manager process,
hidden procedure array, object oriented, shared memory multiprocessor,
non-deterministic selection, concurrent execution,
reader-writers problem example, APLS/C
%A Gruia-Catalin Roman
%A H. Conrad Cunningham
%A Michael E. Ehlers
%Z Washington U., St. Louis
%T A Shared Dataspace Language Support Large-Scale Concurrency
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 265-272
%K concurrent programming languages, shared dataspace language (SDL),
content addressable, view mechanism, large-scale,
generative communication, transactions, programming style,
region labeling, property lists,
%A Bruno Ciciani
%A Daniel M. Dias
%A Philip S. Yu
%Z IBM TJW
%T Load Sharing in Hybrid Distributed - Centralized Database Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 274-281
%K performance studies, static, dynamic, simulation, queue length,
response time,
%A Rafael Alonso
%A Luis L. Cova
%Z Princeton
%T Sharing Jobs Among Independently Owned Processors
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 282-288
%K performance studies, load sharing, high mark, low mark policies,
SUN/Ethernet experiments/4.2 BSD,
%A Joel S. Emer
%A K. K. Ramakrishnan
%Z DEC
%T Performance Considerations for Distributing Services, A Case Study:
Mass Storage
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 289-297
%K performance studies, VAX/VMS, discontiguous file allocation,
simulation model, workload,
%A M. Spezialetti
%A J. P. Kearns
%T A General Approach to Recognizing Event Occurrences in
Distributed Computations
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 300-307
%K debugging, monitoring, stability, temporal perspective,
strategy classification, recognition delay, system state,
state holding, event holding, occurrence,
%A Peter Bates
%Z U. Mass.
%T Distributed Debugging Tools for Heterogeneous Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 308-315
%K debugging, monitoring, event based behavioral abstraction (EBBA),
simple cooperative debugging, Gutenberg system,
%X bates@cs.umass.edu
%A Barton P. Miller
%A Jong-Deok Choi
%Z University of Wisconsin-Madison
%T Breakpoints and Halting in Distributed Programs
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 316-323
%d July 1986
%r 648
%K debugging, monitoring,
%K Distributed Programming, Distributed Debugging, Halting
Algorithm, Distributed Breakpoints, simple predicates (SP),
disjunctive predicates (DP), linked predicates (LP),
conjunctive predicates (CP), consistent halting,
%A I. S. Bhandari
%A C. M. Krishna
%A D. P. Siewiorek
%T A Parallel Algorithm for Colouring Graphs
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 326-333
%K distributed system algorithms, Connection Machine,
%A Yao-Nan Lien
%T A New Node-Join-Tree Distributed Algorithm for
Minimum Weight Spanning Trees
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 334-340
%K distributed system algorithms, MST, tree-join-tree,
%A Atul Prakash
%A C. V. Ramamoothy
%Z UC Berkeley
%T Hierarchical Distributed Simulations
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 341-348
%K distributed system algorithms, asynchronous computation,
hierarchical decentralized time advancement algorithm,
%A Jack C. Wileden
%A George S. Avrunin
%Z U. Mass
%T Toward Automating Analysis Support for Developers of Distributed Software
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 350-357
%K analysis of distributed software systems, constrained expression.
%A Vijay Kumar Garg
%Z UC Berkeley
%T Analysis of Distributed Systems with Many Identical Processes
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 358-365
%K analysis of distributed software systems,
synchronous token based communicating state model (STOCS),
%A Cui-Qing Yang
%A Barton P. Miller
%T Critical Path Analysis for the Execution of
Parallel and Distributed Programs
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 366-373
%K analysis of distributed software systems, CPA,
program activity graph (PAG),
IPS, critical path method, activities, duration, PDM method,
Charlotte,
%A David P. Anderson
%Z UC Berkeley
%T A Software Architecture for Network Communications
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 376-383
%K protocols for reliable real-time systems,
real-time message streams (RMS), DASH, transport, queueing, multiplexing,
%A Wei Zhao
%A John A. Stankovic
%A Krithi Ramamritham
%T A Multi-Access Window Protocol for Transmission of Time Constrainted
Messages
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 384-392
%K protocols for reliable real-time systems, LS, model, simulation,
interference, centralized minimum laxity message transmitted first (CMI),
virtual time CSMA-L (VTCSMA),
%A J. P. Kearns
%A S. K. Park
%A J. A. Sjogren
%T Data Editing: Faster Convergence for Synchronous Approximate Agreement
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 393-400
%K protocols for reliable real-time systems,
fault tolerant control systems, hard real time constraints,
Monte Carlo simulation, adaptive halting, reliable dissemination,
%A Wael Bahaa-El-Din Hilal
%A Hui-Tung Yuen
%T Designing Large Electronic Mail Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 402-409
%K distributed systems applications,
%A Ralf Hinkel
%A Thomas Knieriemen
%A Ewald von\ Puttkamer
%Z Univ. of Kaiserslautern, FRG
%T An Application for a Distributed Computer Architecture -
Realtime Data Processing in an Autonomous Mobile Robot
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 410-417
%K distributed systems applications, AMR, MOBOT III,
%A J. Walpole
%A G. S. Balir
%A J. Malik
%A J. R. Nicol
%Z Univ. of Lancaster, UK
%T Maintaining Consistency in Distributed Software Engineering
Environments
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 418-425
%K distributed systems applications, SEE, COSMOS model, transactions,
object based, recovery, revision control,
%X A proposal rather than experience, or simulation.
%A Hector Garcia-Molina
%A Boris Kogan
%A Nancy Lynch
%T Reliable Broadcast in Networks with Nonprogrammable Servers
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 428-437
%K reliable multicast communication and replication,
communication transitivity, host parent graph, gap filling,
design (not experience nor simulation),
%A S. Navaratnam
%A S. Chanson
%A G. Neufeld
%Z Univ. of BC, Canada
%T Reliable Group Communication in Distributed Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 439-446
%K reliable multicast communication and replication, IPC,
process group, V, UGSEND, OGSEND, failure detection and recovery,
%A Keith Marzullo
%A Frank Schmuck
%Z Cornell
%T Supplying High Availability with a Standard Network File System
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 447-453
%K reliable multicast communication and replication, fail-stop,
SUN NFS, RNFS, state machine approach, ISIS, fHandle, rHandle,
%X Note the appendix with this paper.
%A Robbert van\ Renesse
%A Andrew S. Tanenbaum
%Z Vrije Univ., Netherlands
%T Voting with Ghosts
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 457-462
%K techniques for improving data availability, VWG, weighted voting (WV),
available copies (AC),
%X A design with limited simulation. Note the appendix with this paper.
%A Xiaolin Du
%A Fred J. Maryanski
%Z Univ. of Conn.
%T Data Reorganization in a Dynamically Reconfigurable Environment
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 463-470
%K techniques for improving data availability, non-blocking,
dynamic system prototype: driftwood, recovery, schedule, design
%A Daniel Barbara
%A Hector Garcia-Molina
%A Bernardo Feijoo
%T Exploiting Symmetries for Low-Cost Comparison of File Copies
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 471-479
%K techniques for improving data availability,
triple modularly redundant (TMR),
%X Compared with Metzner and Fuchs (2 different) strategies.
%A Spiridon Pulidas
%A Don Towsley
%A John A. Stankovic
%Z U. Mass.
%T Imbedding Gradient Estimators in Load Balancing Algorithms
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 482-490
%K load balancing, threshold policies, incremental job delay,
local and remote job arrival, decentralized model,
M/G/1/T with T=(T sub l, T sub r)
%X Imbedding => Embedded
%A Donald Ferguson
%A Yechiam Yemini
%A Christos Nikolaou
%Z IBM TJW
%T Microeconomic Algorithms for Load Balancing in
Distributed Computer Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 491-499
%K load balancing, bids, auction resources, update prices, advertising,
Columbia University's Network Simulation Testbed (NEST), sealed bids,
Dutch Auction,
%A Flavio Bonomi
%A Anurag Kumar
%Z AT&T, Bell Labs, Holmdel, NJ
%T Adaptive Optimal Load Balancing in a Heterogeneous Multiserver System
with a Central Job Scheduler
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 500-508
%K load balancing, Poisson, least square minimization problem,
idle server time measurement, stochastic root finding,
simple stochastic approximation algorithm,
%A P. Bodorik
%A J. S. Riordon
%T Evaluating Dynamic Processing of Distributed Queries
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 510-519
%K analysis of distributed query processing, distributed data base (DDB),
query processing, dynamic modeling,
%A Phillip C. Sheu
%A R. L. Kashyup
%Z Purdue
%T Query Optimization in Distributed Logic-oriented Object Bases
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 520-527
%K analysis of distributed query processing, semi-join,
algorithmic proposal,
%A W. S. Luk
%A Xiao Wang
%A Franky Ling
%Z Simon Fraser U., B.C., Canada
%T On the Communication Cost of Distributed Database Processing
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 528-535
%K analysis of distributed query processing, V-system,
concurrent transmission of messages, distributed selection-sort,
distributed quicksort, load sharing,
%X Note the appendix with this paper.
%A Roland R. Mielke
%A John, W. Stoughton
%A Sukhamoy Som
%Z Old Dominion U., Norfolk
%T Modeling and Performance Bounds for Concurrent Processing
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 538-544
%K multiprocessor system modeling,
Algorithm to Architecture Mapping Model (ATAMM), Petri net marked graphs,
algorithm marked graphs (AMG), node marked graph (NMG),
computational marked graph (CMG),
%A S. M. R. Islam
%A H. H. Ammar
%Z Clarkson, Univ., Potsdam, NY
%T Performance Analysis of Degradable Multiprocessor Systems using
TIme Scale Decomposition of GSPNs
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 545-553
%K multiprocessor system modeling, TSD,
Generalized Stochastic Petri Nets,
stochastically discontinuous markov process (SDMP),
aggregated stochastic petri net (ASPN), reachability,
%A W. Najjar
%A J.-L. Gaudiot
%Z USC
%T Network Disconnection in Distributed Systems
%J 8th International Conference on Distributed Computing Systems
%I IEEE Computer Society
%C San Jose, CA
%D June 1988
%P 554-561
%K multiprocessor system modeling, network fault tolerance,
network resilience measure, initial disconnection probability,
Monte Carlo simulation, ILLIAC type mesh, binary n-cube, random graph,
single-node disconnection probability, degradation level measure,
coverage factor,