Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site ucsbcsl.UUCP Path: utzoo!watmath!clyde!burl!ulysses!mhuxj!mhuxn!houxm!ihnp4!zehntel!dual!amdcad!decwrl!decvax!ittvax!dcdwest!sdcsvax!sdcrdcf!trwrb!cepu!ucsbcsl!frew From: frew@ucsbcsl.UUCP ( ) Newsgroups: net.wanted Subject: matrix transpose algorithms Message-ID: <199@ucsbcsl.UUCP> Date: Sun, 2-Dec-84 16:51:54 EST Article-I.D.: ucsbcsl.199 Posted: Sun Dec 2 16:51:54 1984 Date-Received: Wed, 5-Dec-84 00:32:41 EST Organization: U.C. Santa Barbara Lines: 10 A few years ago I ran across a journal article on designing matrix transpose algorithms for virtual-memory environments, which discussed optimizations based on page size, working set size, etc. I cannot remember the title, the author, or the journal in which it appeared. Does this ring any bells out in netland? Please email me if you have any leads. "Thanks in advance." -- James Frew {cepu,dscvax2,sdcsvax,ucbvax}!ucsbcsl!frew Computer Systems Lab., Univ. of Calif., Santa Barbara, CA 93106 (805) 961-2309