Prof. Dr. Claudia Fohry

Fachgebietsleiterin

Anschrift Universität Kassel
Fachgebiet Programmiersprachen/-methodik
Fachbereich 16 Elektrotechnik/Informatik
Wilhelmshöher Allee 71-73
34121 Kassel
Gebäude: WA-altes Gebäude (WA 73)

Raum 2313

Telefon +49 561 804-6270
Telefax +49 561 804-6219
E-Mail-Adresse fohry@uni-kassel.de

Sprechstunde:

Dienstag 13:00 Uhr - 14:00 Uhr

Bild von Prof. Dr. Claudia  Fohry

Veröffentlichungen

[PF17b] J. Posner, C. Fohry: A Combination of Intra- and Inter-Place Work Stealing for the APGAS Library, Workshop Proc. Parallel Processing and Applied Mathematics (WLPP), 2017, to appear.

[PF17a] J. Posner, C. Fohry: Fault Tolerance for Cooperative Lifeline-Based Global Load Balancing in Java with APGAS and Hazelcast, Workshop Proc. Int. Parallel and Distributed Processing Symposium (APDCM), 2017, to appear.

[FB16a]  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.

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

[FBP15b] C. Fohry, M. Bungart, J. Posner: Fault Tolerance Schemes for Global Load Balancing in X10; Scalable Computing: Practice and Experience, Volume 16, Number 2, 2015, pp. 169–185.

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

[BFP14] M. Bungart, C. Fohry, J. Posner: Fault-Tolerant Global Load Balancing in X10; Proc. SYNASC2014 Workshop on HPC research services, Sept. 2014, S.471- 478.

[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 (PPAM 2013), Part II, Springer LNCS 8385,  pp. 75–85, 2014. 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), S. 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), Atlanta, 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, Cyprus, 2008, S. 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, S. 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 No. 1 / 2007, Kassel, May 2007.

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

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

[SL07a]
M. Süß, C. Leopold: Generic Locking and Deadlock-Prevention with C++, Proc. Parallel Computing (ParCo), Jülich, 2007, S. 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, Beijing, 2007, Springer LNCS 4935, S. 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, Bonn, Springer LNCS 4192, S. 285 - 292.

[SL06b]
M. Süß, C. Leopold: Implementing Irregular Parallel Algorithms with OpenMP, Proc. Euro-Par, Dresden, 2006, Springer LNCS 4128© Springer-Verlag, S. 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, Reims, 2006, Springer LNCS 4315, S. 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, Reims, 2006, Springer LNCS 4315, S. 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 Conference on Modelling and Simulation, Bonn, 2006, S. 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, Karlsruhe, 2006, S. 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, Athens, 2005, S. 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. 14th IST Mobile and Wireless Communications Summit, Dresden, June 2005.

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

[Leo05a]
C. Leopold: Effizient und einfach parallel programmieren. Antrittsvorlesung Universität Kassel, Januar 2005.

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

[Leo04a]
A. Iványi, C. Leopold: Parallel Computations (ungarische Übersetzung). In: A. Iványi (ed.): Informatikai Algoritmusok, Scolar Publisher, Budapest, 2004, S. 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, S. 39-58.

[Leo03a]
C. Leopold: Lokalitätsoptimierung für Speicherhierarchien und Programmiermodelle des parallelen und verteilten Rechnens. Habilitationsschrift, Friedrich-Schiller-Universität Jena, 2003.

[Leo02e]
C. Leopold: An Analytical Evaluation of Tiling for Stencil Codes with Time Loop. Proc. Int. Parallel and Distributed Processing Symp., Workshop on Advances in Parallel and Distributed Computational Models, IEEE, Fort Lauderdale 2002, auf 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, Washington 2002.

[Leo02c]
C. Leopold: Tight Bounds on Capacity Misses for 3D Stencil Codes. Proc. Int. Conf. on Computational Science, Amsterdam 2002, Springer LNCS 2329, S. 843-852 (copyright by Springer-Verlag ).

[Leo02b]
C. Leopold: On Optimal Temporal Locality of Stencil Codes. Proc. ACM Symp. on Applied Computing, Madrid 2002, S. 948-952. (note copyright by ACM)

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

[Leo01c]
C. Leopold: Exploiting Non-Uniform Reuse for Cache Optimization: A Case Study. Proc.ACM Symp. on Applied Computing, Las Vegas 2001, S. 560-564 (note copyright by ACM).

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

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

[Leo00]
C. Leopold: Generating Structured Program Instances with a High Degree of Locality. Proc. Euromicro Workshop on Parallel and Distributed Processing, Rhodos 2000, IEEE, S. 267-274 (note copyright by IEEE).

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

[Leo98d]
C. Leopold: Arranging Statements and Data of Program Instances for Locality. Future Generation Computer Systems, Vol. 14, 1998, S. 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), Orlando 1998, Springer LNCS 1388, S. 225-233 (copyright by Springer Verlag ).

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

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

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

[Leo96]
C. Leopold: A Fuzzy Approach to Automatic Data Locality Optimization. Proc. ACM Symp. on Applied Computing, Philadelphia 1996, S. 515-518 (note copyright by ACM).

[Leo95b]
T. Heywood, C. Leopold: Dynamic Randomized Simulation of Hierarchical PRAMs on Meshes. Proc. First Aizu Int. Symp. on Parallel Algorithms/Architecture Synthesis, Aizu-Wakamatsu 1995, IEEE, S. 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, S. 1-16.