NavigationUser login |
Hi, 1. From the SC'06 paper, it seems that only leaf nodes is permitted to take part in computation, inner nodes are only responsible for data transfer and blocking. Could any program be organized into such algorithm? It seems to be difficult for some complicated control flow. And what about if the inner node could and need take part in computation? 2. Have you replaced the Brook with Sequoia? 3. Is there any possibility for me to take part in the development of the Sequoia? Submitted by weiqing on September 18, 2007 - 5:33pm. login or register to post comments | printer friendly version
Administrator 1) Complex control flow can be a problem. However, it is possible to return scalar information up to inner tasks to make control decisions. Computation can be done in the inner tasks, but that may not be portable. The compiler will generate a mapping error when map fails. In general, for portability, you want computation to occur at the leafs. 2) We do not currently have GPU backends for Sequoia, but development efforts at Stanford have shifted from Brook to Sequoia. It is possible to write a backend for Sequoia, in fact you could use most of Brook to do that, but both AMD and Nvidia have their own custom systems now for GPGPU. 3) The runtime system is almost ready to be made public. You can hack at that to add more systems as the interface is simple. We can make the compiler available, but the learning curve is quite steep. We are hoping to get the compiler documented as best as possible and release source by the end of the year. If you need the compiler for immediate research, we can make it available to you, but since it is still a research effort on our end, we currently do not plan on providing checkin permissions outside out our group. |
Joined: 2007-09-17