Skip to main content

On Ensuring Correctness of Cold Scheduler

  • Conference paper
  • First Online:
Smart Computing Paradigms: New Progresses and Challenges

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 767))

  • 281 Accesses

Abstract

Cold scheduling is one widely used transformation technique that reorders the instruction sequence in such a way bit switching between two successive instructions will be minimum and thus reduces power consumption. To make the system reliable, ensuring correctness of cold scheduling is important. In this paper, a method for verification of cold scheduler is presented. Our method first extracts finite state machines with data paths (FSMDs) from the input and the output of a cold scheduler and then applies an FSMD-based equivalence checking method to ensure the correctness of the cold scheduler. We have implemented our method and tested on some examples. The results show the effectiveness of our method.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Graphviz - graph visualization software. https://graphviz.gitlab.io/

  2. D. Gajski, L. Ramachandran, Introduction to high-level synthesis. IEEE Trans. Des. Test Comput. pp. 44–54 (1994)

    Article  Google Scholar 

  3. D. Grune, K.V. Reeuwijk, H.E. Bal, C.J. Jacobs, K. Langendoen, Modern Compiler Design (Springer, Berlin, 2012)

    Book  Google Scholar 

  4. C.A.R. Hoare, An axiomatic basis for computer programming. Commun. ACM 12, 576–580 (1969). https://doi.org/10.1145/363235.363259

    Article  MATH  Google Scholar 

  5. C. Karfa, D. Sarkar, C. Mandal, P. Kumar, An equivalence-checking method for scheduling verification in high-level synthesis. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 27(3), 556–569 (2008)

    Article  Google Scholar 

  6. S. Microsystems, Ksparc assembly language - clemson university. https://people.cs.clemson.edu/~mark/sparc/control_structures.txt

  7. C.L. Su, A.M. Despain, Cold scheduling. Tech. rep. (1993)

    Google Scholar 

  8. J.B. Tristan, X. Leroy, Verified validation of lazy code motion. SIGPLAN Not. 44(6), 316–326 (2009)

    Article  Google Scholar 

  9. T.H. Weng, C.H. Lin, J.J.J. Shann, C.P. Chung, Power reduction by register relabeling for crosstalk-toggling free instruction bus coding, in 2010 International Computer Symposium (ICS2010), pp. 676–681 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aparna Barik .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Barik, A., Deb, N., Biswas, S. (2020). On Ensuring Correctness of Cold Scheduler. In: Elçi, A., Sa, P., Modi, C., Olague, G., Sahoo, M., Bakshi, S. (eds) Smart Computing Paradigms: New Progresses and Challenges. Advances in Intelligent Systems and Computing, vol 767. Springer, Singapore. https://doi.org/10.1007/978-981-13-9680-9_15

Download citation

Publish with us

Policies and ethics