%R Ultracomputer Note UC
%T Ultracomputers
%A Jacob T. Schwartz
%D March 1979

%R Ultracomputer Note #1
%T Bitonic Sort on Ultracomputers
%A Lambert Meertens
%D March 1979

%R Ultracomputer Note #2
%T Recurrent Ultracomputers are not log N-Fast
%A Lambert Meertens
%D March 1979

%R Ultracomputer Note #3
%T Preliminary Thoughts on Ultracomputers Programming Style
%A Jacob T. Schwartz
%D March 1979

%R Ultracomputer Note #4
%T A Remark on Nearly Planar Embeddings of Small Ultracomputers
%A Jacob T. Schwartz
%D December 1979

%R Ultracomputer Note #5
%T The Burroughs FMP Machine
%A Jacob T. Schwartz
%D January 1980

%R Ultracomputer Note #6
%T Observations Concerning Multidimensional Ultracomputers
%A Clyde Kruskal
%A Larry Rudolph
%D January 1980

%R Ultracomputer Note #7
%T A Data Motion Algorithm
%A Allan Gottlieb
%A Clyde Kruskal
%D January 1980

%R Ultracomputer Note #8
%T A Remark on the Planarity of the Shuffle-Exchange Network of Sizes 16
and 32
%A Larry Rudolph
%D February 1980

%R Ultracomputer Note #9
%T Another Remark on the Planarity of the Shuffle-Exchange Network of
Sizes 16 and 32
%A Allan Gottlieb
%D May 1980

%R Ultracomputer Note #10
%T PLUS - A PL/I Based Ultracomputer Simulator, I
%A Allan Gottlieb
%D September 1980

%R Ultracomputer Note #11
%T Complexity Results for Permuting Data and Other Computations on
Parallel Processors
%A Allan Gottlieb
%A Clyde Kruskal
%D April 1984

%R Ultracomputer Note #12
%T Washcloth - The Logical Successor to Soapsuds
%A Allan Gottlieb
%D December 1980
%O Also Computer Science Technical Report #29.

%R Ultracomputer Note #13
%T MOP - A (Minimal) Multiprocessor
%A Allan Gottlieb
%D December 1980

%R Ultracomputer Note #14
%T Plus:  A PL/I Based Ultracomputer Simulator, II
%A Allan Gottlieb
%D November 1980

%R Ultracomputer Note #15
%T MULT - A Multitasking Ultracomputer Language with Timing, I & II
%A Allan Gottlieb
%A Clyde Kruskal
%D December 1980

%R Ultracomputer Note #16
%T Basic Techniques for the Efficient Coordination of Very Large Numbers of
Cooperating Sequential Processors
%A Allan Gottlieb
%A B.D. Lubachevsky
%A Larry Rudolph
%D April 1983

%R Ultracomputer Note #17
%T Comments on Concurrent Search and Insertion in AVL Trees
%A Allan Gottlieb
%D October 1981

%R Ultracomputer Note #18
%T Remarks on Efficient Numerical Algorithms for Ultracomputers
%A Charles S. Peskin
%A Olof B. Widlund
%D January 1981

%R Ultracomputer Note #19
%T Ultracomputer Implementation of Odd-Even Reduction
%A Charles S. Peskin
%D January 1981

%R Ultracomputer Note #20
%T A Comparison of Ultracomputer Architecture and Lattice Architecture
for Problems on Lattices
%A Charles S. Peskin
%D January 1981

%R Ultracomputer Note #21
%T Washcloth 81
%A Allan Gottlieb
%D January 1981

%R Ultracomputer Note #22
%T Atmospheric Computations on Highly Parallel MIMD Computers
%A Norman Rushfield
%D February 1981

%R Ultracomputer Note #23
%T Converting Scientific Codes to Run Under the Washcloth Simulator
%A David Korn
%D March 1981

%R Ultracomputer Note #24
%T Timing Analysis for Codes Run Under the WASHCLOTH Simulator
%A David Korn
%D March 1981

%R Ultracomputer Note #25
%T Networks and Algorithms for Very Large Scale Parallel Computation
%A Allan Gottlieb
%A Jacob T. Schwartz
%D August 1981

%R Ultracomputer Note #26
%T Supersaturated Paracomputer Algorithms
%A Clyde Kruskal
%D May 1981
%O Also Computer Science Technical Report #31.

%R Ultracomputer Note #27
%T Molecular Simulations of Equilibrium Properties
%A Malvin Kalos
%A Gabi Leshem
%A B.D. Lubachevsky
%D February 1982

%R Ultracomputer Note #28
%T NETSIM Network Simulator for the Ultracomputer
%A Marc Snir
%D May 1981

