Advances in Computing and Information — ICCI '90: International Conference on Computing and Information Niagara Falls, Canada, May 23–26, 1990 Proceedings

534 Pages·1990·12.256 MB·English

by  S. G. Akl, F. Fiala, W. W. Koczkodaj (eds.)

Lecture Notes ni
Computer Science
detidE yb .G Goos dna .J sinamtraH
468
S.G. Akl E Fiala
W.W. Koczkodaj ).sdE(
Advances ni Computing
dna noitamrofnI -ICC! '90
lanoitanretnI ecnerefnoC no Computing noitamrofnI dna
aragaiN ,sllaF ,adanaC yaM 23-26, 0991
sgnideecorP
Springer-Verlag
nilreB grebledieH New kroY nodnoL
siraP oykoT Kong Hong anolecraB
Editorial Board
D. Barstow W. Brauer R Brinch Hansen D. Gries D. Luckham
C. Moler A. Pnueli G. SeegmLiller .J Stoer N. Wirth
VolumeE ditors
Selim G. Akl
Department of Computing and Information Science
Queen's University
Kingston, Canada K7L 3N6
Frantisek Fiala
School of Computer Science
Carleton University
Ottawa, Canada K1S 5B6
Waldemar W. Koczkodaj
Department of Mathematics and Computer Science
Laurentian University
Sudbury, Canada P3E 2C6
ICCI '90w as organized in cooperation with IEEE Hamilton Section and sponsored
by the Natural Sciences and Engineering Research Council of Canada (NSERC),
Carleton University in Ottawa and Laurentian University in Sudbury
CR Subject Classification (1987): D.1-2, E.2-4, E0-2, H, 2.1
ISBN 3-540-53504-7 Springer-Verlag Berlin Heidelberg NewYork
ISBN 0-387-53504-7 Springer-Verlag New York Berlin Heidelberg
rights All copyright. to subject is work This era ,devreser the of part or whole the whether lairetam
rights the specifically concerned, is of ,noitalsnart re-use reprinting, of illustrations, ,noitaticer
,gnitsacdaorb on reproduction smliforcim and ways, other in or egarots in data .sknab noitacilpuD
thereof parts or publication this of si only dettimrep the under snoisivorp of the namreG Copyright
waL September of ,9 ,5691 current its in ,noisrev dna copyright a eef always must eb .diap
snoitaloiV of act prosecution the under fall eht namreG Copyright .waL
© galreV-regndpS Heidelberg Berlin 0991
in Printed ynamreG
Printing dna Beltz, Druckhaus binding: .rtsgreBlhcabsmeH
012345-0413/5412 - Printed no paper acid-free
Preface
This volume contains papers presented at the International Conference on
Computing and Information, ICCI'90, held in Niagara Falls, Ontario, Canada, May
23-26, 1990. All papers have been reviewed by at least two independent referees
nominated by the Program Committeem embers. A full list of referees is enclosed (p.
.)825
ICCI'90 was an international forum for the presentation of new results in
research, development, and applications in computing and information. The primary
goal of the meeting was to promote an exchange of ideas and cooperation between
practitioners and theorists in thei nterdisciplinary fields of computing, communication
and information theory.
The conference was organized along four streams:
A - Information and Coding Theory, Statistics and Probability
- B Foundations of Computer Science, Theory of Algorithms and Programming
C - Concurrency, Parallelism, Communications, Networking, Computer
Architecture and VLSI
D - Data and Software Elngineering, Database, Expert Systems, Information Systems,
Decision Making and AI Methodologies
The contribution of each stream to the success of the conference was noticeable.
In fact, each stream was a kind of subconference and consisted of theoretical papers as
well as presentations on performance issues and implementation techniques.
General Chair was F. Fiala, Carleton University, Canada.
Organizing Committee:
W.W. Koczkodaj, Laurentian University, Canada, Chair
M.W. Herman, Laurentian University, Canada
G. Steinke, University of Passau, Germany
Stream Chairs:
Stream - A David Chiu, University of Guelph, Canada
Stream - B Lane A. Hemachandra, University of Rochester, USA
Stream C - R.P. Hopkins, University of Newcastle upon Tyne, UK
Stream D - Jaretta H. and G. Daryl Nord, Oklahoma State University, USA
The ICCI'90 Program Committee:
S.G. Ald, Queen's University, Canada, Chair
M. Cosnard, el~xcE Normale Superieure de Lyon, France
K. Culik, University of South Carolina, USA
M. EI-Gabaly, Kuwait University, Kuwait
J. Grant, Towson State University, USA
M.A.W. Houtsma, University of Twente, The Netherlands
VI
M.E.C. Hull University of Ulster at Jordanstown, UK
P.L. Kannappan, University of Waterloo, Canada
R.L. Kashyap, Purdue University, USA
V. Kumar, University of Missouri-Kansas CityU,S A
M.A. Langston, University of Tennessee, USA
H. Meijer, Queen's University, Canada
W. Oettli, University of Mannheim, Germany
M.M. Orlowska, University of Queensland, Australia
R.A. Paige, Courant Inst. of Math. ScienUcSeAs ,
W. SmythM,c Master University, Canada
Ch. Stary, Institute for Applied Informatics, Austria
I. Stojmenovic, University of Ottawa, Canada
Ph.C. Treleaven, University College LondonU,K
Ch.T. Zahn, Pace University, USA
Electronic Mail Contacts:
For Asia and Australia - D. J. Chen, NationalC hiao Tung University, Taiwan ROC,
For Canada - Lixin Tao, Concordia University, Canada,
For Europe - Kai Jakobs, Technical University of Aachen, Germany,
For USA and South America - Manuel Bermudez, University of Florida, USA.
We wish to express our sincere gratitude to K. Peacock, the Chairman of IEEE
Hamilton Section, .S Swing, the Vice-Chairman of IEEE Hamilton Section, D.
Goldsack, the Dean of Science, L. Reed, the Vice-PresidenRte,s earch, and M. Dewson,
the Vice-President, Academic at Laurentian University. A special appreciation is
forwarded to them as they havebeen a true source of support and encouragement in
organizing the conference. We thank M.A. Langston, University of Tennessee, W.
Smyth, McMaster University, and I. Stojmenovic, University of Ottawa, for their
considerable contribution to the reviewing process. R.C. Kick, Tennessee
Technological University and M. Bermudez, University of Florida, have provided their
help in coordinating presentations during the event in Niagara Falls. We thank H.
Jurgensen for his editorial remarks and we would like to express our gratitude and
appreciation to volunteers: L. Bermudez, D. Fiala, and M. Koczkodaj for their
assistance in registration and information services.
Many other people were involved in the organization of ICCI'90 and we wish to
thank each and every one otfh em.
Selim G. Akl
Francisek Fiala
Waldemar W. Koczkodaj
Sudbury, June 1990
Table of Contents
1. Summaries of Invited Lectures . . . . . . . . . . . . . . . . . . . . . . 1
2. Theory of Computing, Algorithms and Programming . . . . . . . . . . 13
R.S. Maier - The Asymptotic Evolution of Data Structures . . . . . . . . . . . . 14
J.D.P. Rolim - On the Formal Aspects of Approximation Algorithms ........ 24
E. Eberbach - Selected Aspects of the Calculus of Self-Mocfifi~le Algorithms Theory 34
J.G. Geske, D. Kakihara -Almost-Everywhere Complexity, Bi-Immunity and
Nondeterministic Space . . . . . . . . . . . . . . . . . . . . . . . . . 44
D. Sheinwald, R.C. Pasco - Deriving Deterministic Prediction Rules from
Reduction Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
W. Pugh - Probabilistic Analysis of Set Operations With Constant-time Set Equality
Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
C.S. Wallace - Classification by Minimum-Message-Length Inference ....... 72
F. Henglein - Left-Linear Semi-Unification Fast . . . . . . . . . . . . . . . . 82
T. Jiang - On the Complexity of (Off-line) 1-tape ATM" s Running in Constant
Reversals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
P. Dietz, R. Raman A - Constant Update Time Tree Finger Search ........ 100
R.A. Baeza-Yates, G.H. Gonnet - Average Case Analysis of Algorithms using
Matrix Recurrences . . . . . . . . . . . . . . . . . . . . . . . . . . 110
A.P. Heinz - Finding Two-Tree-Factor Elements of Tableau-Defined Monoids in
Time O(n )3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
J.V. Tucker, J.I. Zucker - General a Theory Toward of Computation and
over Specification Abstract Data Types . . . . . . . . . . . . . . . . . . . 129
I.A. Stewart - Using The Hamiltonian Path Operator To Capture NP ....... 134
J. Wang - Some Remarks on Polynomial Time Isomorphisms ........... 144
A.K. Singh - An Axiomatization of Wait-Freedom and Low-Atomicity ....... 154
R. Harrison, H. Glaser - The Gamma Model Functional a as Programming Tool . . 164
A.A. Toptsis, C.T. Yu, P.C. Nelson - Computing the Transitive Closure of
Symmetric Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . 174
IV
3. Data and Software Engineering . . . . . . . . . . . . . . . . . . . . 185
K.-C. Liu - An Environment for Information System Prototyping: A System
Simulation Approach . . . . . . . . . . . . . . . . . . . . . . . . . . 186
V. Yodaiken A - Logic-free Method for Modular Composition of Specifications .... 196
K. Okamoto, M. Hashimoto - On Real-Time Program Specification Description
with Data Model-Based a Language . . . . . . . . . . . . . . . . . . . . 206
W. Ogryczak, K. Studzinski, K. Zorychta - DINAS: Computer-Assisted System
for Multi-Criteria Transportation and Location Analysis ........... 216
S. Khanna- Logic Programming for Software Testing . . . . . . . . . . . . . . 225
S.M. Chun$- Concatenated Block Code Word Surrogate File for Partial Match
Retrieval . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235
D.A. Swayne, J. Storey, D. C.-L Lam, I. Wong, A.S. Fraser- Applications
Development s'tiklooT Environmental For Modelling and Monitoring ...... 245
M. Brown, B. Czejdo A - Hypertext for Literate Programming .......... 250
G. Steinke, G. Hamann - Ethics and Computers: Can Universities Set the
Standards? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
W. Boswell, A.L. Tharp - Alternatives tthoe B+-tree . . . . . . . . . . . . . . 266
V.G. Winters - Minimal Perfect Hashing Large For Sets of Data ......... 275
M.T. Ozsu, K. Barker - Architectural Classification and Transaction Execution
Models of Multidatabase System . . . . . . . . . . . . . . . . . . . . . 285
H.J.A. van Kuijk, F.H.E. Pijpers, P.M.G. Apers - Semantic Query optimization in
Distributed Databases . . . . . . . . . . . . . . . . . . . . . . . . . 295
V.Y. Lum, K. Meyer-Wegener- An Architecture for a Multimedia Database
Management System Supporting Content Search . . . . . . . . . . . . . . 304
H.H. Zhou - Adaptive Expert Systems and Analogical Problem Solving ...... 314
J. Place, V. Kumar, A. van de Liefvoort - The Behavior of Concurrency Database
Control Mechanisms under Bursty Arrivals . . . . . . . . . . . . . . . . . 324
4. Computer Architecture, Concurrency, Parallelism, Communication and
Networking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 335
P.W. Proszynski - The Concurrency Core . . . . . . . . . . . . . . . . . . . 336
A. Colbrook, C. Smythe - Concurrent Data Structures . . . . . . . . . . . . . 346
J. Julliand, G.-R. Perrin - Asynchronous Programs Functional Parallel ....... 356
J.-M. Adamo, C. Bonello - Symbolic Configuration for SuperNode Multiprocessors . 366
Vii
W. Zhou, B. Molinari A - Model of Execution Time Estimating for RPC-Oriented
Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 376
M. Lu - Parallel Computation of Longest-Common-Subsequence . . . . . . . . . . 385
C. C.-Y. Chen, S. K. Das - Parallel Breadth-First and Breadth-Depth Traversals of
General Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 395
B. Yu - Parallelism via Speculation in Pure Prolog . . . . . . . . . . . . . . . 405
K. Saleh, R. Probert - Synthesis of Error-Recoverable Protocol Specifications from
Service Specifications . . . . . . . . . . . . . . . . . . . . . . . . . . 415
S.K. K2m A - Parallel Algorithm for Path-Min Queries in Trees . . . . . . . . . . 425
L. Chen - Efficient Deterministic ParaUel Algorithms for lnteger Sorting ...... 433
C.D. Marlin, M. Oudshoorn, D. Freidel A - Model of Communication in Ada
using Shared Data Abstractions . . . . . . . . . . . . . . . . . . . . . 443
Z.-Q. Luo - Communication Complexity of Computing a Collection of Rational
Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
G.H. Masa~ati, H. Ural - Electing a Leader in a Synchronous Recursively Scalable
Networr . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 463
J.R. Just - Analysis of a Self-Reconfigurating Process of Fault-Tolerant Distributed
Computing Systems . . . . . . . . . . . . . . . . . . . . . . . . . . 473
T.A. Marsland, L. Meng - Control of Bottlenecks in a Network Database Machine . 483
B. Klaassen A - Hierarchical Multirate Method for Circuit Simulation on Parallel
Computers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493
M.H. Nodine, D.P. Lopresti, J.S. Vitter -//O Overhead and Parallel VLSI
Architectures for Lattice Computations . . . . . . . . . . . . . . . . . . 497
D.D. Sherlekar - Optimality of Gauge and Degree-sensitive VLSI layouts of Planar
Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 507
C. Chevli, H.Y. Youn - An Efficient VLSI Network Bridge Architecture for Local
AreaNetworks . . . . . . . . . . . . . . . . . . . . . . . . . . . . 517
Index of Authors . . . . . . . . . . . . . . . . . . . . . . . . . . . . 527
List of Reviewers . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528
1. Summaries of Invited Lectures
Keynote Address outline
Education for Computing Professionals
David Lorge Parnas
Queen's University, Kingston, Ontario
I. Computing Professionals areI nformation System Engineers
In this information age, computers should be viewed as links in a communication
system. They serve to transform information from the form in which it was produced
to the form in which it is needed. Those who produce such systems should be viewed
as engineers, not scientists.
It is time to ask whether Computing Science undergraduate education is in the
best interests of the students, their employers, and society.
II. The Historical Debate
In the early 60's, there was strong opposition to the establishment of Computing
Science as a separate discipline; both mathematicians and Electrical Engineers
predicted that graduates of Computing Science programs would understand neither
mathematics nor engineering. Their predictions deserve reexamination.
III. Computing Scientists: MathematiciansE,n gineers, or Scientists?
Today, I am appalled at the inability of many Computing Science graduates to
use basic mathematics. Computing Science graduates have heard about a lot of
mathematics, but they don't know how to use it.
Further, many of those who work in the more practical areas of Computing
Science seem to lack appreciation for the routine systematic analysis that is essential to
professional engineering.
In CoMputing Science theory and practice have diverged. While classical
mathematical topics, such as graph theory, continue to have applications in
computing, most of what is taught in Computing Science 'theory" courses is not
relevant in the practical areas.
W. Computing Science Education
Graduates of Computing Science programs are weak on fundamentals because
they spend too much time on programming, programming languages, compilers and
operating systems. Most Computing Sdence graduates confuse existence-proofs with
products, and toys with useful tools.
Many Computing Sdence graduates are almost completely ignorant of
information theory. As a result, analysis of important practical issues, such as the
design of data representations, is donoen an intuitive level.
Reliability requirements force the introduction of redundancy in computer
systems. Unfortunately, current Computing Science graduates are usually unfamiliar
with all but the most naive approaches to redundancy.
Many Computing Science graduates end up programmingparts of control
systems, such as those that run nuclear plants or adjust flight surfaces on aircraft.
Unfortunately, I do not know of a single Computing Science program that requires its
students to take a course in control theory.
V. What went wrong?
Most Computing Science departments were formed by a multi-disciplinary team.
The members of the team were mathematicians interested in computing, electrical
engineers who had built or used computers, and physicists who had been computer
users. The set of topics that was included was often the intersection of what the
founders knew, not the union. Further, the educational programs were designed
around the interests of the faculty rather than the needs of the students.
VI. An Engineering Program for Computing Professionals
I still believe that a special educational program for computing professionals is
needed. When I look at the programs produced by Engineers and Scientists who did
not have such an education, I see that they are not prepared to apply engineering
discipline to software design.
In [1], I propose a curriculum designed to draw heavily on the offerings of other
departments and to emphasise mature fundamentals. The proposal in [1] is intended
to start a discussion, not to be the final word.
VII. Conclusions
The program I propose will not produce people who can immediately take over
the responsibilities of an employee who has left or been promoted. That is not the role
of a University. Universities need notb e teaching the latest technology. Our graduates
need the fundamentals that prepare them for a lifetime of learning to understand the
latest technology.
VIILReference
]1[ Parnas, D.L., "Education for Computing Professionals", IEEE Computer, vol.
23, no. ,1 January 1990, pp. 17-22.