Claudia Fohry

Orcid: 0000-0003-3256-716X

Affiliations:
  • Universität Kassel


According to our database1, Claudia Fohry authored at least 51 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Task-Level Checkpointing and Localized Recovery to Tolerate Permanent Node Failures for Nested Fork-Join Programs in Clusters.
SN Comput. Sci., March, 2024

2023
Lifeline-based load balancing schemes for Asynchronous Many-Task runtimes in clusters.
Parallel Comput., 2023

Task-Level Checkpointing for Nested Fork-Join Programs Using Work Stealing.
Proceedings of the Euro-Par 2023: Parallel Processing Workshops - Euro-Par 2023 International Workshops, Limassol, Cyprus, August 28, 2023

2022
Task-Level Resilience: Checkpointing vs. Supervision.
Int. J. Netw. Comput., 2022

Effects of initialization of a global land-use model on simulated land change and loss of natural vegetation.
Environ. Model. Softw., 2022

Comparison of Load Balancing Schemes for Asynchronous Many-Task Runtimes.
Proceedings of the Parallel Processing and Applied Mathematics, 2022

2021
Checkpointing and Localized Recovery for Nested Fork-Join Programs.
CoRR, 2021

Checkpointing vs. Supervision Resilience Approaches for Dynamic Independent Tasks.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

Transparent Resource Elasticity for Task-Based Cluster Environments with Work Stealing.
Proceedings of the ICPP Workshops 2021: 50th International Conference on Parallel Processing, 2021

2020
A Comparison of Application-Level Fault Tolerance Schemes for Task Pools.
Future Gener. Comput. Syst., 2020

2018
Hybrid work stealing of locality-flexible and cancelable tasks for the APGAS library.
J. Supercomput., 2018

A Java Task Pool Framework providing Fault-Tolerant Global Load Balancing.
Int. J. Netw. Comput., 2018

Comparison of the HPC and Big Data Java Libraries Spark, PCJ and APGAS.
Proceedings of the 2018 IEEE/ACM Parallel Applications Workshop, Alternatives To MPI, 2018

A Selective and Incremental Backup Scheme for Task Pools.
Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018

2017
A Combination of Intra- and Inter-place Work Stealing for the APGAS Library.
Proceedings of the Parallel Processing and Applied Mathematics, 2017

Fault Tolerance for Cooperative Lifeline-Based Global Load Balancing in Java with APGAS and Hazelcast.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

A Malleable and Fault-Tolerant Task Pool Framework for X10.
Proceedings of the 2017 IEEE International Conference on Cluster Computing, 2017

2016
Cooperation vs. coordination for lifeline-based global load balancing in APGAS.
Proceedings of the 6th ACM SIGPLAN Workshop on X10, 2016

A Robust Fault Tolerance Scheme for Lifeline-Based Taskpools.
Proceedings of the 45th International Conference on Parallel Processing Workshops, 2016

2015
Fault Tolerance Schemes for Global Load Balancing in X10.
Scalable Comput. Pract. Exp., 2015

Towards an efficient fault-tolerance scheme for GLB.
Proceedings of the ACM SIGPLAN Workshop on X10, Portland, OR, USA, June 15 - 17, 2015, 2015

2014
Fault-Tolerant Global Load Balancing in X10.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

2013
Experiences with Implementing Task Pools in Chapel and X10.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

2011
Analyzing Use of OpenCL on the Cell Broadband Engine and a Proposal for OpenCL Extensions.
Int. J. Netw. Comput., 2011

2010
OpenCL - An effective programming model for data parallel computations at the Cell Broadband Engine.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
Cognitive load and science text comprehension: Effects of drawing and mentally imagining text content.
Comput. Hum. Behav., 2009

2008
Signal Processing A new programming environment for software defined radio applications.
Eur. Trans. Telecommun., 2008

2007
Generic Locking and Deadlock-Prevention with C++.
Proceedings of the Parallel Computing: Architectures, 2007

Implementing Data-Parallel Patterns for Shared Memory with OpenMP.
Proceedings of the Parallel Computing: Architectures, 2007

Parallelizing a Real-Time Steering Simulation for Computer Games with OpenMP.
Proceedings of the Parallel Computing: Architectures, 2007

Problems, Workarounds and Possible Solutions Implementing the Singleton Pattern with C++ and OpenMP.
Proceedings of the A Practical Programming Model for the Multi-Core Era, 2007

2006
Observations on MPI-2 Support for Hybrid Master/Slave Applications in Dynamic and Heterogeneous Environments.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2006

A Comparison of Task Pool Variants in OpenMP and a Proposal for a Solution to the Busy Waiting Problem.
Proceedings of the OpenMP Shared Memory Parallel Programming - International Workshops, 2006

Common Mistakes in OpenMP and How to Avoid Them - A Collection of Best Practices.
Proceedings of the OpenMP Shared Memory Parallel Programming - International Workshops, 2006

Implementing Irregular Parallel Algorithms with OpenMP.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2003
Cache Miss Analysis of 2D Stencil Codes with Tiled Time Loop.
Int. J. Found. Comput. Sci., 2003

2002
On optimal temporal locality of stencil codes.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

An Analytical Evaluation of Tiling for Stencil Codes with Time Loop.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Tight Bounds on Capacity Misses for 3D Stencil Codes.
Proceedings of the Computational Science - ICCS 2002, 2002

2001
Structuring statement sequences in instance-based locality optimization.
Future Gener. Comput. Syst., 2001

Exploiting non-uniform reuse for cache optimization.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

2000
Generating structured program instances with a high degree of locality.
Proceedings of the Eight Euromicro Workshop on Parallel and Distributed Processing, 2000

1999
Regularity Considerations in Instance-Based Locality Optimization.
Proceedings of the Parallel and Distributed Processing, 1999

1998
Arranging program statements for locality on the basis of neighbourhood preferences.
Int. J. Approx. Reason., 1998

Arranging statements and data of program instances for locality.
Future Gener. Comput. Syst., 1998

Locality Optimization for Program Instances.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1996
A fuzzy approach to automatic data locality optimization.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1992
Algorithmen und Datenstrukturen für Speicherhierarchien.
PhD thesis, 1992

A Fast Sort Using Parallelism within Memory.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

1991
Reading Data in a Hierarchical Memory.
J. Inf. Process. Cybern., 1991

Maintaining Dictionaries in a Hierarchical Memory.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991


  Loading...