Prof. Dr. Claudia Fohry

[RGHF24a] L. Reitz, B. Gerhards, J. Hundhausen, C. Fohry: Investigating the Performance Difference of Task Communication via Futures or Side Effects. Proc. European Conf. on Parallel Processing. Workshop on Asynchronous Many-Task Systems for Exascale (WAMTA), 2024. to appear.

[NF24a] R. Nather, C. Fohry: Futures for dynamic dependencies - Parallelizing the H-LU Factorization. Proc. Workshop on Asynchronous Many-Task Systems and Applications (WAMTA), 2024. To appear. Slides

[KKFK24] P. Kohl, Y. Krämer, C. Fohry, B. Kraft: Scoping Review of Active Learning Strategies and their Evaluation Environments for Entity Recognition Tasks. Proc. Int. Conf. on Deep Learning Theory and Applications (DELTA), 2024. to appear.

[RF24a] L. Reitz, C. Fohry: Task-Level Checkpointing and Localized Recovery to Tolerate Permanent Node Failures for Nested Fork-Join Programs in Clusters. Springer Nature Computer Science (Special Issue), Vol. 5, No. 320, 2024.

[F23b] C. Fohry: Update on Checkpointing and Localized Recovery for Nested Fork-Join Programs (Lightning Talk). Int. Symp. on Checkpointing for Supercomputing (SuperCheck) Workshop at Int. Conf. for High Performance Computing, Networking, Storage, and Analysis (SC23), 2023.

[F23a] C. Fohry: Task-Level Resilience for Dynamically Generated Tasks under Work Stealing in Clusters. Platform for Advanced Scientific Computing (PASC) Conference. Presentation at Minisymposium on Performance in I/O and Fault Tolerance for Scientific Applications, 2023.

[RF23a] L. Reitz, C. Fohry: Task-Level Checkpointing for NFJ Programs using Work Stealing. Proc. European Conf. on Parallel Processing. Workshop on Asynchronous Many-Task Systems for Exascale, 2023, pp. 102-114.

[RHWF23a] L. Reitz, K. Hardenbicker, T. Werner, C. Fohry: Lifeline-based Load Balancing Schemes for Asynchronous Many-Task Runtimes in Clusters. Parallel Computing (Special Issue), Vol. 116, 2023.

[RHF22a] L. Reitz, K. Hardenbicker, C. Fohry: Comparison of Load Balancing Schemes for Asynchronous Many-Task Runtimes. Proc. Int. Conf. on Parallel Processing and Applied Mathematics, Workshop on Language-Based Parallel Programming Models, 2022, pp. 14-26.

[PRF22a] J. Posner, L. Reitz, C. Fohry: Task-Level Resilience: Checkpointing vs. Supervision. Int. Journal of Networking and Computing, Vol. 12, No. 1, 2022, pp. 47-72.

[SSFS22] J. Schüngel, B. Stuch, C. Fohry, R. Schaldach: Effects of Initialization of a Global Land-Use Model on Simulated Land Change and Loss of Natural Vegetation. Environmental Modeling and Software, Vol. 148, February 2022.

[PF21a] J. Posner, C. Fohry: Transparent Resource Elasticity for Task-Based Cluster Environments with Work Stealing. Proc. Int. Conference on Parallel Processing (ICPP) Workshops (P2S2), 2021.

[PRF21a] J. Posner, L. Reitz, C. Fohry: Checkpointing vs. Supervision Resilience Approaches for Dynamic Independent Tasks. Proc. IEEE Int. Parallel and Distributed Processing Symp., Workshop on Advances in Parallel and Distributed Computational Models, 2021, pp. 556-565.

[F21] C. Fohry: Checkpointing and Localized Recovery for Nested Fork-Join Programs. Int. Symp. on Checkpointing for Supercomputing (SuperCheck21), 2021.

[F20] C. Fohry: An Overview of Task-Based Parallel Programming Models. Tutorial at HiPEAC Conference 2020 (also 2018, 2019).

[PRF19a] J. Posner, L. Reitz, C. Fohry. A Comparison of Application-Level Fault Tolerance Schemes for Task Pools. Future Generation Computer Systems (Special Issue), Vol. 105, April 2020.

