ALGO p2
ALGO p2
ALGO p2
, Washington,
D.C., 1971.
53. Parker, D.B. Crime by Computer. Scribners, New York, 1976.
54. Peterson, H.E., and Turn, R. System implications of information
privacy. Proc. AFIPS 1967 SJCC, Vol. 30, AFIPS Press, Montvale,
N.J., pp. 291-300.
55. Portway, P.S. EFT systems? No thanks, not yet. Computerworld Programming S. L. Graham, R. L. Rivest
12, 2 (Jan. 9, 1978), 14--16, 21, 23-25. Techniques Editors
56. Privacy Protection Study Commission. Personal Privacy in an
Information Society. U.S. Gov't. Printing Office, Washington, D.C.,
July, 1977.
57. Prives, D. The explosion of state laws on electronic fund transfer
Fast Parallel Sorting
systems. P-76-1, Prog. Inform. Technologies and Public Policy,
Harvard U., Cambridge, Mass., 1976.
Algorithms
58. Reid, S. The New Industrial Order: Concentration Regulation and
Public Policy. McGraw-Hill, New York, 1976. D. S. Hirschberg
59. Richardson, D.W. Electric Money:. Evolution of an Electronic Rice University
Funds-Transfer System. M.I.T. Press, Cambridge, Mass., 1970.
60. Rose, S. More bang for the buck: The magic of electronic
banking. Fortune 95, 5 (1977), 202-226.
61. Rossman, L.W. Financial industry sees EFT privacy laws
adequate. American Banker CXLL 210 (Oct. 28, 1976), 1, 11. A parallel bucket-sort algorithm is presented that
62. Rule, J. Private Lives and Public Surveillance. Schocken Books, requires time O(log n) and the use of n processors. The
New York, 1974. algorithm makes use of a technique that requires more
63. Rule, J. Value Choices in Electronic Funds Transfer Policy.
Office of Telecommunications Policy, Executive Office of the space than the product of processors and time. A
President, Washington, D.C., Oct. 1975. realistic model is used in which no memory contention
64. Saltzer, J., and Schroeder, M. The protection of information in is permitted. A procedure is also presented to sort n
computer systems. Proc. IEEE 65, 9 (Sept. 1975), 1278-1308.
65. Sayre, K., Ed. Values in the Electric Power Industry. U. of Notre numbers in time O(k log n) using n 1+1/k processors, for
Dame Press, Notre Dame, Ind., 1977. k an arbitrary integer. The model of computation for
66. Schick, B. Some impacts of electronic funds transfer on consumer this procedure permits simultaneous fetches from the
transactions. Federal Reserve Bank of Boston. The economics of a
national electronics funds transfer system. Conf. Ser. No. 13, Boston, same memory location.
Mass., Oct. 1974, pp. 165-179. Key Words and Phrases: parallel processing,
67. Schuck, P.H. Electronic funds transfer: A technology in search of sorting, algorithms, bucket sort
a market. Maryland Law Review 35, 1 (1975), 74--87.
68. Schultze, L. The public use of the private interest. Harpers 254, CR Categories: 3.74, 4.34, 5.25, 5.31
1524 (May 1977), 43-62.
69. Simpson, R.C. Money transfer services. Computers and Society 7,
4 (Winter 1976), 3-9.
70. Steifel, R.C. A checkless society or an unchecked society?
Computers and Automation 19 (Oct. 1970), 32-35.
71. Sterling, T., and Laudon, K. Humanizing information systems. There is often a time-space tradeoff in serial algo-
Datamation 22, 12 (Dec. 1976), 53-59.
72. The time is NOW. Forbes Magazine 120, 1 (July 1, 1977), 61-62.
rithms. In order to solve a problem within a certain time
73. Turoff, M., and Mitroff, I. A case study of technology assessment bound, a minimal amount of space is required. This
applied to the "cashless society" concept. Technol. Forecasting Soc., space requirement may be reduced if we aUow more time
Change 7 (1975), 317-325.
74. Weissman, C. Secure computer operation with virtual machine
for the process. In the limit, there wiU be a minimum
partitioning. Proc. AFIPS 1975 NCC, Vol. 44, AFIPS Press, amount of space required.
Montvale, N.J., 1975, pp. 929-934. Much work has recently been devoted to developing
75. U.S. Dept. HEW, Secretary's Advisory Committee on Automated
Personal Data Systems. Records Computers, and the Rights of
algorithms for paraUel processors. Problem areas include
Citizens. Washington, D.C., 1973. sorting [3, 6, 16, 17], evaluation of polynomials, and
76. Walker, G. M. Electronic funds transfer systems. Electronics general arithmetic expressions [14, 4], and matrix- and
(July 24, 1975), 79-85.
77. Webber, M. The BART experience--What have we learned? The
graph theoretic problems [15, 5, 2, 12, 9]. In parallel
Public Interest, Vol. 45 (Fall 1976), 79-108. algorithms, there is a similar tradeoff between time and
78. Weizenbaum, J. Computer Power and Human Reason. Freeman, the number of processors used. In order to solve a
San Fransisco, 1976.
79. Wessel, M. Freedom's Edge: The Computer Threat to Society.
problem using a bounded number of processors, a min-
Addison-Wesley, Reading, Mass., 1974. imal amount of time is required. This time requirement
80. Westin, A., and Baker, M. Databanks in a Free Society.
Quadrangle Books, New York, 1972.
81. Whiteside, T. Computer Capers. Crowell, New York, 1978. General permission to make fair use in teaching or research of all
82. Wilcox, C., and Shepard, W. Public Policies Towards Business. or part of this material is granted to individual readers and to nonprofit
Richard D. Irwin, Homewood, Fifth ed., 1975. libraries acting for them provided that ACM's copyright notice is given
83. Winner, L. Autonomous Technology: Technology Out-of-Control and that reference is made to the publication, to its date of issue, and
as a Theme in Political Thought. M.I.T. Press, Cambridge, Mass., to the fact that reprinting privileges were granted by permission of the
1977. Association for Computing Machinery. To otherwise reprint a figure,
8,1. Wise, D. The American Police State. Random House, New York, table, other substantial excerpt, or the entire work requires specific
1976. permission as does republication, or systematic or multiple reproduc-
tion.
Research supported by NSF grant MCS-76-07683.
Author's present address: Department of Electrical Engineering,
Rice University, Houston, TX, 77001.
© 1978 ACM 0001-0782/78/0800-0657 $00.75
References
!. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and
Analysis o f Computer Algorithms. Addison-Wesley, Reading, Mass.,
1973, p. 71.
2. Arjomandi, E. A study of parallelism in graph theory. Ph.D. Th.,
Dept. of Comptr. Sci., U. of Toronto, Toronto, Ont., Dec. 1975.
3. Batcher, K.E. Sorting networks and their applications. Proc.
AFIPS 1968 SJCC, Vol. 32, AFIPS Press, Montvale, N.J., pp.
307-314.
4. Brent, R.P. The parallel evaluation of general arithmetic
expressions. J. A C M 21, 2 (April 1974), 201-206.
5. Csansky, L. Fast parallel matrix inversion algorithms. Proc. 16th
Annual Symp. on Foundations of Comptr. Sci., IEEE, Berkeley,
Calif., Oct. 1975, pp. 11-12.
6. Even, S. Parallelism in tape-sorting. Comm. A C M 17, 4 (April
1974), 202-204.
7. Flynn, M.J. Very high-speed computing systems, Proc. I E E E 54
(Dec. 1966), 1901-1909.
8. Gavril, F. Merging with parallel processors. Comm. A C M 18, 10
(Oct. 1975), 588-591.
9. Hirschberg, D.S. Parallel algorithms for the transitive closure and
the connected component problems. Proc. 8th Annual ACM Syrup.
on Theory of Comptng. Hershey, Pa., May 1976, pp. 55-57.