Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach

DOI10.1109/TC.1980.1675652MaRDI QIDQ3883483zbMATH OpenFDO

Authors Jan Węglarz

Publication date 1980

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

Full work available at URL https://doi.org/10.1109/TC.1980.1675652

zbMATH Keywords

deterministic schedulingindependent tasksmemory allocationmultiprocessor systempaged-virtual memorypreemptive scheduling

Mathematics Subject Classification ID

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

Cited in

(13)

• Resource level minimization in the discrete-continuous scheduling
• New trends in machine scheduling
• Discrete-continuous scheduling problems -- mean completion time results
• On a methodology for discrete-continuous scheduling
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• 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
• A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem
• On a certain class of power- and energy-related scheduling problems
• Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
• Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results

This page was built for publication: Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883483)