[PRF18a] J. Posner, L. Reitz, C. Fohry: Comparison of the HPC and Big Data Java Libraries Spark, PCJ and APGAS. Proc. Int. Conf. for High Performance Computing, Networking, Storage and Analysis (SC), Parallel Applications Workshop (PAW-ATM), 2018, pp. 11-22.

[FPR18a] C. Fohry, J. Posner, L. Reitz: A Selective and Incremental Backup Scheme for Task Pools, Proc. Int. Conf. on High Performance Computing & Simulation (HPCS), 2018, pp. 621-628.

[PF18b] J. Posner, C. Fohry: Hybrid Work Stealing of Locality-Flexible and Cancelable Tasks for the APGAS Library. The Journal of Supercomputing, Vol. 74, No. 4, 2018, pp. 1435-1448.

[PF18a] J. Posner, C. Fohry: A Java Task Pool Framework providing Fault Tolerant Global Load Balancing, Int. Journal of Networking and Computing, Vol. 8, No. 1, 2018, pp. 2-31.

[FBP17]C. Fohry, M. Bungart, P. Plock: Fault Tolerance for Lifeline-Based Global Load Balancing. Journal of Software Engineering and Applications, Vol. 10, No. 13, 2017, pp. 925-958. source code

[BF17b]M. Bungart, C. Fohry: Extending the MPI Backend of X10 by Elasticity. poster, EuroMPI/USA, 2017. poster

[BF17a] M. Bungart, C. Fohry: A Malleable and Fault-Tolerant Task Pool Framework for X10. Proc. IEEE Int. Conf. on Cluster Computing, Workshop on Fault Tolerant Systems, 2017, pp. 749-757. source code

[PF17b] J. Posner, C. Fohry: A Combination of Intra- and Inter-Place Work Stealing for the APGAS Library. Proc. Int. Conf. on Parallel Processing and Applied Mathematics, Workshop on Language-Based Parallel Programming Models, 2018, Springer LNCS 10778, pp. 234-243.

[PF17a] J. Posner, C. Fohry: Fault Tolerance for Cooperative Lifeline-Based Global Load Balancing in Java with APGAS and Hazelcast. Proc. IEEE Int. Parallel and Distributed Processing Symp., Workshop on Advances in Parallel and Distributed Computational Models, 2017, pp. 854-863. source code

[FB16] C. Fohry, M. Bungart: A Robust Fault Tolerance Scheme for Lifeline-Based Taskpools, Proc. Int. Conf. on Parallel Processing Workshops (P2S2), 2016, pp.200-209. source code

[PF16a] J. Posner, C. Fohry: Cooperation vs. Coordination for Lifeline-Based Global Load Balancing in APGAS. X10 Workshop, 2016, ACM, pp. 13-17.

[FBP15b] C. Fohry, M. Bungart, J. Posner: Fault Tolerance Schemes for Global Load Balancing in X10. Scalable Computing: Practice and Experience, Vol. 16, No. 2, 2015, pp. 169-185. source code

[FBP15a]C. Fohry, M. Bungart, J. Posner: Towards an Efficient Fault-Tolerance Scheme for GLB. X10 Workshop, 2015, ACM, pp. 27-32.

[BFP14] M. Bungart, C. Fohry, J. Posner: Fault-Tolerant Global Load Balancing in X10. Proc. IEEE Int. Symp. on Symbolic and Numeric Algorithms for Scientific Computing, pp. 471-478. source code

[FB14] C. Fohry, J. Breitbart: User Experiences with a Chapel Implementation of UTS, Chapel Implementers and Users Workshop, 2014.

[FB13]C. Fohry, J. Breitbart: Experiences with Implementing Task Pools in Chapel and X10. Proc. Int. Conf. on Parallel Processing and Applied Mathematics, Part II, Workshop on Language-Based Parallel Programming Models, 2014, Springer LNCS 8385, pp. 75-85. source code

[BF11] J. Breitbart, C. Fohry: Analyzing Use of OpenCL on the Cell Broadband Engine and a Proposal for OpenCL Extensions, Int. Journal of Networking and Computing, Vol. 1, No. 1, 2011, pp. 114-130.

