@article{SanderRoy2004,
  author    = {Sander, Volker and Roy, Alain},
  title     = {GARA: A Uniform Quality of Service Architecture / Roy, Alain ; Sander, Volker},
  series = {Grid resource management : state of the art and future trends / ed. by Jarek Nabrzyski; Jennifer M. Schopf; Jan W\&\#796;eglarz},
  journal   = {Grid resource management : state of the art and future trends / ed. by Jarek Nabrzyski; Jennifer M. Schopf; Jan W\&\#796;eglarz},
  publisher = {Kluwer Academic Publ.},
  address   = {Boston},
  isbn      = {1-4020-7575-8},
  pages     = {377 -- 394},
  year      = {2004},
  language  = {en}
}
@article{SanderFosterFidleretal.2004,
  author    = {Sander, Volker and Foster, Ian T. and Fidler, Markus and Roy, Alain},
  title     = {End-to-end quality of service for high-end applications / Foster, Ian T. ; Fidler, Markus ; Roy, Alain ; Sander, Volker ; Winkler, Linda},
  series = {Computer Communications. 27 (2004), H. 14},
  journal   = {Computer Communications. 27 (2004), H. 14},
  isbn      = {0140-3664},
  pages     = {1375 -- 1388},
  year      = {2004},
  language  = {en}
}
@article{SanderFosterRoyetal.2000,
  author    = {Sander, Volker and Foster, Ian and Roy, Alain and Winkler, Linda},
  title     = {A differentiated services implementation for high-performance TCP flows},
  series = {Computer Networks. 34 (2000), H. 6},
  journal   = {Computer Networks. 34 (2000), H. 6},
  isbn      = {1389-1286},
  pages     = {915 -- 929},
  year      = {2000},
  language  = {en}
}
@article{SanderFidlerKlimala2005,
  author    = {Sander, Volker and Fidler, Markus and Klimala, Wojciech},
  title     = {Traffic shaping in aggregate-based networks: implementation and analysis / Fidler, Markus ; Sander, Volker ; Klimala, Wojciech},
  series = {Computer Communications. 28 (2005), H. 3},
  journal   = {Computer Communications. 28 (2005), H. 3},
  isbn      = {0140-3664},
  pages     = {274 -- 286},
  year      = {2005},
  language  = {en}
}
@article{SanderFidler2004,
  author    = {Sander, Volker and Fidler, Markus},
  title     = {A parameter based admission control for differentiated services networks / Fidler, Markus ; Sander, Volker},
  series = {Computer Networks. 44 (2004), H. 4},
  journal   = {Computer Networks. 44 (2004), H. 4},
  isbn      = {1389-1286},
  pages     = {463 -- 479},
  year      = {2004},
  language  = {en}
}
@article{SanderErwinHuber1999,
  author    = {Sander, Volker and Erwin, Dietmar and Huber, Valentina},
  title     = {High-performance computer management based on Java},
  series = {Future Generation Computer Systems. 15 (1999), H. 3},
  journal   = {Future Generation Computer Systems. 15 (1999), H. 3},
  isbn      = {0167-739X},
  pages     = {425 -- 432},
  year      = {1999},
  language  = {en}
}
@article{SanderCzajkowskiFosteretal.2002,
  author    = {Sander, Volker and Czajkowski, K. and Foster, I. and Kesselman, C.},
  title     = {SNAP: A Protocol for Negotiating Service Level Agreements and Coordinating Resource Management in Distributed Systems / Czajkowski, K. ; Foster, I. ; Kesselman, C. ; Sander, V. ; Tuecke, S.},
  series = {Job Scheduling Strategies for Parallel Processing : 8th InternationalWorkshop, JSSPP 2002 Edinburgh, Scotland, UK, July 24, 2002. Revised Papers},
  journal   = {Job Scheduling Strategies for Parallel Processing : 8th InternationalWorkshop, JSSPP 2002 Edinburgh, Scotland, UK, July 24, 2002. Revised Papers},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {3-540-00172-7},
  pages     = {153 -- 183},
  year      = {2002},
  language  = {en}
}
@article{KrottGerhardsSkorupaetal.2011,
  author    = {Krott, Daniel and Gerhards, Michael and Skorupa, Sascha and Sander, Volker},
  title     = {NHiLA - Bridging the Gap Between .NET and UNICORE},
  series = {UNICORE Summit 2011 : proceedings, 7-8 July 2011, Torun, Poland / Mathilde Romberg ... (Eds.)},
  journal   = {UNICORE Summit 2011 : proceedings, 7-8 July 2011, Torun, Poland / Mathilde Romberg ... (Eds.)},
  publisher = {Forschungszentrum J{\"u}lich},
  address   = {J{\"u}lich},
  isbn      = {9783893367504},
  pages     = {77 -- 86},
  year      = {2011},
  language  = {en}
}
@article{KromeHoeftSander2019,
  author    = {Krome, Cornelia and H{\"o}ft, Jan and Sander, Volker},
  title     = {Clustering time series applied to energy markets},
  series = {Energy Informatics},
  volume    = {2},
  journal   = {Energy Informatics},
  number    = {Article numer 17},
  publisher = {Springer},
  address   = {Berlin},
  issn      = {2520-8942},
  doi       = {10.1186/s42162-019-0076-0},
  pages     = {1 -- 20},
  year      = {2019},
  language  = {en}
}
@article{GerhardsSanderZivkovicetal.2020,
  author    = {Gerhards, Michael and Sander, Volker and Zivkovic, Miroslav and Belloum, Adam and Bubak, Marian},
  title     = {New approach to allocation planning of many-task workflows on clouds},
  series = {Concurrency and Computation: Practice and Experience},
  volume    = {32},
  journal   = {Concurrency and Computation: Practice and Experience},
  number    = {2 Article e5404},
  publisher = {Wiley},
  address   = {Chichester},
  issn      = {1532-0634},
  doi       = {10.1002/cpe.5404},
  pages     = {1 -- 16},
  year      = {2020},
  abstract  = {Experience has shown that a priori created static resource allocation plans are vulnerable to runtime deviations and hence often become uneconomic or highly exceed a predefined soft deadline. The assumption of constant task execution times during allocation planning is even more unlikely in a cloud environment where virtualized resources vary in performance. Revising the initially created resource allocation plan at runtime allows the scheduler to react on deviations between planning and execution. Such an adaptive rescheduling of a many-task application workflow is only feasible, when the planning time can be handled efficiently at runtime. In this paper, we present the static low-complexity resource allocation planning algorithm (LCP) applicable to efficiently schedule many-task scientific application workflows on cloud resources of different capabilities. The benefits of the presented algorithm are benchmarked against alternative approaches. The benchmark results show that LCP is not only able to compete against higher complexity algorithms in terms of planned costs and planned makespan but also outperforms them significantly by magnitudes of 2 to 160 in terms of required planning time. Hence, LCP is superior in terms of practical usability where low planning time is essential such as in our targeted online rescheduling scenario.},
  language  = {en}
}
@article{GerhardsSkorupaSanderetal.2011,
  author    = {Gerhards, M. and Skorupa, S. and Sander, Volker and Pfeiffer, P. and Belloum, A.},
  title     = {Towards a security framework for a WS-HumanTask processor},
  series = {7th International Conference on Network and Service Management (CNSM), 2011 Paris},
  journal   = {7th International Conference on Network and Service Management (CNSM), 2011 Paris},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-3-901882-44-9},
  pages     = {1 -- 5},
  year      = {2011},
  language  = {en}
}
@article{GerhardsSkorupaSanderetal.2011,
  author    = {Gerhards, M. and Skorupa, S. and Sander, Volker and Belloum, A. and Vesunin, D. and Benabdelkader, A.},
  title     = {HisT/PLIER : A Two-Fold Provenance Approach for Grid-Enabled Scientific Workflows Using WS-VLAM},
  series = {12th IEEE/ACM International Conference on Grid Computing (GRID), 2011},
  journal   = {12th IEEE/ACM International Conference on Grid Computing (GRID), 2011},
  publisher = {IEEE},
  address   = {New York},
  doi       = {10.1109/Grid.2011.39},
  pages     = {224 -- 225},
  year      = {2011},
  language  = {en}
}
@article{GerhardsBelloumBerretzetal.2010,
  author    = {Gerhards, M. and Belloum, A. and Berretz, F. and Sander, Volker and Skorupa, S.},
  title     = {A history-tracing XML-based provenance framework for workflows},
  isbn      = {978-1-4244-8989-3},
  pages     = {1 -- 10},
  year      = {2010},
  language  = {en}
}
@article{BerretzSkorupaSanderetal.2011,
  author    = {Berretz, Frank and Skorupa, Sasche and Sander, Volker and Belloum, Adam and Bubak, Marian},
  title     = {Actor-Driven Workflow Execution in Distributed Environments},
  series = {Euro-Par 2010 Parallel Processing Workshops : HeteroPAR, HPCC, HiBB, CoreGrid, UCHPC, HPCF, PROPER, CCPI, VHPC ; Ischia, Italy, August 31 - September 3, 2010 ; revised selected papers / Mario R. Guarracino ... (eds.)},
  journal   = {Euro-Par 2010 Parallel Processing Workshops : HeteroPAR, HPCC, HiBB, CoreGrid, UCHPC, HPCF, PROPER, CCPI, VHPC ; Ischia, Italy, August 31 - September 3, 2010 ; revised selected papers / Mario R. Guarracino ... (eds.)},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-642-21877-4},
  pages     = {287 -- 294},
  year      = {2011},
  language  = {en}
}
@article{BerretzSkorupaSanderetal.2010,
  author    = {Berretz, F. and Skorupa, S. and Sander, Volker and Belloum, A.},
  title     = {Towards an actor-driven workflow management system for grids},
  series = {International Symposium on Collaborative Technologies and Systems (CTS), 2010 : 17 - 21 May 2010, Chicago, Illinois, USA / IEEE},
  journal   = {International Symposium on Collaborative Technologies and Systems (CTS), 2010 : 17 - 21 May 2010, Chicago, Illinois, USA / IEEE},
  publisher = {IEEE},
  address   = {Piscataway, NJ},
  isbn      = {978-1-4244-6619-1},
  pages     = {611 -- 616},
  year      = {2010},
  language  = {en}
}
@article{BergmannDemuthSander2011,
  author    = {Bergmann, Sandra and Demuth, Bastian and Sander, Volker},
  title     = {A Web Framework for Workflow Submission and Monitoring via UNICORE 6 based on Distributable Scientific Workflow Templates},
  series = {UNICORE Summit 2011 : proceedings, 7-8 July 2011, Torun, Poland / Mathilde Romberg ... (Eds.)},
  journal   = {UNICORE Summit 2011 : proceedings, 7-8 July 2011, Torun, Poland / Mathilde Romberg ... (Eds.)},
  publisher = {Forschungszentrum J{\"u}lich},
  address   = {J{\"u}lich},
  isbn      = {9783893367504},
  pages     = {45 -- 50},
  year      = {2011},
  language  = {en}
}