Dietz | Languages and Compilers for Parallel Computing | Buch | 978-3-540-04029-3 | sack.de

Buch, Englisch, Band 2624, 450 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1410 g

Reihe: Lecture Notes in Computer Science

Dietz

Languages and Compilers for Parallel Computing

14th International Workshop, LCPC 2001, Cumberland Falls, KY, USA, August 1-3, 2001, Revised Papers
2003
ISBN: 978-3-540-04029-3
Verlag: Springer Berlin Heidelberg

14th International Workshop, LCPC 2001, Cumberland Falls, KY, USA, August 1-3, 2001, Revised Papers

Buch, Englisch, Band 2624, 450 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1410 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-04029-3
Verlag: Springer Berlin Heidelberg


This book constitutes the thoroughly refereed post-proceedings of the 14th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2001, held in Lexington, KY, USA, in August 1-3, 2001.

The 28 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in parallel processing are addressed, in particular compiler optimization, HP Java programming, power-aware parallel architectures, high performance applications, power management of mobile computers, data distribution, shared memory systems, load balancing, garbage collection, parallel components, job scheduling, dynamic parallelization, cache optimization, specification, and dataflow analysis.

Dietz Languages and Compilers for Parallel Computing jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


Optimizing Compiler Design for Modularity and Extensibility.- Translation Schemes for the HPJava Parallel Programming Language.- Compiler and Middleware Support for Scalable Data Mining.- Bridging the Gap between Compilation and Synthesis in the DEFACTO System.- Instruction Balance and Its Relation to Program Energy Consumption.- Dynamic Voltage and Frequency Scaling for Scientific Applications.- Improving Off-Chip Memory Energy Behavior in a Multi-processor, Multi-bank Environment.- A Compilation Framework for Power and Energy Management on Mobile Computers.- Locality Enhancement by Array Contraction.- Automatic Data Distribution Method Using First Touch Control for Distributed Shared Memory Multiprocessors.- Balanced, Locality-Based Parallel Irregular Reductions.- A Comparative Evaluation of Parallel Garbage Collector Implementations.- STAPL: An Adaptive, Generic Parallel C++ Library.- An Interface Model for Parallel Components.- Tree Traversal Scheduling: A Global Instruction Scheduling Technique for VLIW/EPIC Processors.- MIRS: Modulo Scheduling with Integrated Register Spilling.- Strength Reduction of Integer Division and Modulo Operations.- An Adaptive Scheme for Dynamic Parallelization.- Probabilistic Points-to Analysis.- A Compiler Framework to Detect Parallelism in Irregular Codes.- Compiling for a Hybrid Programming Model Using the LMAD Representation.- The Structure of a Compiler for Explicit and Implicit Parallelism.- Coarse Grain Task Parallel Processing with Cache Optimization on Shared Memory Multiprocessor.- A Language for Role Specifications.- The Specification of Source-to-Source Transformations for the Compile-Time Optimization of Parallel Object-Oriented Scientific Applications.- Computing Array Shapes in MATLAB.- Polynomial Time Array Dataflow Analysis.- Induction Variable Analysis without Idiom Recognition: Beyond Monotonicity.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.