[BF10] J. Breitbart, C. Fohry: OpenCL - An effective programming model for data parallel computations at the Cell Broadband Engine. Workshop Proc. Parallel and Distributed Processing Symposium (IPDPS), 2010.

[WKL08] A. Wirz, B. Knafla, C. Leopold: Comparison of Spatial Data Structures in OpenMP-Parallelized Steering, Proc. Int. Conf. on High Performance Computing and Simulation, 2008, pp. 31-37.

[HWL07] R. Hossain, M. Wesseling, C. Leopold: A new programming environment for software defined radio applications. European Transactions on Telecommunications, Vol. 19, No. 1, 2008, pp. 61-66.

[SL07c] M. Süß, A. Podlich, C. Leopold: Observations on the Publicity and Usage of Parallel Programming Systems and Languages: A Survey Approach. Technical Report KIS No. 1 / 2007, Kasseler Informatikschriften, 2007.

[KL07] B. Knafla, C. Leopold: Parallelizing a Real-Time Steering Simulation for Computer Games with OpenMP. Proc. Parallel Computing (ParCo), 2007, pp. 219-226.

[SL07b] M. Süß, C. Leopold: Implementing Data-Parallel Patterns for Shared Memory with OpenMP. Proc. Parallel Computing (ParCo), 2007, pp. 203-210.

[SL07a] M. Süß, C. Leopold: Generic Locking and Deadlock-Prevention with C++. Proc. Parallel Computing (ParCo), 2007, pp. 211-218.

[SL07] M. Süß, C. Leopold: Problems, Workarounds and Possible Solutions Implementing the Singleton Pattern with C++ and OpenMP. Proc. Int. Workshop on OpenMP, 2007, Springer LNCS 4935, pp. 173-184.

[LS06] C. Leopold, M. Süß: Observations on MPI-2 Support for Hybrid Master/Slave Applications in Dynamic and Heterogeneous Environments, Proc. EuroPVM/MPI 2006, Springer LNCS 4192, pp. 285-292.

[SL06b] M. Süß, C. Leopold: Implementing Irregular Parallel Algorithms with OpenMP. Proc. Euro-Par, 2006, Springer LNCS 4128, pp. 635-644.

[WSL06] A. Wirz, M. Süß, C. Leopold: A Comparison of Task Pool Variants in OpenMP and a Proposal for a Solution to the Busy Waiting Problem. Int. Workshop on OpenMP, 2006, Springer LNCS 4315, pp. 397-408.

[SL06a] M. Süß, C. Leopold: Common Mistakes in OpenMP and How To Avoid Them - A Collection of Best Practices. Int. Workshop on OpenMP, 2006, Springer LNCS 4315, pp. 312-323.

[LSB06] C. Leopold, M. Süß, J. Breitbart: Programming for Malleability with Hybrid MPI-2 and OpenMP: Experiences with a Simulation Program for Global Water Prognosis. European Conf. on Modelling and Simulation, 2006, pp. 665-670.

[HWL06] R. Hossain, M. Wesseling, C. Leopold: Towards Automatic Scheduling for Software Defined Radio Applications on Parallel Hardware, Proc. Karlsruhe Workshop on Software Radios, 2006, pp. 107-114.

[HWL05b] R. Hossain, M. Wesseling, C. Leopold: Application Description Concept with System Level Hardware Abstraction. IEEE Workshop on Signal Processing Systems Design and Implementation, 2005, pp. 36-41.

[HWL05a] R. Hossain, M. Wesseling, C. Leopold: Virtual Radio Engine - A Programming Concept for Separation of Application Specifications and Hardware Architectures. in Proc. IST Mobile and Wireless Communications Summit, 2005.

[SL05] M. Süß, C.Leopold: Evaluating the state of the art of parallel programming systems.Technical Report KIS No. 1 / 2005, Kasseler Informatikschriften, 2005.

[SL04] M.Süß, C. Leopold: A User's Experience with Parallel Sorting and OpenMP. Proc. European Workshop on OpenMP, 2004, pp. 23-28.

[Leo04a] A. Iványi, C. Leopold: Parallel Computations (Hungarian translation). In: A. Iványi (ed.): Informatikai Algoritmusok, Scolar Publisher, 2004, pp. 222-267.

