Next: Program testujący pierwszość liczby
Up: calosc
Previous: Podsumowanie
  Spis rzeczy
- 1
- Berkeley NOW Project, http://now.cs.berkeley.edu/.
- 2
- Christoph W. Keßler, ,,Practical PRAM programming with Fork95'', http://www.informatik.uni-trier.de/~kessler/fork95/tutorial.ps.
- 3
- David E. Culler, Andrea Arpaci-Dusseau, Remzi Arpaci-Dusseau, Brent Chun, Steven
Lumetta, Alan Mainwaring, Richard Martin, Chad Yoshikawa, Frederick Wong, ,,Parallel
Computing on the Berkeley NOW'', http://now.cs.berkeley.edu/Papers2/Postscript/jpps.ps.
- 4
- Joseph Jájá, ,,Introduction to parallel algorithms'', Addison Wesley 1992.
- 5
- Limon Drori, David Peleg, ,,Faster Exact Solutions for Some NP-Hard problems
(extended abstract)'', Algorithms-ESA'99, strony 450-461, Springer 1999.
- 6
- SB-PRAM project, http://www-wjp.cs.uni-sb.de/projects/sbpram/.
- 7
- T. Hagerup, A Schmitt, H Seidl, ,,FORK -- A High-Level Language for PRAMs'',
http://www-wjp.es.uni-sb.de/projects/sbpram/papers/forkpram.ps.gz.
- 8
- Thomas E. Anderson, David E. Culler, David A. Patterson, ,,A Case for Networks
of Workstations: NOW'', http://now.cs.berkeley.edu/Case/case.ps.
- 9
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, ,,Wprowadzenie do
algorytmów'' (rozdział 33), WNT 1997.
Łukasz Maśko
2000-04-17