Hardware design of a new genetic based disk scheduling method (Q617747): Difference between revisions

@@ Property / describes a project that uses @@
+Handel-C
@@ Property / describes a project that uses: Handel-C / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11241-010-9111-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2046356131
@@ Property / OpenAlex ID: W2046356131 / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
+Normal rank
@@ Property / cites work @@
+Analysis of Scanning Policies for Reducing Disk Seek Times
+Normal rank
@@ Property / cites work @@
+A comparison of multiprocessor task scheduling algorithms with communication costs
+Normal rank
@@ Property / cites work @@
+The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
+Normal rank
@@ Property / cites work @@
+Q2719337
@@ Property / cites work: Q2719337 / rank @@
+Normal rank