论文信息 - Data parallel algorithms

Data parallel algorithms

Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the control parallel style used in multiprocessing. The success of data parallel algorithms—even on problems that at first glance seem inherently serial—suggests that this style of programming has much wider applicability than was previously thought.

[1] Kenneth E. Iverson,et al. A programming language , 1899, AIEE-IRE '62 (Spring).

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[4] Ahmed Sameh,et al. The Illiac IV system , 1972 .

[5] John W. Backus,et al. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[6] D. L. Orth,et al. Development of an APL standard , 1979 .

[7] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[8] Kenneth E. Batcher,et al. Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[9] Daniel P. Siewiorek,et al. A survey of highly parallel computing , 1982, Computer.

[10] Victor Y. Pan,et al. Efficient parallel solution of linear systems , 1985, STOC '85.

[11] W. Daniel Hillis,et al. Connection Machine Lisp: fine-grained parallel symbolic processing , 1986, LFP '86.

[12] Alan Bawden,et al. Connection graphs , 1986, LFP '86.