2,605
Views
4
CrossRef citations to date
0
Altmetric
Short Communication

Disk scheduling using a customized discrete firefly algorithm

, , , & | (Reviewing Editor)
Article: 1011929 | Received 01 Nov 2014, Accepted 20 Jan 2015, Published online: 11 Mar 2015

References

  • Abbott, R. K., & Garcia-Molina, H. (1990). Scheduling I/O requests with deadlines: A performance evaluation. In Proceedings, 11th real-time systems symposium, 1990 (pp. 113–124). Lake Buena Vista, FL: IEEE.
  • Abshouri, A. A., Meybodi, M. R., & Bakhtiary, A. (2011). New firefly algorithm based on multi swarm & learning automata in dynamic environments. IEEE Proceedings, 13, 989–993.
  • Andrews, M., Bender, M. A., & Zhang, L. (1996). New algorithms for the disk scheduling problem. In Proceedings of 37th conference on foundations of computer science. Burlington, VT: IEEE Computer Society Press. doi:10.1109/sfcs.1996.548514
  • Arora, S., & Singh, S. (2013). The firefly optimization algorithm: Convergence analysis and parameter selection. International Journal of Computer Applications, 69, 48–52.
  • Banati, H., & Bajaj, M. (2011). Firefly based feature selection approach. International Journal of Computer Science Issues, 8, 473–480.
  • Basu, B., & Mahanti, G. K. (2011). Firefly and artificial bees colony algorithm for synthesis of scanned and broadside linear array antenna. Progress in Electromagnetics Research B, 2, 169–190.
  • Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization. Canadian Society for Unconventional Resources, 35, 268–308. doi:10.1145/937503.937505
  • Chen, T.-S., Yang, W.-P., & Lee, R. C. T. (1992). Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and N-Step SCAN. BIT Numerical Mathematics, 32, 546–558.
  • Falcon, R., Almeida, M., & Nayak, A. (2011). Fault identification with binary adaptive fireflies in parallel and distributed systems. In 2011 IEEE Congress of Evolutionary Computation (CEC). New Orleans, LA: IEEE. doi:10.1109/cec.2011.5949774
  • FUJITSU (1984). M236l a mini-disk drive customer engineering manual. Retrieved from http://chiclassiccomp.org/docs/content/computing/Fujitsu/B03P-4825-0002A02A_M2361A_CE_Manual_Jan87.pdf
  • Gandomi, A. H., Yang, X.-S., & Alavi, A. H. (2011). Mixed variable structural optimization using firefly Algorithm. Computers & Structures., 89, 2325–2336. doi:10.1016/j.compstruc.2011.08.002
  • Gazi, V. & Passino, K. M. (2004). Stability analysis of social foraging swarms. IEEE Transactions on Systems Man and Cybernetics, Part B (Cybernetics), 34, 539–557. doi:10.1109/tsmcb.2003.817077
  • Huang, P. C., Lu, W. C., Chou, C. N., & Shib, W. K. (2005). The NP hardness and the algorithm for real time disk scheduling in a multimedia system. In Proceedings, 11th IEEE International conference on embedded and real-time computing systems and applications, 2005 (260–265). IEEE.
  • Huang, P. C., Lu, W. C., Chou, C. N., & Shih, W. K. (2005). The NP-hardness and the algorithm for real-time disk-scheduling in a multimedia system. In 11th IEEE International conference on embedded and real-time computing systems and applications (RTCSA’05). Hong Kong: IEEE. doi:10.1109/rtcsa.2005.98
  • Jacobson, D. M., & Wilkes, J. (1991). Disk scheduling algorithms based on rotational position. Palo Alto, CA: Citeseer.
  • Jati, G. K., & Suyanto, S.. (2011). Evolutionary discrete firefly algorithm for travelling salesman problem. In A. Bouchachia Suyanto (Ed.),Adaptive and Intelligent Systems (pp. 393–403). Klagenfurt: Springer. doi:10.1007/978-3-642-23857-4_38.
  • Ökdem, S., & Karaboga, D. (2006). Optimal disk scheduling based on ant colony optimization algorithm. Erciyes University Journal Institute of Science and Technology, 22, 11–19.
  • Palit, S., Sinha, S. N., Molla, M. A., Khanra, A., & Kule, M. (2011). A cryptanalytic attack on the knapsack cryptosystem using binary firefly algorithm. In 2011 2nd International conference on computer and communication technology (ICCCT-2011). Allahabad: IEEE. doi:10.1109/iccct.2011.6075143
  • Rahmani, H., Arshad, S., & Moghaddam, M. E. (2009). A disk scheduling algorithm based on ant colony optimization. In ISCA PDCCS (37–42). Louisville, KY.
  • Ruemmler, C., & Wilkes, J. (1994). An introduction to disk drive modeling. Computer, 27, 17–28. doi:10.1109/2.268881
  • Sayadi, M. K., Ramezanian, R., & Ghaffari-Nasab, N. (2010). A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations, 1(1), 1–10. doi:10.5267/j.ijiec.2010.01.001
  • Seltzer, M., Chen, P., & Ousterhout, J. (1990). Disk scheduling revisited. In Proceedings of the winter 1990 USENIX technical conference (pp. 313–323). Washington, DC.
  • Senthilnath, J., Omkar, S. N., & Mani, V. (2011). Clustering using firefly algorithm: Performance study. Swarm and Evolutionary Computation, 1, 164–171. doi:10.1016/j.swevo.2011.06.003
  • Silberschatz, A., Galvin, P. B., & Gagne, G. (2013). Operating system concepts (Vol. 8). New York, NY: Wiley.
  • Teorey, T. J., & Pinkerton, T. B. (1972). A comparative analysis of disk scheduling policies. Communications of the ACM, 15, 177–184.
  • Yagiura, M., & Ibaraki, T. (2001). On metaheuristic algorithms for combinatorial optimization problems. System and Computers in Japan, 32, 33–55. doi:10.1002/1520-684x(200103)32:3<33::aid-scj4>3.0.co;2-p
  • Yang, X.-S. (2009). Firefly algorithms for multimodal optimization. In O. Watanabe, & T. Zeugmann (Eds.),Stochastic algorithms: Foundations and applications (pp. 169–178). Sapporo: Springer.
  • Yang, X.-S. (2010). Firefly algorithm, stochastic test functions and design optimisation. International Journal of Bio-inspired Computation, 2, 78–84.
  • Yang, X.-S., Cui, Z., Xiao, R., Gandomi, A. H., & Karamanoglu, M. (2013). Swarm intelligence and bio-inspired computation: Theory and applications. Amsterdam: Newnes.
  • Yeh, T.-H., Kuo, C.-M., Lei, C.-L., & Yen, H.-C. (1998). Competitive analysis of on-line disk scheduling. Theory of Computing Systems, 31, 491–506.