Near or Far

TitleNear or Far
Publication TypeTechnical Report
Year of Publication1994
AuthorsHärtig, H.
Other Numbers874
Keywordsdistributed memory architectures, logical shared address space, massively parallel systems, programming languages
Abstract

To efficiently program massively parallel computers it is important to be aware of nearness or farness of references. It can be a severe performance bug if a reference that is meant to be near by a programmer turns out to be far. This paper presents a simple way to express nearness and farness in such a way that compile-time detection of such performance bugs becomes possible. It also allows for compile-time determination of nearness for many cases which can be used for compile time optimization techniques to overlap communication with processing. The method relies on the type system of a strongly typed object oriented language whose type rules are extended by three type coercion rules.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1994/tr-94-004.pdf
Bibliographic Notes

ICSI Technical Report TR-94-004

Abbreviated Authors

H. Härtig

ICSI Publication Type

Technical Report