jsv@CS.BROWN.EDU (Jeff Vitter) (09/08/90)
CALL FOR PAPERS
Special Issue of ALGORITHMICA
on Efficient Algorithms for Large-Scale Memories
This special issue of ALGORITHMICA
will be devoted to the design and analysis of
efficient algorithms for problems in large-scale tightly-coupled systems,
where the bottleneck in computations is the communication time.
Such a communication bottleneck can occur in a
variety of forms, such as communication to and from a VLSI chip,
input/output (I/O) between primary memory and secondary disk storage,
and communication between levels of a multilevel hierarchical memory.
Issues of interest include running time performance, I/O complexity,
scheduling, fault tolerance, and error correction.
All submitted manuscripts will be promptly refereed.
High-quality manuscripts not accepted for this special issue
are eligible for inclusion in a regular issue of ALGORITHMICA.
Authors should send five (5) copies of a manuscript
by OCTOBER 31, 1990 to
Prof. Jeff Vitter
Department of Computer Science
Brown University
Providence, R. I. 02912-1910
Guidelines as to format can be found in recent issues of ALGORITHMICA.