%R Ultracomputer Note #29
%T Lower Bounds on VLSI Implementations of Communication Networks
%A Marc Snir
%D May 1981
%O Also Computer Science Technical Report #32.

%R Ultracomputer Note #30
%T Scientific Calculations on the Ultracomputer
%A Malvin Kalos
%D September 1981

%R Ultracomputer Note #31
%T Timing Simulations for Elliptic PDE's Run Under WASHCLOTH
%A David Korn
%D June 1981

%R Ultracomputer Note #32
%D OUT OF PRINT

%R Ultracomputer Note #33
%T Verification of Several Parallel Coordination Primitives Based on
Descriptions of Their Reachability Sets
%A B.D. Lubachevsky
%D July 1981
%O Also Computer Science Technical Report #36.

%R Ultracomputer Notes #34
%T Coordination Parallel Processors:  A Partial Unification
%A Allan Gottlieb
%A Clyde Kruskal
%D September 1981

%R Ultracomputer Note #35
%T Review of Soviet Publications on Parallel Data Processing
%A B.D. Lubachevsky
%D September 1981

%R Ultracomputer Note #36
%T An Historical Guide to the Ultracomputer Literature
%A Allan Gottlieb
%D September 1981

%R Ultracomputer Note #37
%T A Parallel Computer Implementation of the Ascend/Descend Types of
Vector Algorithms
%A B.D. Lubachevsky
%D December 1981

%R Ultracomputer Note #38
%T Comments on Lens and Hypetrees - or the Perfect-Shuffle Again
%A Marc Snir
%D January 1982

%R Ultracomputer Note #39
%T The Ultraswitch - A VLSI Network Node for Parallel Processing
%A Marc Snir
%A Jon A. Solworth
%D January 1984

%R Ultracomputer Note #40
%D Superseded by Ultracomputer Note #100, ``An Overview of the NYU Ultracomputer Project''

%R Ultracomputer Note #41
%T The Performance of Multistage Interconnection Networks for Multiprocessors
%A Clyde Kruskal
%A Marc Snir
%D December 1983

%R Ultracomputer Note #42
%T Parallelizing an Algorithm of Charles S. Peskin for describing
Incompressible Flow for a Fluid Coupled to an Elastic Membrane
%A B.D. Lubachevsky
%D May 1982

%R Ultracomputer Note #43
%T Wireability of an Ultracomputer
%A Ronald Bianchini
%A Ronald Bianchini Jr.
%D June 1982

%R Ultracomputer Note #44
%T On Parallel Searching
%A Marc Snir
%D June 1982
%O Also Computer Science Technical Report #45.

%R Ultracomputer Note #45
%T An Approach to Automating the Verification of Compact Parallel
Coordination Programs
%A B.D. Lubachevsky
%D February 1982

%R Ultracomputer Note #46
%T Monte Carlo Transport Calculation on an Ultracomputer
%A Malvin Kalos
%A Y-Q. Zhong
%D March 1983

%R Ultracomputer Note #47
%T RINSE - What follows WASHCLOTH
%A Herbert J. Bernstein
%A Max Goldstein
%D March 1983

%R Ultracomputer Note #48
%T The NYU Ultracomputer
%A Malvin Kalos
%D April 1983

%R Ultracomputer Note #49
%T An Approach to Automating the Verification of Compact Parallel Coordination
Programs, II
%A B.D. Lubachevsky
%D February 1983
%O Also Computer Science Technical Report #64.

%R Ultracomputer Note #50
%T On Choice of A Model of Parallel Computation
%A Uzi Vishkin
%D February 1983
%O Also Computer Science Technical Report #61.

%R Ultracomputer Note #51
%T O(log n) and Optimal Parallel Biconnectivity
%A Robert E. Tarjan
%A Uzi Vishkin
%D February 1983
%O Also Computer Science Technical Report #69.

%R Ultracomputer Note #52
%T Parallel Computation on 2-3 Trees
%A W. Paul
%A U. Vishkin
%A H. Wagener
%D September 1983
%O Also Computer Science Technical Report #70.

%R Ultracomputer Note #53
%T Synchronous Parallel Computation - A Survey
%A Uzi Vishkin
%D April 1983
%O Also Computer Science Technical Report #71.

%R Ultracomputer Note #54
%T Dynamic Parallel Memories
%A Uzi Vishkin
%A Avi Wigderson
%D June 1983

%R Ultracomputer Note #55
%T Washcloth Simulation of Three-Dimensional Forecasting Codes
%A David Korn
%A Norman Rushfield
%D May 1983

%R Ultracomputer Note #56
%T Trade-Offs Between Depth and Width in Parallel Computation
%A Uzi Vishkin
%A Avi Wigderson
%D September 1983

%R Ultracomputer Note #57
%T An Ultracomputer Switch Design Using Circuit and Packet Switching
%A Malcolm C. Harrison
%D June 1983

