Kevin Lew, Kirk Johnson, and Frans Kaashoek. A Case Study of Shared-Memory and Message-Passing Implementations of Parallel Breadth-First Search: The Triangle Puzzle. In Third DIMACS International Algorithm Implementation Challenge Workshop, October 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Efficient Virtual Network Interface in the FUGU Scalable.. - Mackenzie (1998) (1 citation) (Correct)
....many low latency protocol packets mixed with larger data packets. Of the three CRL applications, Barnes exhibits the finest granularity in terms of message rate (smallest T interhandler ) A fourth application, enum, solves a simple triangle puzzle game by exhaustive, breadth first search [47]. The implementation used here is a fine grain, data parallel version that exchanges numerous unacknowledged short messages and synchronizes only infrequently. From Table 7 1, the ratio of T handler to T interhandler in enum is extremely high: a third of the time of the application is spent in ....
Kevin Lew, Kirk Johnson, and Frans Kaashoek. A Case Study of Shared-Memory and MessagePassing Implementations of Parallel Breadth-First Search: The Triangle Puzzle. In Third DIMACS International Algorithm Implementation Challenge Workshop, October 1994.
UDM: User Direct Messaging for General-Purpose.. - Mackenzie.. (1996) (4 citations) Self-citation (Kaashoek) (Correct)
....less often. 5.3 Multiprogramming Finally, we illustrate the flexibility of the system by running an application multiprogrammed as part of workloads under several scheduling strategies. The application, Tpuz, performs an exhaustive search of board positions in the triangle puzzle [12] a simple game. The application operates in stages separated by barriers, where at each stage processors exchange many unacknowledged messages with one another. The messaging in Tpuz can be characterized by T handler 170 instructions and T interhandler 950 instructions. We run Tpuz alone ....
Kevin Lew, Kirk Johnson, and Frans Kaashoek. A Case Study of Shared-Memory and Message-Passing Implementations of Parallel Breadth-First Search: The Triangle Puzzle. In Third DIMACS International Algorithm Implementation Challenge Workshop, October 1994.
Optimistic Active Messages: A Mechanism for Scheduling.. - Wallach (1995) (42 citations) Self-citation (Johnson Kaashoek) (Correct)
....sequence of moves that leaves only one peg on the board. The goal is to count the number of solutions. This implementation uses breadth first search to solve the puzzle: at every step all processors extend each position by one move, and place the (non redundant) extensions in a transposition table [19]. Each extension is sent using an asynchronousRPC to the processor which holds the correct part of the transposition table for that position. The RPC blocks when the lock on the transposition table is taken. We ran with a triangle with 6 holes on each side. A sequential C version of the code ....
LEW, K., JOHNSON, K. L., AND KAASHOEK, M. F. A case study of shared-memory and message-passing implementations of parallel breadth-first search: The triangle puzzle. In Proceedings of the Third DIMACS Algorithm Implementation Challenge (Oct. 1994). Also available on the World Wide Web, http://www.pdos.lcs.mit.edu/ lew/papers/dimacs94.ps.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC