| 1. |
- Brorsson, Mats
(författare)
-
A decentralized virtual memory scheme implemented on an emulated multiprocessor
- 1989
-
Ingår i: Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Vol.I. ; , s. 286-95
-
Konferensbidrag (refereegranskat)abstract
- A decentralized scheme for virtual memory management on MIMD (multiple-instruction-multiple-data) multiprocessors with shared memory has been developed. Control and data structures are kept local to the processing elements (PE), which reduces the global traffic and makes a high degree of parallelism possible. Each of the PEs in the target architecture consists of a processor and part of the shared memory and is connected to the others by a common bus. The traditional approach, based on replication or sharing of data structures is not suitable in this case when the number of PEs is of the magnitude of 100. This is due to the excessive global traffic caused by consistency or mutual exclusion protocols. A variant of the Dennings working set page replacement algorithm is used, in which each process owns a page list. Shared pages are not present in more than one list, and it is shown that this will not increase the page fault rate in most cases.
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Hultman, Johan
(författare)
-
A software system for defining and controlling actions in a mechanical system
- 1988
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis deals with the subject of technical systems where machinery, usually of mechanical character, are controlled by a computer system. Sensors in the system provide information about a machine’s current state, and are crucial for the controlling computer. The thesis presents an architecture for such a software system and then describes the actual implementation along with some examples.
|
|
| 5. |
|
|
| 6. |
- Lerner, Mark D., et al.
(författare)
-
An Overview of the DADO Parallel Computer
- 1985
-
Ingår i: Afips Conference Proceedings. - : University of Chicago Press, 5720 S Woodlawn Ave, Chicago, IL 60637. ; , s. 297-306
-
Konferensbidrag (refereegranskat)
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Palm, J., et al.
(författare)
-
A faster SPACFIL
- 1987
-
Ingår i: Computers & Chemistry. - : Elsevier BV. - 0097-8485. ; 11:3, s. 223-225
-
Tidskriftsartikel (refereegranskat)
|
|
| 10. |
- Smith, Jonathan M., et al.
(författare)
-
Effects of Copy-on-Write Memory Management on the Response Time of UNIX Fork Operations
- 1988
-
Ingår i: Computing Systems. - : Usenix. - 0895-6340. ; 1:3, s. 255-278
-
Tidskriftsartikel (refereegranskat)abstract
- We present techniques for analyzing the effect of ‘‘copy-on-write’ ’ page management strategies on the performance of UNIX (TM) fork() operations. The analysis techniques are applied on two workstations, the AT&T 3B2/310 TM and the Hewlett-Packard HP9000/350 TM in order to determine the relationships between the amount of memory in the parent’s data segment, the fraction of this memory which is written by the child, and the improvement in execution time due to ‘‘copy-on-write’’. Since the implementation of ‘‘copy-on-write’ ’ is straightforward with modern MMUs, our results for these workstations are readily generalized to other workstations. The results show that the size of the parent’s allocated memory has little direct effect on performance, due to the fact that only page table entries are copied during the fork() operations. The execution time is most influenced by the amount of memory that must be copied, which can be determined from the product of memory allocated and the fraction of memory written. Thus, the worst case occurs when large address space programs update much of their memory. In order to observe what occurs in practice, we measured two programs that have what are currently considered large address spaces. These programs, which we believe to be representative of the sorts of programs.
|
|