%R Ultracomputer Note #58
%T A Parallel Design Distributed Implementation (PDDI) General Purpose
Computer
%A Uzi Vishkin
%D June 1983
%O Also Computer Science Technical Report #96.

%R Ultracomputer Note #59
%T Granularity of Parallel Memories
%A Kurt Mehlhorn
%A Uzi Vishkin
%D October 1983
%O Also Computer Science Technical Report #89.

%R Ultracomputer Note #60
%T Comparing the NYU Ultracomputer with other Large-Scale Parallel Processors
%A Allan Gottlieb
%D November 1983

%R Ultracomputer Note #61
%T Optimal Parallel Generation of a Computation Tree Form
%A Ilan Bar-on
%A Uzi Vishkin
%D October 1983
%O Also Computer Science Technical Report #90.

%R Ultracomputer Note #62
%T Avoiding Serial Bottlenecks in Ultraparallel MIMD Computers
%A Allan Gottlieb
%D March 1984

%R Ultracomputer Note #63
%T The Ultracomputer as a Vehicle for Polymer Simulations
%A Marvin Bishop
%D October 1983

%R Ultracomputer Note #64
%T An Optimal Parallel Algorithm for Selection
%A Uzi Vishkin
%D December 1983
%O Also Computer Science Technical Report #106.

%R Ultracomputer Note #65
%T Lucid-Boxes vs. Black-Boxes
%A Uzi Vishkin
%D September 1983

%R Ultracomputer Note #66
%T Randomized Speed-ups in Parallel Computation
%A Uzi Vishkin
%D February 1984
%O Also Computer Science Technical Report #107.

%R Ultracomputer Note #67
%T An Efficient Parallel Strong Orientation
%A Uzi Vishkin
%D February 1984
%O Also Computer Science Technical Report #109.

%R Ultracomputer Note #68
%T Queuing Delay Modeling for Multistage Interconnection Multiprocessor
Networks
%A Paul G. Spirakis
%D January 1984
%O Also Computer Science Technical Report #114.

%R Ultracomputer Note #69
%T A Taxonomic Table of Parallel Computers, Based on 55 Designs
%A Jacob T. Schwartz
%D December 1983

%R Ultracomputer Note #70
%T Simulating Shared-Memory Parallel Computers
%A Seth Abraham
%A Allan Gottlieb
%A Clyde Kruskal
%D April 1984

%R Ultracomputer Note #71
%T Synchronous Combining of Fetch and Add Operations
%A Malcolm C. Harrison
%D April 1984

%R Ultracomputer Note #72
%T Image Processing on the NYU Ultracomputer
%A Robert A. Hummel
%D November 1984

%R Ultracomputer Note #73
%T Finding Euler Tours in Parallel
%A Mikhail Atallah
%A Uzi Vishkin
%D May 1984
%O Also Computer Science Technical Report #134.

%R Ultracomputer Note #74
%T Optimal Parallel Pattern Matching in Strings
%A Uzi Vishkin
%D August 1984
%O Also Computer Science Technical Report #135.

%R Ultracomputer Note #75
%T PLISP User's Manual
%A Arzit Yannei
%D September 1984

%R Ultracomputer Note #76
%T Design Alternatives for Ultraperformance Parallel Computers
%A Jacob T. Schwartz
%D May 1984

%R Ultracomputer Note #77
%T A Remark on "A Variable Length Shift Register"
%A Allan Gottlieb
%D October 1984

%R Ultracomputer Note #78
%D Superseded by Ultracomputer Note #100, ``An Overview of the NYU Ultracomputer Project''

%R Ultracomputer Note #79
%T A Brief Update on the NYU Ultracomputer
%A Allan Gottlieb
%D March 1985
Reprinted with permission from IEEE SOFTWARE

%R Ultracomputer Note #80
%T Fast Probabilistic Techniques for Dynamic Parallel Addition, Parallel
Counting, and the Processor Identification Problem
%A Paul G. Spirakis
%D November 1984

%R Ultracomputer Note #81
%T Highly Parallel Ada - Ada on an Ultracomputer
%A Edith Schonberg
%A Edmond Schonberg
%D February 1985
Published - ??

%R Ultracomputer Note #82
%D OUT OF PRINT

%R Ultracomputer Note #83
%T Monte Carlo Methods and the Computer of the Future
%A Malvin Kalos
%D April 1985
"Invited talk at conference on Algorithms, Architecture, and Computers
of the Future held at the University of Texas at Austin, March, 1985."

%R Ultracompute Note #84
%D OUT OF PRINT

%R Ultracomputer Note #85
%T A VLSI Combining Network for the NYU Ultracomputer
%A Susan Dickey
%A Richard Kenner
%A Marc Snir
%A Jon Solworth
%D June 1985
Reprinted from IEEE PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON
COMPUTER DESIGN, October 7, 1985.

