Distributed multiprocessor scheduling with decomposed optimization criterion

DOI10.1016/S0167-739X(99)00119-3MaRDI QIDQ4538524zbMATH OpenOpenAlexFDO

Authors Franciszek Seredynski, Jacek Koronacki, Cezary Z. Janikow

Publication date 14 July 2002

Published in Future Generation Computer Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-739x(99)00119-3

zbMATH Keywords

competitive coevolutionary genetic algorithmdistributed algorithms

Mathematics Subject Classification ID

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

Recommendations

• Distributed scheduling using simple learning machines
• scientific article; zbMATH DE number 2079529
• Scheduling of parallel programs on configurable multiprocessors by genetic algorithms
• scientific article; zbMATH DE number 2084818
• Multiprocessor scheduling in a genetic paradigm

Cited in

(5)

• Distributed scheduling using simple learning machines
• Simultaneous batching and scheduling using dynamic decomposition on a grid
• An effective multiprocessor scheduling with use of GEO metaheuristic
• Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux
• Decentralized subcontractor scheduling with divisible jobs

This page was built for publication: Distributed multiprocessor scheduling with decomposed optimization criterion

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