2009 | ||
---|---|---|
45 | EE | Michael Klemm, Matthias Bezold, Stefan Gabriel, Ronald Veldema, Michael Philippsen: Reparallelization techniques for migrating OpenMP codes in computational grids. Concurrency and Computation: Practice and Experience 21(3): 281-299 (2009) |
2008 | ||
44 | EE | Jean Christophe Beyler, Michael Klemm, Michael Philippsen, Philippe Clauss: Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs. Euro-Par 2008: 643-653 |
43 | T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fischer, Michael Philippsen: Dagma: Mining Directed Acyclic Graphs. IADIS European Conf. Data Mining 2008: 11-18 | |
2007 | ||
42 | EE | Michael Klemm, Matthias Bezold, Stefan Gabriel, Ronald Veldema, Michael Philippsen: Reparallelization and Migration of OpenMP Programs. CCGRID 2007: 529-540 |
41 | EE | A. Dreweke, Marc Wörlein, Ingrid Fischer, D. Schell, Thorsten Meinl, Michael Philippsen: Graph-Based Procedural Abstraction. CGO 2007: 259-270 |
40 | EE | Michael Klemm, Jean Christophe Beyler, Ronny T. Lampert, Michael Philippsen, Philippe Clauss: Esodyp+: Prefetching in the Jackal Software DSM. Euro-Par 2007: 563-573 |
39 | EE | Ronald Veldema, Michael Philippsen: Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster. LCPC 2007: 187-201 |
38 | EE | Ronald Veldema, Michael Philippsen: Evaluation of RDMA Opportunities in an Object-Oriented DSM. LCPC 2007: 217-231 |
37 | EE | Michael Klemm, Matthias Bezold, Ronald Veldema, Michael Philippsen: JaMP: an implementation of OpenMP for a Java DSM. Concurrency and Computation: Practice and Experience 19(18): 2333-2352 (2007) |
2006 | ||
36 | EE | Thorsten Meinl, Marc Wörlein, Olga Urzova, Ingrid Fischer, Michael Philippsen: The ParMol Package for Frequent Subgraph Mining. ECEASST 1: (2006) |
2005 | ||
35 | EE | Ronald Veldema, Michael Philippsen: Near Overhead-free Heterogeneous Thread-migration. CLUSTER 2005: 1-10 |
34 | Thorsten Meinl, Ingrid Fischer, Michael Philippsen: Parallel Mining for Frequent Fragments on a Shared-Memory Multiprocessor - Results and Java-Obstacles. LWA 2005: 196-201 | |
33 | EE | Marc Wörlein, Thorsten Meinl, Ingrid Fischer, Michael Philippsen: A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston. PKDD 2005: 392-403 |
2003 | ||
32 | EE | Ronald Veldema, Michael Philippsen: Compiler Optimized Remote Method Invocation. CLUSTER 2003: 127- |
31 | EE | Lutz Prechelt, Barbara Unger, Michael Philippsen, Walter F. Tichy: A controlled experiment on inheritance depth as a cost factor for code maintenance. Journal of Systems and Software 65(2): 115-126 (2003) |
2002 | ||
30 | EE | Lutz Prechelt, Barbara Unger-Lamprecht, Michael Philippsen, Walter F. Tichy: Two Controlled Experiments Assessing the Usefulness of Design Pattern Documentation in Program Maintenance. IEEE Trans. Software Eng. 28(6): 595-606 (2002) |
29 | EE | Michael Philippsen: Internetwahlen - Demokratische Wahlen über das Internet? Informatik Spektrum 25(2): 138-150 (2002) |
28 | EE | Lutz Prechelt, Guido Malpohl, Michael Philippsen: Finding Plagiarisms among a Set of Programs with JPlag. J. UCS 8(11): 1016- (2002) |
2001 | ||
27 | EE | Vladimir Getov, Michael Philippsen: Java Communications for Large-Scale Parallel Computing. LSSC 2001: 33-45 |
26 | Vladimir Getov, Gregor von Laszewski, Michael Philippsen, Ian T. Foster: Multiparadigm communications in Java for grid computing. Commun. ACM 44(10): 118-125 (2001) | |
2000 | ||
25 | EE | Michael Philippsen, Ronald F. Boisvert, Vladimir Getov, Roldan Pozo, José E. Moreira, Dennis Gannon, Geoffrey Fox: JavaGrande - High Performance Computing with Java. PARA 2000: 20-36 |
24 | Michael Philippsen: A survey of concurrent object-oriented languages. Concurrency - Practice and Experience 12(10): 917-980 (2000) | |
23 | Michael Philippsen, Edwin Günthner: Complex numbers for Java. Concurrency - Practice and Experience 12(6): 477-491 (2000) | |
22 | Michael Philippsen, Bernhard Haumacher, Christian Nester: More efficient serialization and RMI for Java. Concurrency - Practice and Experience 12(7): 495-518 (2000) | |
21 | Michael Philippsen: Cooperating distributed garbage collectors for clusters and beyond. Concurrency - Practice and Experience 12(7): 595-610 (2000) | |
20 | Michael Philippsen, Bernhard Haumacher: Locality optimization in JavaParty by means of static type analysis. Concurrency - Practice and Experience 12(8): 613-628 (2000) | |
19 | EE | Michael Philippsen: JavaGrande - Hochleistungsrechnen mit Java. Informatik Spektrum 23(2): 79-89 (2000) |
1999 | ||
18 | Matthias Gimbel, Michael Philippsen, Bernhard Haumacher, Peter C. Lockemann, Walter F. Tichy: JAVA as a Basis for Parallel Data Mining in Workstation Clusters. HPCN Europe 1999: 884-894 | |
17 | Brian Blount, Siddhartha Chatterjee, Michael Philippsen: Irregular Parallel Algorithms in JAVA. IPPS/SPDP Workshops 1999: 1026-1035 | |
16 | Michael Philippsen, Bernhard Haumacher: More Efficient Object Serialization. IPPS/SPDP Workshops 1999: 718-732 | |
15 | Michael Philippsen, Edwin Günthner: Complex Numbers for Java. ISCOPE 1999: 1-12 | |
14 | EE | Christian Nester, Michael Philippsen, Bernhard Haumacher: A More Efficient RMI for Java. Java Grande 1999: 152-159 |
13 | Christian Nester, Michael Philippsen, Bernhard Haumacher: Effizientes RMI für Java. Java-Informations-Tage 1999: 135-148 | |
12 | Edwin Günthner, Michael Philippsen: Komplexe Zahlen für Java. Java-Informations-Tage 1999: 253-266 | |
1998 | ||
11 | Michael Philippsen, Matthias Zenger, Matthias Jacob: JavaParty - portables paralleles und verteiltes Programmieren in Java. Java-Informations-Tage 1998: 22-38 | |
10 | Matthias Jacob, Michael Philippsen, Martin Karrenbach: Large-scale parallel geophysical algorithms in Java: a feasibility study. Concurrency - Practice and Experience 10(11-13): 1143-1153 (1998) | |
9 | Michael Philippsen, Matthias Jacob, Martin Karrenbach: Fallstudie: Parallele Realisierung geophysikalischer Basisalgorithmen in Java. Inform., Forsch. Entwickl. 13(2): 72-78 (1998) | |
8 | Walter F. Tichy, Michael Philippsen, Lutz Prechelt, Thomas M. Warschko: Forschungsprojekte des Lehrstuhls für Programmiersysteme der Universität Karlsruhe (TH). Inform., Forsch. Entwickl. 13(2): 93-96 (1998) | |
1997 | ||
7 | Michael Philippsen, Matthias Zenger: JavaParty - Transparent Remote Objects in Java. Concurrency - Practice and Experience 9(11): 1225-1242 (1997) | |
1995 | ||
6 | Michael Philippsen: Automatic Alignment of Array Data and Processes to Reduce Communication Time on DMPPs. PPOPP 1995: 156-165 | |
1993 | ||
5 | Michael Philippsen, Ernst A. Heinz, Paul Lukowicz: Compiling Machine-Independent Parallel Programs. SIGPLAN Notices 28(8): 99-108 (1993) | |
1992 | ||
4 | Michael Philippsen, Thomas M. Warschko, Walter F. Tichy, Christian Herter: Projekt Triton: Beiträge zur Verbesserung der Programmierbarkeit hochparalleler Rechensysteme. Inform., Forsch. Entwickl. 7(1): 1-13 (1992) | |
1991 | ||
3 | Michael Philippsen, Walter F. Tichy: MODULA-2 and Its Compilation. ACPC 1991: 169-183 | |
2 | Walter F. Tichy, Michael Philippsen: Discussion: Parallelism Code Generation 1991: 112-115 | |
1 | Michael Philippsen, Walter F. Tichy: Compiling for Massively Parallel Machines. Code Generation 1991: 92-111 |