[1]
|
A. Geist, et al., “MPI-2: Extending the Message-Passing Interface,” Euro-Par’96 Parallel Processing, Springer, Berlin/Heidelberg, 1996, pp. 128-135.
|
[2]
|
M. R. B. Kristensen and B. Vinter, “Numerical Python for Scalable Architectures,” Proceedings of the Fourth Conference on Partitioned Global Address Space Programming Model (PGAS’10), New York, 12-15 October 2010, pp. 15:1-15:9.
doi:10.1145/2020373.2020388
|
[3]
|
C. A. R. Hoare, “Communicating Sequential Processes,” Communications of ACM, Vol. 21, No. 8, 1978, pp. 666-677. doi:10.1145/359576.359585
|
[4]
|
Microsoft, “Parallel Programming in the .NET Framework,” 2012.
http://msdn.microsoft.com/en-us/library/dd460693
|
[5]
|
OpenMP, “OpenMP,” 2012. http://www.openmp.org
|
[6]
|
J. P. Hoeflinger, “Extending OpenMP to Clusters,” 2012.
http://www.hearne.co.uk/attachments/OpenMP.pdf
|
[7]
|
T. Seidmann, “Distributed Shared Memory Using the .NET Framework,” 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, Tokyo, 12-15 May 2003, pp. 457-462.
doi:10.1109/CCGRID.2003.1199401
|
[8]
|
K. Asanovic, “The Landscape of Parallel Computing Research: A View from Berkeley,” University of California, Berkeley, 2006.
|
[9]
|
L. Lamport, “How to Make a Multiprocessor That Correctly Executes Multiprocess Programs,” IEEE Transactions on Computers, Vol. C-28, No. 9, 1979, pp. 690-691.
doi:10.1109/TC.1979.1675439
|
[10]
|
S. V. Adve and H. D. Mark, “Weak ordering—A New Definition,” Proceedings of the 17th annual international symposium on Computer Architecture (ISCA’90), Seattle, 28-31 May 1990, pp. 2-14.
|
[11]
|
M. S. Papamarcos and J. H. Patel, “A Low-Overhead Coherence Solution for Multiprocessors with Private Cache Memories,” Procedings of the 11th Anual Internation Symposium on Computer Architecture, Ann Arbor Michigan, 5-7 June 1984, pp. 348-354.
|
[12]
|
J. P. Hoeflinger, “Extending OpenMP to Clusters,” 2012.
http://www.hearne.co.uk/attachments/OpenMP.pdf
|