Skip to main content

2016 | OriginalPaper | Buchkapitel

Conflictless Task Scheduling Using Association Rules

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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)CrossRef 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)CrossRef
2.
Zurück zum Zitat 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) 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)
3.
Zurück zum Zitat 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) 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)
4.
Zurück zum Zitat Bedworth, M., O’Brien, J.: The omnibus model: a new model of data fusion? IEEE Aerosp. Electron. Syst. Mag. 15(4), 30–36 (2000)CrossRef Bedworth, M., O’Brien, J.: The omnibus model: a new model of data fusion? IEEE Aerosp. Electron. Syst. Mag. 15(4), 30–36 (2000)CrossRef
5.
Zurück zum Zitat Belik, F.: An efficient deadlock avoidance technique. IEEE Trans. Comput. 39(7), 882–888 (1990)CrossRef Belik, F.: An efficient deadlock avoidance technique. IEEE Trans. Comput. 39(7), 882–888 (1990)CrossRef
6.
Zurück zum Zitat Duraj, A.: Application of fussyclassify of data classification. J. Appl. Comput. Sci. 21, 39–52 (2013) Duraj, A.: Application of fussyclassify of data classification. J. Appl. Comput. Sci. 21, 39–52 (2013)
7.
Zurück zum Zitat Duraj, A., Krawczyk, A.: Outliers detection of signals in biomedical information systems fusion. Electr. Rev. 12b, 56–60 (2012) Duraj, A., Krawczyk, A.: Outliers detection of signals in biomedical information systems fusion. Electr. Rev. 12b, 56–60 (2012)
8.
Zurück zum Zitat Guillet, F., Hamilton, H.J.: Quality Measures in Data Mining, vol. 43. Springer, Heidelberg (2007)CrossRefMATH Guillet, F., Hamilton, H.J.: Quality Measures in Data Mining, vol. 43. Springer, Heidelberg (2007)CrossRefMATH
9.
Zurück zum Zitat Han, E.H., Karypis, G., Kumar, V., Mobasher, B.: Clustering based on association rule hypergraphs. University of Minnesota, Department of Computer Science (1997) Han, E.H., Karypis, G., Kumar, V., Mobasher, B.: Clustering based on association rule hypergraphs. University of Minnesota, Department of Computer Science (1997)
10.
Zurück zum Zitat Hilderman, R., Hamilton, H.J.: Knowledge Discovery and Measures of Interest, vol. 638. Springer, Heidelberg (2013)MATH Hilderman, R., Hamilton, H.J.: Knowledge Discovery and Measures of Interest, vol. 638. Springer, Heidelberg (2013)MATH
11.
Zurück zum Zitat 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)CrossRef 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)CrossRef
12.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
13.
Zurück zum Zitat McGarry, K.: A survey of interestingness measures for knowledge discovery. Knowl. Eng. Rev. 20(01), 39–61 (2005)CrossRef McGarry, K.: A survey of interestingness measures for knowledge discovery. Knowl. Eng. Rev. 20(01), 39–61 (2005)CrossRef
14.
Zurück zum Zitat 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) 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)
15.
Zurück zum Zitat Rajendran, P., Madheswaran, M.: Hybrid medical image classification using association rule mining with decision tree algorithm. CoRR abs/1001.3503 (2010) Rajendran, P., Madheswaran, M.: Hybrid medical image classification using association rule mining with decision tree algorithm. CoRR abs/1001.3503 (2010)
16.
Zurück zum Zitat Sarawagi, S., Thomas, S., Agrawal, R.: Integrating association rule mining with relational database systems: alternatives and implications. SIGMOD Rec. 27(2), 343–354 (1998)CrossRef Sarawagi, S., Thomas, S., Agrawal, R.: Integrating association rule mining with relational database systems: alternatives and implications. SIGMOD Rec. 27(2), 343–354 (1998)CrossRef
17.
Zurück zum Zitat Silberschatz, A., Galvin, P., Gagne, G.: Applied Operating System Concepts. Wiley, Hoboken (2001) Silberschatz, A., Galvin, P., Gagne, G.: Applied Operating System Concepts. Wiley, Hoboken (2001)
18.
Zurück zum Zitat Silberschatz, A., Galvin, P., Gagne, G.: Operating System Concepts. Wiley, Hoboken (2012)MATH Silberschatz, A., Galvin, P., Gagne, G.: Operating System Concepts. Wiley, Hoboken (2012)MATH
19.
Zurück zum Zitat 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) 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)
20.
Zurück zum Zitat 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) 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)
21.
Zurück zum Zitat 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) 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)
22.
Zurück zum Zitat 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)MathSciNetCrossRefMATH 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)MathSciNetCrossRefMATH
23.
Zurück zum Zitat Tanenbaum, A.S., Bos, H.: Modern Operating Systems. Prentice Hall Press, Upper Saddle River (2014) Tanenbaum, A.S., Bos, H.: Modern Operating Systems. Prentice Hall Press, Upper Saddle River (2014)
24.
Zurück zum Zitat Zhang, C., Zhang, S.: Association Rule Mining: Models and Algorithms. Springer, Heidelberg (2002)CrossRefMATH Zhang, C., Zhang, S.: Association Rule Mining: Models and Algorithms. Springer, Heidelberg (2002)CrossRefMATH
Metadaten
Titel
Conflictless Task Scheduling Using Association Rules
verfasst von
Agnieszka Duraj
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-34099-9_22

Premium Partner