[Leo03b] C. Leopold: Cache Miss Analysis of 2D Stencil Codes with Tiled Time Loop. Int. Journal of Foundations of Computer Science, Vol. 14, No. 1, 2003, pp. 39-58.

[Leo03a] C. Leopold: Locality Optimization for Memory Hierarchies and Programming Models of Parallel and Distributed Computing. Habilitation thesis, Friedrich Schiller University Jena, 2003.

[Leo02e] C. Leopold: An Analytical Evaluation of Tiling for Stencil Codes with Time Loop. Proc. IEEE Int. Parallel and Distributed Processing Symp., Workshop on Advances in Parallel and Distributed Computational Models, 2002, on CD-ROM.

[Leo02d] C. Leopold: Using the iblOpt Tool for Locality Optimization of Stencil Codes. Proc. Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers, 2002.

[Leo02c] C. Leopold: Tight Bounds on Capacity Misses for 3D Stencil Codes. Proc. Int. Conf. on Computational Science, 2002, Springer LNCS 2329, pp. 843-852.

[Leo02b] C. Leopold: On Optimal Temporal Locality of Stencil Codes. Proc. ACM Symp. on Applied Computing, 2002, pp. 948-952.

[Leo02a] C. Leopold: On Optimal Locality of Linear Relaxation. Proc. Int. IASTED Symp. on Parallel and Distributed Computing and Network, 2002, pp. 201-206.

[Leo01c] C. Leopold: Exploiting Non-Uniform Reuse for Cache Optimization: A Case Study. Proc.ACM Symp. on Applied Computing, 2001, pp. 560-564.

[Leo01b] C. Leopold: Parallel and Distributed Computing: A Survey of Models, Paradigms, and Approaches. John Wiley & Sons, 2001.

[Leo01a] C. Leopold: Structuring Statement Instances in Instance-Based Locality Optimization. Future Generation Computer Systems, Vol. 17, 2001, pp. 425-440.

[Leo00] C. Leopold: Generating Structured Program Instances with a High Degree of Locality. Proc. Euromicro Workshop on Parallel and Distributed Processing, 2000, IEEE, pp. 267-274.

[Leo99] C. Leopold: Regularity Considerations in Instance-Based Locality Optimization. Workshop Proc. Parallel and Distributed Processing (IPPS/SPDP), 1999, Springer LNCS 1586, pp. 230-238.

[Leo98d] C. Leopold: Arranging Statements and Data of Program Instances for Locality. Future Generation Computer Systems, Vol. 14, 1998, pp. 293-311.

[Leo98c] C. Leopold: Locality Optimization for Program Instances. Workshop Proc. First Merged Int. Parallel Processing Symp. and Symp. on Parallel and Distributed Processing (IPPS/SPDP), 1998, Springer LNCS 1388, pp. 225-233.

[Leo98b] C. Leopold: Arranging Program Statements for Locality on the Basis of Neighbourhood Preferences. Int. Journal of Approximate Reasoning, Vol. 19, No. 1-2, 1998, pp. 73-90.

[Leo98a] C. Leopold: Improving the Locality of Program Instances by Local Search. Int. Conf. on Compiler Construction, Poster Session Proc., 1998, pp. 20-27.

[Leo97] C. Leopold: Sequencing with Neigbourhood Preferences. Proc. Int. Workshop on Approximate Reasoning in Scheduling, 1997, ICSC Press, pp. 32-38.

[Leo96] C. Leopold: A Fuzzy Approach to Automatic Data Locality Optimization. Proc. ACM Symp. on Applied Computing, 1996, pp. 515-518.

[Leo95b] T. Heywood, C. Leopold: Dynamic Randomized Simulation of Hierarchical PRAMs on Meshes. Proc. First Aizu Int. Symp. on Parallel Algorithms/Architecture Synthesis, 1995, IEEE, pp. 257-263.

[Leo95a] T. Heywood, C. Leopold: Models of Parallelism. In: J. R. Davy and P. M. Dew (editors): Abstract Machine Models for Highly Parallel Computers, Oxford University Press, 1995, pp. 1-16.