• English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • français 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Ouvrir une session
Voir le document 
  •   Accueil de DSpace
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Voir le document
  •   Accueil de DSpace
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Voir le document
JavaScript is disabled for your browser. Some features of this site may not work without it.
Tout DSpace
  • Communautés & Collections
  • Par date de publication
  • Auteurs
  • Titres
  • Sujets

A Probabilistic Batch Oriented Proactive Workflow Management

Thumbnail
Auteur
Oikonomou P., Kolomvatsos K., Anagnostopoulos C., Tziritas N., Theodoropoulos G.
Date
2021
Language
en
DOI
10.1109/ICTAI52525.2021.00197
Sujet
Scheduling
Work simplification
Decisions makings
Distributed processing
Management IS
Network overhead
Probabilistic models
Probabilistics
Research subjects
Tasks scheduling
Work-flows
Workflow managements
Decision making
IEEE Computer Society
Afficher la notice complète
Résumé
Workflow management is a widely studied research subject due to its criticality for the efficient execution of various processing activities towards concluding innovative applications. The ultimate goal is to eliminate the required time for delivering the final outcome considering the dependencies between workflow's tasks. In this paper, we enhance the decision making of a scheduler with a batch oriented approach to deal with multiple workflows. A probabilistic data oriented approach combined with an infrastructure oriented scheme is provided to pay attention on dynamic environments where the underlying data are continuously updated trying to minimize the network overhead for migrating data. Workflows are mapped to the available datasets according to their data requirements, then, we combine the outcome with an optimization model upon the time and cost requirements of every placement. The performance of our model is revealed by a high number of experiments depicting the advantages in the network overhead. © 2021 IEEE.
URI
http://hdl.handle.net/11615/77381
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19743]
htmlmap 

 

Parcourir

Tout DSpaceCommunautés & CollectionsPar date de publicationAuteursTitresSujetsCette collectionPar date de publicationAuteursTitresSujets

Mon compte

Ouvrir une sessionS'inscrire
Help Contact
DepositionAboutHelpContactez-nous
Choose LanguageTout DSpace
EnglishΕλληνικά
htmlmap