A Survey of Microprocessor Architectures for Memory Management

Furht,; Milutinovic,

doi:10.1109/mc.1987.1663508

Cited by 20 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When preempting a job to execute an urgent job, the operating system will need to transfer the states to a swap memory space before the new job can start. The time spent for swapping the memory space is referred to as the swapping time [39], [40].…”

Section: A Preemption Using In-memory Process Swappingmentioning

confidence: 99%

Preemptive Parallel Job Scheduling for Heterogeneous Systems Supporting Urgent Computing

et al. 2021

View full text Add to dashboard Cite

Dedicated infrastructures are commonly used for urgent computations. However, using dedicated resources is not always affordable due to budget constraints. As a result, utilizing shared infrastructures becomes an alternative solution for urgent computations. Since the infrastructures are meant to serve many users, the urgent jobs may arrive when regular jobs are using the necessary resources. In such a case, it is necessary to preempt the regular jobs so that urgent jobs can be executed immediately. Most conventional methods for job scheduling have focused on reducing the response times and waiting times of all jobs. However, these methods can delay urgent jobs and hinder them from being completed within a stipulated deadline. Furthermore, in heterogeneous systems with coprocessors, preemption becomes more difficult because coprocessors rely on several system software functionalities provided by the host processor. In this paper, we propose a parallel job scheduling method to effectively use shared heterogeneous systems for urgent computations. Our method employs an in-memory process swapping mechanism to preempt jobs running on the coprocessor devices. The results of our simulations show that our method can achieve a significant reduction in the response time and slowdown of regular jobs without substantial delays of urgent jobs. INDEX TERMS job scheduling, urgent computing, heterogeneous systems, preemption, process swapping.

show abstract

Section: A Preemption Using In-memory Process Swappingmentioning

confidence: 99%

Preemptive Parallel Job Scheduling for Heterogeneous Systems Supporting Urgent Computing

et al. 2021

View full text Add to dashboard Cite

show abstract

“…In a system featuring a memory management unit (MMU) interposed between the processor and the primary memory system, the MMU is usually aimed at: (i) translating the virtual addresses generated by the processor into physical addresses in the primary memory; (ii) implementing a virtual memory system (that is, a virtual memory space much larger than the physical space); and (iii) supporting forms of memory protection and security [9]. the least recently used algorithm is typically used to find an entry to be replaced.…”

Section: Hardware Costsmentioning

confidence: 99%

Memory protection in embedded systems

Lopriore

2016

Journal of Systems Architecture

View full text Add to dashboard Cite

With reference to an embedded system featuring no support for memory management, we present a model of a protection system based on passwords. At the hardware level, our model takes advantage of a memory protection unit (MPU) interposed between the processor and the complex of the main memory and the input-output devices. The MPU supports both concepts of a protection context and a protection domain. A protection context is a set of access rights for the memory pages; a protection domain is a set of one or more protection contexts. Passwords are associated with protection domains. A process that holds a given password can take advantage of this password to activate the corresponding domain. A small set of protection primitives makes it possible to modify the composition of the domains in a strictly controlled fashion.\ud The proposed protection model is evaluated from a number of important viewpoints, which include password distribution, review and revocation, the memory requirements for storage of the information concerning protection, and the time necessary for password validation

show abstract

“…An application process will be created for the execution of the program. Different applications execute in their own addressing spaces, and they are invisible from one and other by the 2764 Information Technology Applications in Industry, Computer Engineering and Materials Science use of virtual memory system [7]. In traditional hardware, protection mechanism normally implemented with page or segment table where access right information is maintained, as shown in Figure 4.…”

Section: Compilation Approachmentioning

confidence: 99%