Date: Tue, 9 Feb 1999 21:42:22 +0000 (GMT) From: Terry Lambert <tlambert@primenet.com> To: MattL@ModaCAD.com (Matt Liu) Cc: smp@FreeBSD.ORG Subject: Re: your mail Message-ID: <199902092142.OAA04536@usr02.primenet.com> In-Reply-To: <FF3D531B70BAD211AD580000F805EB760647C3@EXCHANGE_SERVER> from "Matt Liu" at Feb 9, 99 11:32:55 am
next in thread | previous in thread | raw e-mail | index | archive | help
> I am looking around to find some smp hardware programming references. Can > anyone give me a pointer I don't know exactly what you are asking for here. If you are asking for "how to build SMP systems", I'd suggest: Unix Systems for Modern Architectures : Symmetric Multiprocesssing and Caching for Kernel Programmers (Addison-Wesley Professional Computing Series) Curt Schimmel Addison-Wesley Pub Co ISBN: 0201633388 Scheduling and Load Balancing in Parallel and Distributed Systems Editted by: Behrooz A. Shirazi, Ali R. Hurson, Krishna M. Kavi IEEE Computer Society Press IEEE Catalog Number: EH0417-6 ISBN: 0-8186-6587-4 For more introductory texts, I'd suggest: Unix Internals : The New Frontiers Uresh Vahalia Prentice Hall ISBN: 0131019082 The Magic Garden Explained : The Internals of Unix System V Release 4 : An Open Systems Design Berny Goodheart, James Cox, John R. Mashey Prentice Hall ISBN: 0130981389 Other than that, there are a lot of texts on programming for parallel systems available from Amazon. You might also want to check out NCSTRL: NCSTRL, Networked Computer Science Technical Reports Library (pronounced "ancestral") is an international collection of computer science technical reports from CS departments and industrial and government research laboratories, made available for non-commercial and educational use. NCSTRL includes reports of UC Berkeley Computer Science Division. The Berkeley gateway is: http://sunsite.Berkeley.EDU/NCSTRL/ But basically, any University that does CS research at all will have a gateway to the database. If you want to get heavy into the math for programming, this is a good reference: Domain Decomposition : Parallel Multilevel Methods for Elliptic Partial Differential Equations Barry F. Smith, Petter E. Bjrstad, William Gropp (Contributor), Petter Bjorstad (Contributor) Cambridge Univ Pr (Short) ISBN: 052149589X In general, most of the papers will be heavy into graph theory, Clifford algebras, and/or partial differential equations. The Domain Decomposition book (above) is interesting in that the proof of Fermat's last theorem involves a proof for Taniyama-Shimura, which states that all elliptic curves have modular forms. This means that there is probably room for a lot of interesting research using modular forms for domain decomposition to increase algorithmic concurrency. There's probably a PhD in there for someone. I guess now I'm waiting to see if someone can connect modular forms with hyperbolic factoring of the product of two primes. I wonder what problem domain that would apply to... ;-). Terry Lambert terry@lambert.org --- Any opinions in this posting are my own and not those of my present or previous employers. To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-smp" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199902092142.OAA04536>