%R Ultracomputer Note #86
%T Optimal VLSI Circuits for Sorting
%A Richard Cole
%A Alan Siegel
%D September 1985
%O Also Computer Science Technical Report #172.
JACM 4(1988), 777-809.

%R Ultracomputer Note #87
%T Connected Component Labeling in Image Processing with MIMD Architectures
%A Robert Hummel
%A Alan Rojer
%D July 1985
%O Also Computer Science Technical Report #87 and Robotics Report #49.
Published - A modified version appears as a chapter in a book (Rojers
contribution not included) : Connected component labeling in image
processing with MIMD architectures.  Intermediate-level Image
Processing.  M.J.B. Duff.  Bonas, France.  Academic Press, 1986.

%R Ultracomputer Note #88
%T Process-Level, Time-Driven, Simulation of a Computer Network on a 
Parallel Shared-Memory Processor
%A B.D. Lubachevsky
%A K.G. Ramakrishn
%D October 1983

%R Ultracomputer Note #89
%T Deterministic Coin Tossing With Applications to Optimal Parallel List
Ranking
%A Uzi Vishkin
%A Richard Cole
%D September 1985
%O Also Computer Science Technical Report #175.
Information and Control, 1(1986), 206-219.

%R Ultracomputer Note #90
%T Lower bounds on Communication Complexity in VLSI
%A Richard Cole
%A Alan Siegel
%D December 1985
%O Also Computer Science Technical Report #192.
No publication to date

%R Ultracomputer Note #91
%D Superseded by Ultracomputer Note #100, ``An Overview of the NYU Ultracomputer Project''

%R Ultracomputer Note #92
%D Superseded by Ultracomputer Note #100, ``An Overview of the NYU Ultracomputer Project''

%R Ultracomputer Note #93
%T An Implementation of a Combining Network for the NYU Ultracomputer
%A Susan Dickey
%A Richard Kenner
%A Marc Snir
%D January 1986
Not Published 

%R Ultracomputer Note #94
%D Superseded by Ultracomputer Note #100, ``An Overview of the NYU Ultracomputer Project''

%R Ultracomputer Note #95
%T Query Processing in a Symmetric Parallel Environment
%A Dennis Shasha
%D January 1986
%O Also Computer Science Technical Report #197
Not Published

%R Ultracomputer Note #96
%T Efficient and Correct Execution of Parallel Programs That Share Memory
%A Dennis Shasha
%A Marc Snir
%D March 1986
%O Also Computer Science Technical Report #206.
Published in:
  ACM Transactions on Programming Languages and Systems, 
vol. 10, no.2, pp. 282-312, April, 1988.

%R Ultracomputer Note #97
%T An Optimal Selection Algorithm
%A Richard Cole
%D March 1986
%O Also Computer Science Technical Report #209.
Appeared as:
  An Optimally efficient parallel selection algorithm
  Information Processing Letters, 26(1987/88), 295-299.

%R Ultracomputer Note #98
%T Synchronization Costs on Multiprocessors
%A Anne Greenbaum
%D April 1986
Parallel Computing 10 (1989)  pp. 3-14.

%R Ultracomputer Note #99
%T Solving Sparse Triangular Linear Systems Using FORTRAN with Parallel Extensions on the NYU Ultracomputer Prototype
%A Anne Greenbaum
%D April 1986
No publication to date

%R Ultracomputer Note #100
%T An Overview of the NYU Ultracomputer Project
%A Allan Gottlieb
%D May 1986
"Experimental Parallel Computing Architectures", Editor - J.J.
Dongarra. Elsevier Science Publishers; B.V. (North Holland), 1987.

%R Ultracomputer Note #101
%T Efficient Parallel and Serial Approximate String Matching
%A Gad M. Landau
%A Uzi Vishkin
%D February 1986
%O Also Computer Science Technical Report #221.
Journal of Algorithms

%R Ultracomputer Note #102
%T Parallel Ear Decomposition (EDS) and ST-Numbering In Graphs
%A Yael Maon
%A Baruch Schieber
%A Uzi Vishkin
%D February 1986
%O Also Computer Science Technical Report #222.
Theoretical Computer Science 47 (1986), 277-298

%R Ultracomputer Note #103
%T Tight Comparison Bounds On The Complexity Of Parallel Sorting
%A Yossi Azar
%A Uzi Vishkin
%D February 1986
%O Also Computer Science Technical Report #223.
SIAM J. Computing 16,3 (1987), 458-464

%R Ultracomputer Note #104
%T The Add-and-Lambda Operation:  An Extension of F&A
%A Malcolm C. Harrison
%D July 1986
Not published.

