Vivek Sarkar
John Hennessy
- 1.Ackefman, W. B. & Demis, J. B. VAt.- a value-orknted algorithmic language. Preiminary reference manual. MIT/LCS/TR-218, Lab(ntory for Computer Science, MFT, June, 1979. Google Scholar
Digital Library
- 2.Cek~ J. R. & Henneny, J. 1.,. SAL: A Single- Asset Language for Parallel Algorithms. ClaSSiC-83-01, Center for Large Scale Scientific Computation, Stanford University, Sept., 1983.Google Scholar
- 3.Davis, A. L & Kelly, R. M. "Data Flow Program Graphs". IEEE Cvmp~er 15, 2 (Feb. 1982).Google ScholarCross Ref
- 4.Garey, M. R. and Johnson, D. S. COMPUTERS AND INTRACTABILITY A guide to ht e Theroy of NP. Comple~s. W. H. Freeman and Company, San isco, 1979. Google ScholarDigital Library
- 5.Gaudiot, J. }. & Ercegovac, M.D. Performance Analysis of a Data-flow comput~"r with Variable Resolution Aclors. Proc. 4th lnt Conf Dist Comp Sys, 1984, pp. 2-9.Google Scholar
- 6.Oilberk a.J. An Investigation of the Partitioning of Alg~th~ Across an MIMD Computing System. Technical Note No. 176, Computer Systems Laboratory, Stanfo~ University, 1980.Google Scholar
- 7.Graham, R. L "Bounds on Mu 'ltipmcessing Tuning Anomalies". SIAM J. Appl. math.17, 2 (Match 1969).Google Scholar
- 8.Gurd, J.R., Kirkham, C.C.&Watson, l. "The Manc~a~r Prototype Datnfiow Computer". CACM 28,1 0an. 19sS). Google ScholarDigital Library
- 9.Hornig, D. A. Automatic partioning and Scheduling on a network of personmal computers Ph.D. Th., Cm'negle-Mellon University, Nov. 1984. Google ScholarDigital Library
- 10.Hudak, P. & Goldbe~ B. Serial Combinators: "Oplimal" Grains of Parallelism. Proc. FmEtional Programming Languages and Computer Architecture, Nancy, France, Sept., 1985, pp. 382-399. Google ScholarDigital Library
- 11.McGraw, J. ~ dL SISAl.: Streams and Iteration in a Single Assignmmt Language, tanguage Refermee Mmual, Version 1.2. M-146, !,LNL, March, 1985.Google Scholar
- 12.Pfaltz. J. L. Computer data structure. McGraw-Hill, inc., 1977. Google ScholarDigital Library
- 13.Sarkar, V. & H~, L L. Compile-time Partitionin8 and ScbMuling of Prdlel Profpmms. Prec. SIOPLAN '86 ~um on Compila Cemuucttou, 1986. Google ScholarDigital Library
- 14.Sl~apiro, E. Y. A Subset of Conc~t Prolog and Its Inmp~ter. TR-003, The Wcizmmm Institute of Science, Israel, Feb., 1983.Google Scholar
- 15.Sites, R. et al. MacMne-independent Pascal Optimiz~ Project: Final Report UCS!~S-79/038, Univextity of California at San Diego, Nov., 1979.Google Scholar
- 16.Skedzielewski, S. & Olauctk J. IPl - An inteam~atc Form for Applicative languages, Venion 1.0. M-170, July, 1985.Google Scholar
- 17.Turner, D. A. "A new implementation techniques for applicative languages". Soj~wore . Pro~fice and Experience 9 (t979), 3;-49.Google Scholar
Recommendations
Parallel graph partitioning on multicore architectures
LCPC'10: Proceedings of the 23rd international conference on Languages and compilers for parallel computingGraph partitioning is a common and frequent preprocessing step in many high-performance parallel applications on distributed-and shared-memory architectures. It is used to distribute graphs across memory and to improve spatial locality. There are ...
Comments