Hardware design of a new genetic based disk scheduling method

DOI10.1007/S11241-010-9111-8zbMath1213.68197OpenAlexW2046356131MaRDI QIDQ617747

Amir Momeni, Maghsoud Abbaspour, Mohsen Ebrahimi Moghaddam, Hossein Rahmani, Mohammad Reza Bonyadi

Publication date: 13 January 2011

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-010-9111-8

zbMATH Keywords

Genetic algorithmNeural networkHardware designDisk scheduling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Theory of operating systems (68N25)

Uses Software

• Unnamed Item
• Neural Network Toolbox
• Handel-C

Cites Work

• The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
• A comparison of multiprocessor task scheduling algorithms with communication costs
• Analysis of Scanning Policies for Reducing Disk Seek Times
• Unnamed Item

This page was built for publication: Hardware design of a new genetic based disk scheduling method