Claude G. Diderich

Learn More
When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), where they are carried out (computation mapping), and where the data are stored (data mapping). We show that even the " best " scheduling and mapping functions can lead to a sequential(More)
This article lists all theoretical and practical papers, theses and reports known to the author on the subject of studying minimax trees and analyzing sequential and parallel minimax tree search algorithms.The items of the bibliography are listed in alphabetical order in accordance with the first author's name. Items not marked are in my collection or are(More)