| 
|
QuoteRef: gottA4_1983
topics >
all references >
ThesaHelp:
references g-h
ThesaHelp:
ACM references f-l
Topic:
concurrent operations
Topic:
concurrency
Reference
Gottlieb, A, Lubachevsky, B.D., Rudolph, L., "Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors ", ACM Transactions on Programming Languages and Systems, 5, 2, pp. 164-189, April 1983. Google
Notes
Replace-add operation from: Draughon, E., Grishman, R., Schwartz, J., Stein, A. Programming considerations for parallel computers, Report IMM362, Courant Inst., New York Univ., NY 11/ 67.
165 ;;Quote: with replace-add, all processors can simultaneously modify a variable in constant time; requests combined in the network
166 ;;Quote: two actions are simultaneous if their durations overlap
167 ;;Quote: with concurrent loads, stores, and replace-adds, simultaneous loads may yield different results
167 ;;Quote: use replace-add for semaphores, readers/writers, parallel queues, and detecting completion
178 ;;Quote: implement fetch-add with an omega network of shuffle switches
ThesaHelp: references g-h (299 items)
ThesaHelp: ACM references f-l (241 items)
Topic: concurrent operations (22 items)
Topic: concurrency (33 items)