%R Ultracomputer Note #105
%T Efficient Synchronization On Multiprocessors With Shared Memory
%A Clyde P. Kruskal
%A Larry Rudolph
%A Marc Snir
%D May 1986
Appeared in - Fifth ACM SIGACT-SIGOPS Symposium on Principles of Distributed
Computing - August 1986.

%R Ultracomputer Note #106
%T A Unified Theory Of Interconnection Network Structure
%A Clyde P. Kruskal
%A Marc Snir
%D June 1986
Published - ??

%R Ultracomputer Note #107
%T The Efficient Termination of Ada Tasks in a Distributed Environment
%A Susan Flynn
%A Edith Schonberg
%A Edmond Schonberg
%D June 1986
Published - ??
 
%R Ultracomputer Note #108
%T The Accelerated Centroid Decomposition Technique For Optimal Parallel Tree Evaluation In Logarithmic Time
%A Richard Cole
%A Uzi Vishkin
%D September 1986
%O Also Computer Science Technical Report #242.
Algorithmica, 3(1988), 329-346.

%R Ultracomputer Note #109
%T Note on the AKS Sorting Network
%A Richard Cole
%A Colm O'Dunlaing
%D September 1986
%O Also Computer Science Technical Report #243.
No publication

%R Ultracomputer Note #110
%T Approximate Parallel Scheduling.  Part I:  The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time
%A Richard Cole
%A Uzi Vishkin
%D October 1986
%O Also Computer Science Technical Report #244.
SIAM Journal on Computing, 1(1988), 128-142.	

%R Ultracomputer Note #111
%T Parallel Construction of a Suffix Tree
%A Gad M. Landau
%A Baruch Schieber
%A Uzi Vishkin
%D November 1986
%O Also Computer Science Technical Report #252.
Proc. 14th ICALP, Lecture Notes in Computer Science, Springer-Verlag,
1987, 314-325
"Parallel construction of a suffix tree with applications,
Algorithmica 3 (1988), 347-365, special issue on Parallel and
Distributed Computing.  This paper is a result of two individual
papers that achieved independently similar results.  One of these two
paper was by the first two authors and the other by the last three
authors.

%R Ultracomputer Note #112
%T A Group Lock Algorithm, With Applications
%A Isaac Dimitrovsky
%D November 1986
Published - 1/9 Submitted to JPDC is awaiting acceptance.  Will let me
know.

%R Ultracomputer Note #113
%T A Note on Random Number Generator of Chung et. al.
%A Ora E. Percus
%D January 1987
Not Published.

%R Ultracomputer Note #114
%T Random Number Generators for Ultracomputers
%A Ora E. Percus
%A Malvin H. Kalos
%D February 1987
Published - Journal of Parallel and Distributed Computing 6, 477-497
(1989)

%R Ultracomputer Note #115
%T Parallel Merge Sort
%A Richard Cole
%D March 1987
%O Also Computer Science Technical Report #278.
SIAM Journal on Computing, 4(1988), 770-785.

%R Ultracomputer Note #116
%T UltraProlog
%A Malcolm C. Harrison
%A Nikolaos Markantonatos
%A Georgios Papadopoulos
%D January 1987
Descendents of 116 are pending acceptance for publication.

%R Ultracomputer Note #117
%T Faster Optimal Parallel Prefix Sums and List Ranking
%A Richard Cole
%A Uzi Vishkin
%D February 1987
%O Also Computer Science Technical Report #277.
Information and Computation, 3(1989), 334-352.

%R Ultracomputer Note #118
%T On Finding Lowest Common Ancestors:  Simplification and Parallelization
%A Baruch Schieber
%A Uzi Vishkin
%D April 1987
Siam J. Computing (No date)

%R Ultracomputer Note #119
%T Approximate Parallel Scheduling.  Part II:  Applications to Optimal Parallel Graph Algorithms in Logarithmic Time
%A Richard Cole
%A Uzi Vishkin
%D April 1987
%O Also Computer Science Technical Report #291.
To appear, Information and Computation.

%R Ultracomputer Note #120
%T On Some Parallel Sieve of Prime Numbers Generation
%A Vladimir Fleyshgakker
%D April 1987
Published - ??

%R Ultracomputer Note #121
%T Long Range Correlations in Linear Congruential Generators
%A Ora E. Percus
%A Jerome K. Percus
%D July 1987
Computational Physics, July 1988.

%R Ultracomputer Note #122
%T On Editing Distance Between Trees and Related Problems
%A Kaizhong Zhang
%A Dennis Shasha
%D August 1987
%O Also Computer Science Technical Report #310.
To be published as:
"Simple Fast Algorithms for the Editing Distance Between Trees and
Related Problems", Siam Journal of Computing, to appear, December
1989.

