Skip to main content

Advertisement

SpringerLink
Log in

Hardware design of a new genetic based disk scheduling method

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Disk management is an increasingly important aspect of operating systems research and development because it has great effect on system performance. As the gap between processor and disk performance continues to increase in modern systems, access to mass storage is a common bottleneck that ultimately limits overall system performance. In this paper, we propose hardware architecture of a new genetic based real-time disk scheduling method. Also, to have a precise simulation, a neural network is proposed to simulate seek-time of disks. Simulation results showed the hardware implementation of proposed algorithm outperformed software implementation in term of execution time, and other related works in terms of number of tasks that miss deadlines and average seeks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abbott R, Molina HG (1990) Scheduling I/O requests with deadlines: a performance evaluation. In: Proceedings of the IEEE real-time systems symposium, RTSS, pp 113–124

    Google Scholar 

  • Aboutabl M, Agrawala A, Decotignie JD (1997) Temporally determinate disk access: an experimental approach. In: Proceedings of the ACM SIGMETRICS joint international conference on measurement and modeling of computer systems, pp 280–281

    Google Scholar 

  • Buddhikot MM, Parulkar GM, Cox JR (1994) Design of a large scale multimedia storage server. J Comput Netw ISDN Syst 27(3):503–517

    Article  Google Scholar 

  • Chang RI, Shih WK, Chang RC (1998) Deadline-modification-scan with maximum scannable-groups for multimedia real-time disk scheduling. In: Proceedings of the IEEE real-time systems symposium, pp 40–49

    Google Scholar 

  • Chang HP, Chang RI, Shih WK, Chang RC (2001) Reschedulable-group-scan scheme for mixed real-time/non-real-time disk scheduling in a multimedia system. J Syst Softw 59(2):143–152

    Article  Google Scholar 

  • Chang HP, Chang RI, Shih WK, Chang RC (2007) GSR: a global seek-optimizing real-time disk-scheduling algorithm. J Syst Softw 80(2):198–215

    Article  Google Scholar 

  • John SC, Stankovic JA, Kurose JF, Towsley D (1991) Performance evaluation of two new disk scheduling algorithms for real-time systems. J Real-Time Syst 3(3):307–336

    Article  Google Scholar 

  • Chen TS, Yang WP, Lee RCT (1992) Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and N-step SCAN. BIT 32(4):546–558

    Article  MATH  MathSciNet  Google Scholar 

  • Chen PY, Chen RD, Chang YP, Shieh LS, Malki HA (2008) Hardware implementation for a genetic algorithm. IEEE Trans Instrum Meas 57(4):699–705

    Article  Google Scholar 

  • Chiueh TC, Huang L (2002) Track-based disk logging. In: Proceedings of international conference on dependable systems and networks, pp 429–438

    Chapter  Google Scholar 

  • Coffman EG, Klimko LA, Ryan B (1972) Analysis of scanning policies for reducing disk seek times. SIAM J Comput 1(3):269–279

    Article  MATH  Google Scholar 

  • Demuth H, Beale M (1993) Neural network toolbox for use with Matlab. User Guide Version 4, The Mathworks, Inc

  • Denning PJ (1967) Effects of scheduling on file memory operations. In: AFIPS joint computer conferences. Atlantic City, New Jersey, pp 9–21

    Google Scholar 

  • Geist R, Daniel S (1987) A continuum of disk scheduling algorithms. ACM Trans Comput Syst 5(1):77–92

    Article  Google Scholar 

  • Gemmell J, Christoduoulakis S (1992) Principles of delay sensitive multimedia data storage and retrieval. ACM Trans Inf Syst 10(1):51–90

    Article  Google Scholar 

  • Gim J, Won Y, Chang J, Shim J, Park Y (2008) DIG: rapid characterization of modern hard disk drive and its performance implication. In: 5th IEEE international workshop on in storage network architecture and parallel I/Os

  • Hagan MT, Demuth HB, Beale M (1996) Neural network design. PWS, Boston

    Google Scholar 

  • Hofri M (1980) Disk scheduling: FCFS vs. SSTF revisited. Commun ACM 23(11):645–653

    Article  Google Scholar 

  • Holland JH (1975) Adaption in natural and artificial systems. University of Michigan Press, Ann Arbor

    MATH  Google Scholar 

  • Huang PC, Lu WC, Chou CN, Shih WK (2005) The NP-hardness and the algorithm for real-time disk-scheduling in a multimedia system. In: Proceedings of the 11th IEEE international conference on embedded and real-time computing systems and applications, RTCSA’05, Hong Kong, pp 260–265

    Google Scholar 

  • Hwang R, Gen M, Katayama H (2008) A comparison of multiprocessor task scheduling algorithm with communication cost. Comput Oper Res 35(3):976–993

    Article  MATH  MathSciNet  Google Scholar 

  • Iyer S (2001) The effect of deceptive idleness on disk schedulers. Master’s thesis, Computer Science Department, Rice University

  • Schindler J, Griffin JL, Lumb CR, Ganger GR (2002) Track-aligned extents: matching access patterns to disk drive characteristics. In: Proceedings of the 1st usenix symposium on file and storage technologies, FAST

  • Lei T, Zhu MC, Wang JX (2002) The hardware implementation of a genetic algorithm model with FPGA. In: IEEE international conference on field-programmable technology, Hong Kong, pp 374–377

    Google Scholar 

  • Liu B, Rangaswami R, Dimitrijevic Z (2005) Thwarting virtual bottlenecks in multi-bitrate streaming servers. In: Proceedings of the real-time systems symposium WiP

  • Lu LF, Yuan JJ (2007) The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. Eur J Oper Res 177(2):1302–1309

    Article  MATH  Google Scholar 

  • Martin P (2002) An analysis of random number generators for a hardware implementation of genetic programming using FPGAs and Handel-C. In: Proceedings of the genetic and evolutionary computation conference, pp 837–844

    Google Scholar 

  • Selvi RM, Rajaram R (2007) Effect of cross over operation in genetic algorithms on anticipatory scheduling. In: 24th international symposium on automation & robotics in construction, ISARC

  • Ökdem S, Karaboga D (2006) Optimal disk scheduling based on ant colony optimization algorithm. Erciyes Univ J Inst Sci Technol 22:11–19

    Google Scholar 

  • Plagemann T, Goebel V, Halvorsen P, Anshus O (2000) Operating system support for multimedia systems. Comput Commun J 23(3):267–289

    Article  Google Scholar 

  • Reddy ALN, Wyllie JC (1994) I/O issues in a multimedia system. IEEE Comput 27(3):69–74

    Google Scholar 

  • Reddy ALN, Wyllie J, Wijayaratne KBR (2005) Disk scheduling in a multimedia I/O system. ACM Trans Multimed Comput Commun Appl 1(1):37–59

    Article  Google Scholar 

  • Ruemmler C, Wilkes J (1994) An introduction to disc drive modeling. IEEE Comput 27(3):17–29

    Google Scholar 

  • Santos R, Lipari G, Santos J (2008) Improving the schedulability of soft real-time open dynamic systems: the inheritor is actually a debtor. J Syst Software 81(7):1093–1104

    Article  Google Scholar 

  • Schlosser SW, Schindler J, Papadomanolakis S, Shao M, Ailamaki A, Faloutsos C, Ganger GR (2005) On multidimensional data and modern disks. In: Proceedings of the 4th USENIX conference on file and storage technology, FAST ’05. San Francisco, pp 225–238

    Google Scholar 

  • Serra M, Slater T, Muzio JC, Miller DM (1990) The analysis of one-dimensional linear cellular automata and their aliasing properties. IEEE Trans Comput-Aided Des Integr Circuits Syst 9(7):767–778

    Article  Google Scholar 

  • Sohn JM, Kim GY (1997) Earliest-deadline-first scheduling on nonpreemptive real-time threads for continuous media server. In: Proceedings of the conference on high-performance computing and networking

  • Tachibana T, Murata Y, Shibata N, Yasumoto K, Ito M (2006) General architecture for hardware implementation of genetic algorithm. In: Proceedings of the 14th annual IEEE symposium on field-programmable custom computing machines, pp 291–292

    Chapter  Google Scholar 

  • Tachibana T, Murata Y, Shibata N, Yasumoto K, Ito M (2007) Proposal of flexible implementation of genetic algorithms on FPGAs. Syst Comput Jpn 38(13):28–38

    Article  Google Scholar 

  • Tanenbaum AS (2001) Modern operating systems, 2nd edn. Prentice Hall, New York

    Google Scholar 

  • Thomas S, Seshadri S, Haritsa JR (1996) Integrating standard transactions in firm real-time database systems. Inf Syst 21(1):3–28

    Article  Google Scholar 

  • Turton BCH, Arsalan T (1995) A parallel genetic VLSI architecture for combinatorial real-time applications-disk scheduling. In: IEEE international conference on genetic algorithms in engineering systems: innovations and applications, GALESIA, pp 493–498

    Google Scholar 

  • Ulusoy O, Belford GG (1993) Real-time transaction scheduling in database systems. Inf Syst 18(9):559–580

    Article  Google Scholar 

  • Wong CK (1980) Minimizing expected head movement in one dimension and two dimensions mass storage system. ACM Comput Surv 12(2):167–178

    Article  Google Scholar 

  • Worthington BL, Ganger GR, Patt YN (1994) Scheduling algorithms for modern disk drives. In: Proceedings of ACM SIGMETRICS conference, pp 241–251

    Chapter  Google Scholar 

  • Worthington BL, Ganger GR, Patt YN, Wilkes J (1995) On-line extraction of SCSI disk drive parameters. ACM SIGMETRICS Perform Eval Rev 23(1), 146–156

    Article  Google Scholar 

  • Wu AS, Yu H, Jin S, Lin KC, Schiavone G (2004) An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 15(9):824–834

    Article  Google Scholar 

  • Yu PS, Chen MS, Kandlur DD (1992) Design and analysis of a grouped sweeping scheme for multimedia storage management. In: 3rd international workshop on network and operating system support for digital audio and video, SanDiego, California, pp 44–55

    Google Scholar 

  • Yu PS, Chen MS, Kandlur DD (1993) Grouped sweeping scheduling for DASD-based multimedia storage management. Multimed Syst 1(3):99–109

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, Shahid Beheshti University G.C., Tehran, Iran

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

Authors
  1. Hossein Rahmani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Reza Bonyadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amir Momeni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mohsen Ebrahimi Moghaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Maghsoud Abbaspour
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohsen Ebrahimi Moghaddam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rahmani, H., Bonyadi, M.R., Momeni, A. et al. Hardware design of a new genetic based disk scheduling method. Real-Time Syst 47, 41–71 (2011). https://doi.org/10.1007/s11241-010-9111-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-010-9111-8

Keywords

Search

Navigation