ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING

DOI10.1080/10637199508915525zbMATH Open1049.68527OpenAlexW1986517065MaRDI QIDQ4820124FDOQ4820124

Authors: Hesham El-Rewini, Hesham H. Ali 

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199508915525

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Optimal scheduling for two-processor systems
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Title not available (Why is that?)
• NP-complete scheduling problems
• Scheduling Graphs on Two Processors

This page was built for publication: ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING

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