%R Ultracomputer Note #123
%T Dynamic Processor Allocation for Parallel Algorithms
%A Robert A. Hummel
%A Kaizhong Zhang
%D January 1987
%O Also Computer Science Technical Report #268 and Robotics Report #94.
Published - Appeared in the proceedings of the Optical and Digital
Pattern Recognition session of the SPIE Conference on EO-Imaging, SPIE
Vol. 754, pp. 268-275.  Los Angeles, January 1987.

%R Ultracomputer Note #124
%T An Analytical Model for the Performance of Concurrent B Tree Algorithms
%A Dennis Shasha
%A Vladimir Lanin
%A Jeanette Schmidt
%D July 1987
%O Also Computer Science Technical Report #311.
Not Published

%R Ultracomputer Note #125
%T Design VLSI Network Nodes to Reduce Memory Traffic in a Shared
Memory Parallel Computer
%A Susan Dickey
%A Allan Gottlieb
%A Richard Kenner
%A Yue-Sheng Liu
%D August 1986, (Rev. October 1986) 
"Circuits Systems Signal Process" Vol. 6, No. 2, 1987.

%R Ultracomputer Note #126
%A Anne Greenbaum
%A Conming Li
%A Han Zheng Chao
%T Comparison of Linear System Solvers to Diffusion-Type Finite Element Equations
%D September 1987
To appear in Num. Math. 

%R Ultracomputer Note #127
%T Cascading Divide-and-Conquer:  A Technique for Designing Parallel Algorithms
%A Mikhail J. Atallah
%A Richard Cole
%A Michael T. Goodrich
%D September 1987
%O Also Computer Science Technical Report #317.
SIAM Journal on Computation, 3(1989), 499-532.

%R Ultracomputer Note #128
%T On Optimal Parallel Algorithm for Building A Data Structure for Planar Point Location
%A Richard Cole
%A Ofer Zajicek
%D October 1987
%O Also Computer Science Technical Report #316.
To appear, Journal of Parallel and Distributed Computing.

%R Ultracomputer Note #129
%T TLB Consistency on Highly-Parallel Shared-Memory Multiprocessors
%A Patricia Teller
%A Richard Kenner
%A Marc Snir
%D October 1987
Reprinted from PROCEEDINGS OF THE 21ST HAWAII INTERNATIONAL CONFERENCE
ON SYSTEM SCIENCES, Kailu-Kona, Hawaii, January 5-8, 1988.

%R Ultracomputer Note #130
%T Adaptive Mesh Refinement for Parallel Processors
%A Marsha Berger
%D December 1987
"Parallel Processing for Scientific Computing", G. Rodrigue, (editor),
SIAM, 1989.  
The proceedings of the SIAM Conference on Parallel
Processing, Los Angeles, California, December 1987.

%R Ultracomputer Note #131
%T An Additive Variant of the Schwarz Alternating Method for the Case of Many Subregions
%A Maksymilian Dryja
%A Olof Widlund
%D December 1987
%O Also Computer Science Technical Report #339.
Published - ??

