ViC∗: A compiler for virtual-memory C∗ (Extended Abstract)

Proceedings - 3rd International Workshop on High-Level Parallel Programming Models and Supportive Environments, HIPS 1998

Volumn 1998-March, Issue , 1998, Pages 23-33

  Colvin, Alex ^a   Cormen, Thomas H ^a  

^a Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROGRAMMING; PROGRAM COMPILERS;

DATA PARALLEL; EXTENDED ABSTRACTS; OUT-OF-CORE; PARALLEL DATA; PROGRAM TRANSFORMATIONS; VIRTUAL MEMORY;

C (PROGRAMMING LANGUAGE);

EID: 85017269623     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HIPS.1998.665140     Document Type: Conference Paper

References (25)

1. A. Agganval and C. G. Plaxton. Optimal parallel sorting in multi-level storage. In Proceedings ofrhe Srh Annual ACMSIAM Symposium on Discrere Algorirhmr, pages 659-668. Jan. 1994.
2. L. Arge. The buffer tree: A new technique for optimal 1/0-algorithms. In 4rh lnremarionnl Workshop on Algorirhms and Dora Slructures 1 WADS), pages 334-345, Aug. 1995.
3. L. Aze, D. E. Vengroff, J. S. Vitter. External-memory algorithms for processing line segments in geographic information systems. In P. Spirakis. editor. Proceedings of rhe Third Annual European Symposium on Algorirhmr (ESA '95J. volume 979 of Lecrure Norer in Compurer Science. pages 295-3 10. Springer-Verlag, Sept. 1995.
4. R. D. Barve. E. F. Grove, J. S. Vilter. Simple randomized mergeson on parallel disks. Parallel Computing. 23(4-5):601431. June 1997.
5. P. Briggs. K. D. Cooper., L. Torczon. Rematerialization. In Proceedings ofrhe ACM SIGPLAN '92 Conference on Pmgramminn Lnnnuane Desinn and Implemenmrion, pages. ~~.. 311-321.June 1992.
6. Y:J. Chiane. M. T. Goodrich, E. E Grove, R. Tamassia. ~~-D. E. Vengroff., J. S. Vitter. External-memory graph algorithms. In Proceedings ofrhe Sirrh Annual ACM-SIAM Symposium on Discnre Algorirhms. pages 139-149. Jan. 1995.
7. A. Colvin and T. H. Cormen. ViC': A compiler for vinualmemory C∗. Technical Report PCS-TR97-323. Danmouth College Department of Computer Science. Nov. 1997.
8. T. H. Cormen. Fast permuting in disk arrays. Journal ofparallel and Disrribured Computing. 17( 1-2):41-57, Jan., Feb. 1993.
9. T. H. Cormen. Determining an out-of-core FFT decomposition slrategy for parallel disks by dynamic programming. Technical Repon pCS-R97-322, Danmouth College Depanment of Computer Science. July 1997. To appear in 181.
10. T. H. Cormen and A. Colvin. ViC': A preprocessor for virtual-memory C'. Technical Repon PCS-TR9&243. Danmouth College Department of Computer Science, Nov. 1994.
11. T. H. Cormen and M. Hirschl. Early experiences in evaluating the Parallel Disk Model with the ViC implementation. Parollel Compuring. 23(4-5):571-600. June 1997.
12. T. H. Cormen and D. M. Nicol. Performing out-of-core FITS on parallel disk systems. Technical Repon PCS-TR96-294. Dartmouth College Department ofComputer Science. Aug. 1996. To appear in Parallel Compreing.
13. T. H. Curmen. T. Sundquist, L. F. Wisniewski. Asymptotically tight bounds fur performing BMMC permutations on parallel disk systems. Technical Report PCS-TR94-223. Dartmouth College Depanment of Computer Science, July 1994. Preliminary version appeared in Pmceedings ofrhe Srh AnnualACM Svmposium on Parallel Algonrhms ondArchilectures. Revised version 10 appear in SIAM Journal on Compuring.
14. T. H. Cormen, J. Wegmann., D. M. Nicol. Multiprocessor out-of-core FFTs with distributed memory and parallel disks. In Proceedings ofthe Fifih Workshop on I/O in Porallel and Disrnbured Sysrems (IOPADS '97), pages 68-78. Nov. 1997. Also Danmouth College Computer Science Technical Repon PCS-TR97-303.
15. B. D. de Dinechin, G. Elsesser, G. Fischer. B. Johnson. T. MacDonald. R. W. Numrich., I. L. Steidel. Definition of the F-extension to Fonran 90. In Proceedings ofrhe lOrh lnrernnrional Workshop on Lnnguager and Compilers for Porallel Computing. Aug. 1997. To appear.
16. P. I. Denning. Virtual memory. ACM Cumpur. Sam. 2(3):153-189. Sept. 1970.
17. M. T. Goodrich. J.-J. Tsay, D. E. Vengroff, J. S. Vitter. External-memory computational geometry. In Proceedings ofrhe 34lh Annual Symposium on Foundorions of Computer Science, pages 714-723, Nov. 1993.
18. Pmceedings of rhe Workshop on Algorirhms for Porallel Machines. 199697 Special Year on Mathematics of High Performance Computing, Institute for Mathematics and Its Applications, University of Minnesota. Minneapolis. Scpt. 1996.
19. A. 1. Lapadula and K. P. Herold. A retargetable C∗compiler and run-time library for mesh-connected MIMD multicomputers. Technical Repon TR 92-15, University of New Hampshire. 1992. Revised by Phil Hatcher. October 1993.
20. M. H. Nodine and J. S. Vitter. Deterministic distribution son in shared and distributed memory multiprocessors. In Pmeedings ofthe 5rh Annual ACM Symposium on Porallel Algorirhms ondArchirecrures, pages 120-129, June 1993.
21. M. H. Nodine and J. S. Vitter. Greed son: Optimal deterministic sonine on Darallel disks. 1. ACM. 42(4):919-933.-. July 1995. May 1993.
22. Thinking Machines Corporation. C∗Pmgrommrng Guide.
23. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: WO-level memories. Algorirhmicn, 12(2/3): 1 IO-147. Aug., Sept. 1994.
24. L. F. Wisniewski. Eficienr Design and Implementorion of Permutation Algorithms on , he Memo Hier0mh.y. PhD Ihesis, Danmouth College Department of Computer Science, Mar. 1996.
25. D. Womble, D. Greenberg, ' S. Wheat, R. Riesen. Beyond core: Making parallel computer U0 practical. In DAGS '93, June 1993.