PARAdeg-processor scheduling for acyclic SWITCH-less program nets

DOI10.1016/S0016-0032(99)00026-5zbMath0978.90053WikidataQ126401613 ScholiaQ126401613MaRDI QIDQ5926845

Qi-Wei Ge

Publication date: 7 March 2001

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

zbMATH Keywords

evaluationdata-flow programGA schedulinglist schedulingmultiprocessor schedulingprogram net

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal scheduling for two-processor systems
• Execution termination and computation determinacy of data-flow program nets
• A comparison of list schedules for parallel processing systems
• A Data Flow Multiprocessor
• Complexity of Scheduling under Precedence Constraints
• A method of computing minimum firing time for self-cleaning SWITCH-less program nets

This page was built for publication: PARAdeg-processor scheduling for acyclic SWITCH-less program nets