BABYL OPTIONS: Version: 5 Labels: Note: This is the header of an rmail file. Note: If you are seeing it in rmail, Note: it means the file has no messages in it.  1,, Return-Path: Received: from g.gp.cs.cmu.edu by THEORY.CS.CMU.EDU id aa04181; 16 Jun 92 14:47:12 EDT Date: Tue, 16 Jun 92 14:46:31 EDT From: Anja.Feldmann@G.GP.CS.CMU.EDU To: eschwabe@CS.CMU.EDU Subject: guys comments *** EOOH *** Return-Path: Date: Tue, 16 Jun 92 14:46:31 EDT From: Anja.Feldmann@G.GP.CS.CMU.EDU To: eschwabe@CS.CMU.EDU Subject: guys comments Return-Path: <@gs21.sp.cs.cmu.edu:Guy.Blelloch@BLELLOCH.PC.CS.CMU.EDU> Received: from gs21.sp.cs.cmu.edu by G.GP.CS.CMU.EDU id aa03968; 16 Jun 92 14:43:47 EDT Received: from blelloch.pc.cs.cmu.edu by GS21.SP.CS.CMU.EDU id aa10058; 16 Jun 92 14:43:17 EDT From: Guy Blelloch Date: Tue, 16 Jun 92 14:42:50 EDT To: Anja.Feldmann@GS21.SP.CS.CMU.EDU cc: eschwabe@CS.CMU.EDU In-reply-to: Anja.Feldmann@GS21.SP.CS.CMU.EDU's message of Tue, 16 Jun 92 01:48:11 EDT Subject: oops Reply-to: guyb+@CS.CMU.EDU Status: RO In your writeup what do you mean by "optimized for common communication patterns"? This makes it sound like it is optimized for particular patterns. Perhaps it would be better to say something like "The fat-tree network is best suited for communication patterns with hierarchical locality. It supplies the highest per-processor bandwidth within clusters of four processors, a slightly lower per-processor bandwidth within clusters of 16, and the lowest per-processor bandwith across the root of the fat-tree. Communication patterns that take advantage of locality run up to four times faster than a random pattern with the same total throughput." You have a minor typo: "no special routing decisions on user level". Also, you might want to add "study the effect locality" to the list of things we intend to analyze. If you want, I can make these changes. Guy Here are a couple citations for the CM5. @manual{cm5, organization = "Thinking Machines Corporation", address = "Cambridge, Massachusetts", title = "The {Connection Machine} {CM-5} Technical Summary", month = "October", year = 1991 } @inproceedings{cm5network, author = "C. Leiserson and Z. S. Abuhamdeh and D. Douglas and C. R. Feynmann and M. Ganmukhi and J. Hill and W. D. Hillis and B. Kuszmaul and M. St. Pierre and D. Wells and M. Wong and S-W Yang and R. Zak", title = "The Network Architecture of the Connection Machine CM-5", address = "San Diego, CA", month = "July", booktitle = "Proceedings Symposium on Parallel Algorithms and Architectures", year = 1992 }