Gast ::
| Hauptseite > Publikationsdatenbank > IBM 3090 Memory Access: Measurement and Simulation > print |
| 001 | 189273 | ||
| 005 | 20210129215332.0 | ||
| 037 | _ | _ | |a FZJ-2015-02451 |
| 100 | 1 | _ | |a Homberg, Wilhelm |0 P:(DE-Juel1)132142 |b 0 |e Corresponding Author |u fzj |
| 111 | 2 | _ | |a SHARE Europe (SEAS) Spring Meeting 1991 |c Lausanne |d 1991-04-08 - 1991-04-12 |w Switzerland |
| 245 | _ | _ | |a IBM 3090 Memory Access: Measurement and Simulation |
| 260 | _ | _ | |c 1991 |
| 295 | 1 | 0 | |a Proceedings ot the SHARE Europe (SEAS) Spring Meeting 1991 |
| 300 | _ | _ | |a 14 p. |
| 336 | 7 | _ | |a Contribution to a conference proceedings |b contrib |m contrib |0 PUB:(DE-HGF)8 |s 1428933195_30910 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a Contribution to a book |0 PUB:(DE-HGF)7 |2 PUB:(DE-HGF) |m contb |
| 336 | 7 | _ | |a Conference Paper |0 33 |2 EndNote |
| 336 | 7 | _ | |a CONFERENCE_PAPER |2 ORCID |
| 336 | 7 | _ | |a Output Types/Conference Paper |2 DataCite |
| 336 | 7 | _ | |a conferenceObject |2 DRIVER |
| 336 | 7 | _ | |a INPROCEEDINGS |2 BibTeX |
| 520 | _ | _ | |a The imbalance between processor speed and memory access time is one characteristic issue of modern high-speed computers sometimes leading to a bottleneck for algorithms with a great amount of memory traffic. Different architectural concepts are provided to diminish this effect. One attempt to reach this goal is the implementation of a hierarchical memory structure. On IBM computers, this hierarchy includes CPU, cache (high-speed buffer), main memory, and paging devices (e.g. expanded storage and disks).A model focusing on the memory architecture of the IBM 3090 family is developed and the behavior of sequential algorithms with respect to cache and translation lookaside buffer (TLB) is considered. For a given sequence of memory references the numbers of cache misses and TLB misses are calculated and the amount of CPU time consumed by these effects can be estimated. Parameters describing the buffer size, line length, the number of sets, and different replacement algorithms are taken into account.The model is verified by studying the performance of application-oriented programs from numerical linear algebra with a known memory access pattern. Jobs were run on IBM 3090 computers differing in cache size and processor cycle time. The measured CPU time consumption is compared with the predicted results showing that measurement and simulation are in good agreement. |
| 536 | _ | _ | |a 899 - ohne Topic (POF2-899) |0 G:(DE-HGF)POF2-899 |c POF2-899 |x 0 |f POF I |
| 700 | 1 | _ | |a Hake, Jürgen-Fr. |0 P:(DE-Juel1)130461 |b 1 |u fzj |
| 700 | 1 | _ | |a Gürich, Wolfgang |0 P:(DE-Juel1)132121 |b 2 |u fzj |
| 909 | C | O | |o oai:juser.fz-juelich.de:189273 |p VDB |
| 910 | 1 | _ | |a Forschungszentrum Jülich GmbH |0 I:(DE-588b)5008462-8 |k FZJ |b 0 |6 P:(DE-Juel1)132142 |
| 910 | 1 | _ | |a Forschungszentrum Jülich GmbH |0 I:(DE-588b)5008462-8 |k FZJ |b 1 |6 P:(DE-Juel1)130461 |
| 910 | 1 | _ | |a Forschungszentrum Jülich GmbH |0 I:(DE-588b)5008462-8 |k FZJ |b 2 |6 P:(DE-Juel1)132121 |
| 913 | 2 | _ | |a DE-HGF |b Forschungsbereich Materie |l Forschungsbereich Materie |1 G:(DE-HGF)POF3-890 |0 G:(DE-HGF)POF3-899 |2 G:(DE-HGF)POF3-800 |v ohne Topic |x 0 |
| 913 | 1 | _ | |a DE-HGF |b Programmungebundene Forschung |l ohne Programm |1 G:(DE-HGF)POF2-890 |0 G:(DE-HGF)POF2-899 |2 G:(DE-HGF)POF2-800 |v ohne Topic |x 0 |4 G:(DE-HGF)POF |3 G:(DE-HGF)POF2 |
| 920 | 1 | _ | |0 I:(DE-Juel1)VDB62 |k ZAM |l Zentralinstitut für Angewandte Mathematik |x 0 |
| 920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 1 |
| 980 | _ | _ | |a contrib |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a contb |
| 980 | _ | _ | |a I:(DE-Juel1)VDB62 |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | _ | _ | |a UNRESTRICTED |
| 981 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|