%R Ultracomputer Note #132
%T Delta Network Performance and \*(lqHot Spot\*(rq Traffic
%A Yue-Sheng Liu
%D January 1988
Not Published

%R Ultracomputer Note #133
%T Modifying Two-Phase Locking to Improve Performance
%A Theodore Johnson
%D April 1988

%R Ultracomputer Note #134
%T The Power of Multimedia:  Combining Point-to-Point and Multiaccess Networks
%A Yehuda Afek
%A Gad M. Landau
%A Baruch Schieber
%A Moti Yung
%D March 1988
%O Also Computer Science Technical Report #351.

%R Ultracomputer Note #135
%T Memory Management in Symunix II:  A Design for Large-Scale Shared Memory Multiprocessors
%A Jan Edler
%A Jim Lipkis
%A Edith Schonberg
%D April 1988

%R Ultracomputer Note #136
%T Process Management for Highly Parallel \s-2UNIX\s+2 Systems
%A Jan Edler
%A Jim Lipkis
%A Edith Schonberg
%D April 1988

%R Ultracomputer Note #137
%T ParFOR \- A Structured Environment for Parallel FORTRAN
%A Wayne Berke
%D April 1988

%R Ultracomputer Note #138
%T Elementary Properties of Clock-regulated Queues
%A Ora E. Percus
%A J. K. Percus
%D May 1988
Published in SIAM J. Appl. Math.
Volume 50, No. 4, pp.1166-1175, August 1990

%R Ultracomputer Note #139
%T Add-and-Lambda II:  Eliminating Busy Waits
%A Malcolm C. Harrison
%D March 1988

%R Ultracomputer Note #140
%T Automatic Exploitation of Concurrency in C:  Is It Really So Hard?
%A Lori S. Grob
%D June 1988

%R Ultracomputer Note #141
%T Simulation and Analysis of Different Switch Architectures for Interconnection Networks in MIMD Shared Memory Machines
%A Yue-Sheng Liu
%A Susan Dickey
%D June 1988

%R Ultracomputer Note #142
%T The Spatial Complexity of Oblivious \fIk\fP\-probe Hash Functions
%A Jeanette P. Schmidt
%A Alan Siegel
%D June 1988

%R Ultracomputer Note #143
%T Preconditioning and Boundary Conditions
%A Thomas A. Manteuffel
%A Seymour V. Parter
%D June 1988

%R Ultracomputer Note #144
%T Porting Scientific Applications to the NYU Ultracomputer 
%A Jerome Chiabaut
%A Vladimir Fleyshgakker
%A Anne Greenbaum
%D July 1988

%R Ultracomputer Note #145
%T Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems
%A Olof Widlund 
%D June 1988
%O Also Computer Science Technical Report #386.
 
%R Ultracomputer Note #146
%T Optimal Iterative Refinement Methods
%A Olof Widlund
%D August 1988

%R Ultracomputer Note #147
%T SIMD Algorithms For 2-D Arrays In Shuffle Network
%A Yosi Ben-Asher
%A David Egozi
%A Assaf Schuster
%D February, 1988

%R Ultracomputer Note #148
%T Efficient Synchronization Algorithms Using Fetch & Add on Multiple Bitfield Integers
%A Eric Freudenthal
%A Olivier Peze
%D February, 1988

%R Ultracomputer Note #149
%T On-The-Fly Detection Of Access Anomalies
%A Edith Schonberg
%D October, 1988

%R Ultracomputer Note #150
%T Parallel Queues and Pools, An Evaluation
%A David Wood
%D January, 1989

%R Ultracomputer Note #151
%T A Cache Technique for Synchronization Variables in Highly Parallel, Shared Memory Systems
%A Wayne Berke
%D December, 1988

%R Ultracomputer Note #152
%T Ultracomputer Packaging and Prototypes
%A Ronald Bianchini
%D January, 1989

%R Ultracomputer Note #153
%T Models for Queue Length in Clocked Queing Networks
%A Ora E. Percus
%A Jerome Percus
%D January, 1989
Published - Communications on Pure and Applied Mathematics, 
            Vol. XLIII, 273-289 (1990)

%R Ultracomputer Note #154
%T Fully Parallel Algorithm for Implementing Path Expressions
%A Anne Dinning
%A B. Mishra
%D January, 1989

%R Ultracomputer Note #155
%T Some Domain Decomposition Algorithms for Elliptic Problems
%A Maksymilian Dryja
%A Olof B. Widlund
%D April, 1989

%R Ultracomputer Note #156
%T On the Optimality of and Additive Iterative Refinement Method
%A Maksymilian Dryja
%A Olof B. Widlund
%D April, 1989

%R Ultracomputer Note #157
%T The Design of Processing Elements on a Multiprocessor System with a High-Bandwidth, High-Latency Interconnection Network
%A Richard Kenner
%A Susan Dickey
%A Patricia J. Teller
%D January, 1989

%R Ultracomputer Note #158
%T A Compact Design for A Highly-Parallel Shared-Memory MIMD Computer
%A Richard Kenner
%A Ronald Bianchini
%A Susan Dickey
%A Patricia J. Teller
%D January, 1989
 
%R Ultracomputer Note #159
%T Process Coordination with Fetch & Increment
%A Eric Freudenthal
%A Allan Gottlieb
%D May, 1989

%R Ultracomputer Note #160
%T Equilibrium Results for a Pair of Coupled Discrete-time Queues
%A Steven Jaffe
%D June, 1989

%R Ultracomputer Note #161
%T Queue Length Distributions in a Markov Model of a Multistage Clocked Queueing Network
%A O. E. Percus
%A J. K. Percus
%D June, 1989
Published - Communications on Pure and Applied Mathematics, 
            Vol. XLIII, 685-693 (1990)

%R Ultrcomputer Note #162
%T Parallelizing the Adaptive Fast Multipole Method on a Shared Memory
MIMD Machine
%A A. Greenbaum
%D June, 1989

%R Ultracomputer Note #163
%T An Evaluation of Monitoring Algorithms for Access Anomaly Detection
%A Anne Dinning
%A Edith Schonberg
%D July, 1989

%R Ultracomputer Note #164
%T An Outsider's View of Dataflow
%A Allan Gottlieb
%D July, 1989

%R Ultracomputer Note #165
%T A Domain Decomposition Algorithm Based on a Change to a
Hierarchical Basis
%A Barry F. Smith
%A Olof B. Widlund 
%D November, 1989

%R Ultracomputer Note #166
%T An Empirical Comparison of Monitoring Algorithms for Access Anomaly
Detection
%A Anne Dinning
%A Edith Schonberg
%D December, 1989
Appeared in the proceedings of 2nd ACM SIGPLAN Symposium on Parallel
Programming, March 1990.

%R Ultracomputer Note #167
%T Towards a Unified Theory of Domain Decomposition Algorithms for
Elliptic Problems
%A Maksymilian Dryja
%A Olof B. Widlund
%D December 1989

%R Ultracomputer Note #168
%T Time Series Transformations in Clocked Queueing Networks
%A Ora E. Percus
%A J. K. Percus
%D March, 1990
Published - Communications Pure and Applied Mathematics.  Issue -
Vol.44 no.9, 1991

%R Ultracomputer Note #169
%T Performance Analysis of Clock-Regulated Queues with Output
Multiplexing in Three Different Types of 2 by 2 Crossbar Switch
Architectures
%A Susan R. Dickey
%A Ora E. Percus
%D April, 1990
Published - JPDC 16, 27-40 (1992)

%R Ultracomputer Note #170
%T A Compiler-Assisted Approach to SPMD Execution 
%A Ron Cytron
%A Jim Lipkis
%A Edith Schonberg
%D July, 1990

%R Ultracomputer Note #171
%T Architecture and Performance of Processor-Memory Interconnection
Networks for MIMD Shared Memory Parallel Processing Systems
%A Yue-Sheng Liu
%D September, 1990

%R Ultracomputer Note #172
%T Intrinsic Relations in the Structure of Linear Congruential
Generators modulo 2\u\(*b\d
%A Ora E. Percus
%A J. K. Percus
%D January, 1991
To be published  Statistics and Probability Letters, 1992 

%R Ultracomputer Note #173
%T TLB Performance in Multiprocessors
%A Patricia Teller
%A Allan Gottlieb
%D September, 1991

%R Ultracomputer Note #174
%T Using VLSI to Reduce Serialization and Memory Traffic in Shared
Memory Parallel Computers
%A Susan Dickey
%A Allan Gottlieb
%A Richard Kenner
%D December, 1985

%R Ultracomputer Note #175
%T Using Qualified Clocks in the NORA Clocking Methodology to
Implement a Systolic Queue Design
%A Susan R. Dickey
%A Richard Kenner
%D January, 1992

%R Ultracomputer Note #176
%T A Wiring Tool for Ultracomputer
%A Guoying Chen
%D January, 1992

%R Ultracomputer Note #178
%T A Combining Switch for the NYU Ultracomputer
%A Susan Dickey
%A Richard Kenner
%D January, 1992

%R Ultracomputer Note #179
%T An Expanded Set of Correlation Tests for Linear Congruential Random
Number Generators
%A Ora Percus
%A J.K. Percus
%D January, 1992
Published Combinatorics Probability and Computing, 1992 pp161-168

%R Ultracomputer Note #180
%T Performance differences among combining switch architectures
%A Susan R. Dickey
%A Ora E. Percus
%D January, 1992

%R Ultracomputer Note #181
%T Primary-node Scheme for Cache Coherences in Large Scale
Shared-Memory Multiprocessors
%A Guoying Chen
%D January, 1992
Presented at "The Permian Basin Supercomputing Conference, 1992".

%R Ultracomputer Note #182
%T Hardware Combining and Scalability
%A Susan Dickey
%A Richard Kenner
%D February, 1992

%R Ultracomputer Note #183
%T A Multistage Clocked Queueing Network
%A Ora E. Percus
%D January, 1992

%R Ultracomputer Note #184
%T Why Use Chen-Stein for Sequence Comparison?
%A Ora E. Percus
%D April, 1992

%R Ultracomputer Note #185
%T The Ultra III Prototype
%A Ronald Bianchini
%A Susan Dickey
%A Gabriel Goodman
%A Allan Gottlieb
%A Richard Kenner
%A Jiarui Wang
%D November, 1992

%R Ultracomputer Note #186
%T SLiD --- A Cost-Effective and Scalable Limited-Directory Scheme for Cache Coherence 
%A Guoying Chen
%D November, 1992

%R Ultracomputer Note #187
%T Interconnection Network Switch Architectures and Combining Strategies
%A Susan Dickey
%A Allan Gottlieb
%A Yue-Sheng Liu
%D September, 1993

%R Ultracomputer Note #188
%T Locating Multiprocessor TLBs at Memory
%A Patricia J. Teller
%A Allan Gottlieb
%D October, 1993

%R Ultracomputer Note #189
%T Molasses: An Ultracomputer Simulator (Preliminary Version)
%A Jan Edler
%D March 8, 1994