Hospitals/Residents Problem
- PDF / 213,816 Bytes
- 5 Pages / 547.087 x 737.008 pts Page_size
- 79 Downloads / 218 Views
H
Hitting Set
Engineering Algorithms for Large Network Applications Engineering Geometric Algorithms Experimental Methods for Algorithm Analysis External Sorting and Permuting Implementation Challenge for Shortest Paths Implementation Challenge for TSP Heuristics I/O-model Visualization Techniques for Algorithm Engineering
Recommended Reading 1. Aggarwal, A., Vitter, J.: The input/output complexity of sorting and related problems. Commun. ACM 31, 1116–1127 (1988) 2. Bader, D.A., Moret, B.M.E., Sanders, P.: Algorithm engineering for parallel computation. In: Fleischer, R., Meineche-Schmidt, E., Moret, B.M.E. (ed) Experimental Algorithmics. Lecture Notes in Computer Science, vol. 2547, pp. 1–23. Springer, Berlin (2002) 3. Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, C.G., Smith, S.J., Zagha, M.: An experimental analysis of parallel sorting algorithms. Theor. Comput. Syst. 31(2), 135–167 (1998) 4. Choi, J., Dongarra, J.J., Pozo, R., Walker, D.W.: ScaLAPACK: A scalable linear algebra library for distributed memory concurrent computers. In: The 4th Symp. the Frontiers of Massively Parallel Computations, pp. 120–127, McLean, VA (1992) 5. Culler, D.E., Karp, R.M., Patterson, D.A., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken,T.: LogP: Towards a realistic model of parallel computation. In: 4th Symp. Principles and Practice of Parallel Programming, pp. 1–12. ACM SIGPLAN (1993) 6. Frigo, M., Johnson, S. G.: FFTW: An adaptive software architecture for the FFT. In: Proc. IEEE Int’l Conf. Acoustics, Speech, and Signal Processing, vol. 3, pp. 1381–1384, Seattle, WA (1998) 7. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cacheoblivious algorithms. In: Proc. 40th Ann. Symp. Foundations of Computer Science (FOCS-99), pp. 285–297, New York, NY, 1999. IEEE Press 8. Gropp, W., Lusk, E., Doss, N., Skjellum, A.: A high-performance, portable implementation of the MPI message passing interface standard. Technical report, Argonne National Laboratory, Argonne, IL, (1996) www.mcs.anl.gov/mpi/mpich/ 9. Helman, D.R., JáJá, J.: Sorting on clusters of SMP’s. In: Proc. 12th Int’l Parallel Processing Symp., pp. 1–7, Orlando, FL, March/April 1998 10. High Performance Fortran Forum. High Performance Fortran Language Specification, 1.0 edition, May 1993 11. Juurlink, B.H.H., Wijshoff, H.A.G.: A quantitative comparison of parallel computation models. ACM Trans. Comput. Syst. 13(3), 271–318 (1998) 12. Message Passing Interface Forum. MPI: A message-passing interface standard. Technical report, University of Tennessee, Knoxville, TN, June 1995. Version 1.1 13. Moret, B.M.E., Bader, D.A., Warnow, T.: High-performance algorithm engineering for computational phylogenetics. J. Supercomput. 22, 99–111 (2002) Special issue on the best papers from ICCS’01
14. Moret, B.M.E., Shapiro, H.D.: Algorithms and experiments: The new (and old) methodology. J. Univers. Comput. Sci. 7(5), 434–446 (2001) 15. Nagel, W.E., Arnold, A., Weber, M., Hoppe, H.C., Solchenbach, K.: VAMPIR: visualization and analysis of
Data Loading...
