Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood

DOI10.1007/s11047-013-9375-8zbMath1334.68034OpenAlexW2053825512MaRDI QIDQ272772

Gina M. B. Oliveira, Murillo G. Carneiro

Publication date: 21 April 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-013-9375-8

zbMATH Keywords

cellular automatamultiprocessor task schedulingevolutionary searchknowledge extractionpseudo-linear neighborhoodsynchronous updating

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Cellular automata (computational aspects) (68Q80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
• Statistical mechanics of cellular automata
• Computing Issues of Asynchronous CA
• Scheduling

This page was built for publication: Synchronous cellular automata-based scheduler initialized by heuristic and modeled by a pseudo-linear neighborhood