Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach

DOI10.1109/TC.1980.1675652zbMath0441.68034MaRDI QIDQ3883483

Jan Weglarz

Publication date: 1980

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

deterministic schedulingpreemptive schedulingindependent tasksmemory allocationmultiprocessor systempaged-virtual memory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items

A note on scheduling on a single processor with speed dependent on a number of executed jobs, New trends in machine scheduling, Project scheduling with finite or infinite number of activity processing modes -- a survey, On a certain class of power- and energy-related scheduling problems, Discrete-continuous project scheduling with discounted cash flows - a tabu search approach, Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic, Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms, Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan, A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem, Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results, Discrete-continuous scheduling problems -- mean completion time results, Resource level minimization in the discrete-continuous scheduling, On a methodology for discrete-continuous scheduling