Skip to main content
SpringerLink
Log in

Conflictless Task Scheduling Using Association Rules

  • Conference paper
  • First Online:
Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery (BDAS 2015, BDAS 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 613))

  • 1146 Accesses

Abstract

The proposed rules of conflictless task scheduling is based on binary representation of tasks. Binary identifiers promote the process of rapid detection of conflicts between tasks. The article presents the concept of conflictless tasks scheduling using one of the data mining methods, namely association rules.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec. 22(2), 207–216 (1993)

    Article  Google Scholar 

  2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I., et al.: Fast discovery of association rules. Adv. Knowl. Discov. Data Min. 12(1), 307–328 (1996)

    Google Scholar 

  3. Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB. vol. 1215, pp. 487–499 (1994)

    Google Scholar 

  4. Bedworth, M., O’Brien, J.: The omnibus model: a new model of data fusion? IEEE Aerosp. Electron. Syst. Mag. 15(4), 30–36 (2000)

    Article  Google Scholar 

  5. Belik, F.: An efficient deadlock avoidance technique. IEEE Trans. Comput. 39(7), 882–888 (1990)

    Article  Google Scholar 

  6. Duraj, A.: Application of fussyclassify of data classification. J. Appl. Comput. Sci. 21, 39–52 (2013)

    Google Scholar 

  7. Duraj, A., Krawczyk, A.: Outliers detection of signals in biomedical information systems fusion. Electr. Rev. 12b, 56–60 (2012)

    Google Scholar 

  8. Guillet, F., Hamilton, H.J.: Quality Measures in Data Mining, vol. 43. Springer, Heidelberg (2007)

    Book  MATH  Google Scholar 

  9. Han, E.H., Karypis, G., Kumar, V., Mobasher, B.: Clustering based on association rule hypergraphs. University of Minnesota, Department of Computer Science (1997)

    Google Scholar 

  10. Hilderman, R., Hamilton, H.J.: Knowledge Discovery and Measures of Interest, vol. 638. Springer, Heidelberg (2013)

    MATH  Google Scholar 

  11. Hipp, J., Güntzer, U., Nakhaeizadeh, G.: Algorithms for association rule mining – a general survey and comparison. SIGKDD Explor. Newsl. 2(1), 58–64 (2000)

    Article  Google Scholar 

  12. Lin, W., Alvarez, S.A., Ruiz, C.: Efficient adaptive-support association rule mining for recommender systems. Data Min. Knowl. Discovery 6(1), 83–105 (2002)

    Article  MathSciNet  Google Scholar 

  13. McGarry, K.: A survey of interestingness measures for knowledge discovery. Knowl. Eng. Rev. 20(01), 39–61 (2005)

    Article  Google Scholar 

  14. Mobasher, B., Dai, H., Luo, T., Nakagawa, M.: Effective personalization based on association rule discovery from web usage data. In: Proceedings of the 3rd International Workshop on Web Information and Data Management. WIDM 2001, pp. 9–15 (2001)

    Google Scholar 

  15. Rajendran, P., Madheswaran, M.: Hybrid medical image classification using association rule mining with decision tree algorithm. CoRR abs/1001.3503 (2010)

    Google Scholar 

  16. Sarawagi, S., Thomas, S., Agrawal, R.: Integrating association rule mining with relational database systems: alternatives and implications. SIGMOD Rec. 27(2), 343–354 (1998)

    Article  Google Scholar 

  17. Silberschatz, A., Galvin, P., Gagne, G.: Applied Operating System Concepts. Wiley, Hoboken (2001)

    Google Scholar 

  18. Silberschatz, A., Galvin, P., Gagne, G.: Operating System Concepts. Wiley, Hoboken (2012)

    MATH  Google Scholar 

  19. Smolinski, M.: Rigorous history of distributed transaction execution with systolic array support. XXXI ISAT Conf. Inf. Syst. Archit. Technol. New Dev. Web-Age Inf. Syst. 28(1), 235–254 (2010)

    Google Scholar 

  20. Smolinski, M.: Conflictless task scheduling concept. In: Borzemski, L., Grzech, A., Świątek, J., Wilimowska, Z. (eds.) Information Systems Architecture and Technology: Proceedings of 36th International Conference on Information Systems Architecture and Technology - ISAT 2015 - Part I. Advances in Intelligent Systems and Computing, vol. 429. Springer, Heidelberg (2016)

    Google Scholar 

  21. Smolinski, M.: Coordination of parallel tasks in access to resource groups by adaptive conflictless scheduling. In: Kozielski, S., Mrozek, D., Kasprowski, P., Malysiak-Mrozek, B., Kostrzewa, D. (eds.) Beyong Databases, Architectures and Structures, BDAS 2016, Poland. Communications in Computer and Information Science, pp. 272–282. Springer, Heidelberg (2016)

    Google Scholar 

  22. Stetsyura, G.G.: Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems. Autom. Remote Control 71(4), 708–717 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  23. Tanenbaum, A.S., Bos, H.: Modern Operating Systems. Prentice Hall Press, Upper Saddle River (2014)

    Google Scholar 

  24. Zhang, C., Zhang, S.: Association Rule Mining: Models and Algorithms. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Technology, Technical University of Lodz, Wolczaska 215, 90-924, Lodz, Poland

    Agnieszka Duraj

Authors
  1. Agnieszka Duraj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Agnieszka Duraj .

Editor information

Editors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Stanisław Kozielski

  2. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Dariusz Mrozek

  3. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Paweł Kasprowski

  4. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Bożena Małysiak-Mrozek

  5. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Daniel Kostrzewa

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Duraj, A. (2016). Conflictless Task Scheduling Using Association Rules. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery. BDAS BDAS 2015 2016. Communications in Computer and Information Science, vol 613. Springer, Cham. https://doi.org/10.1007/978-3-319-34099-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-34099-9_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-34098-2

  • Online ISBN: 978-3-319-34099-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation