Compiler Construction [electronic resource] : 19th International Conference, CC 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings / edited by Rajiv Gupta.

Contributor(s): Gupta, Rajiv [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 6011Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: XII, 326p. 119 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642119705Subject(s): Computer science | Computer Communication Networks | Software engineering | Computer software | Computer Science | Software Engineering | Programming Languages, Compilers, Interpreters | Programming Techniques | Mathematical Logic and Formal Languages | Computer Communication Networks | Algorithm Analysis and Problem ComplexityAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.758Online resources: Click here to access online
Contents:
Invited Talk -- Programming Clouds -- Optimization Techniques -- Mining Opportunities for Code Improvement in a Just-In-Time Compiler -- Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values -- Optimizing Matlab through Just-In-Time Specialization -- RATA: Rapid Atomic Type Analysis by Abstract Interpretation – Application to JavaScript Optimization -- Program Transformations -- JReq: Database Queries in Imperative Languages -- Verifying Local Transformations on Relaxed Memory Models -- Program Analysis -- Practical Extensions to the IFDS Algorithm -- Using Ownership to Reason about Inherent Parallelism in Object-Oriented Programs -- Register Allocation -- Punctual Coalescing -- Strategies for Predicate-Aware Register Allocation -- Preference-Guided Register Assignment -- High-Performance Systems -- Validating Register Allocation and Spilling -- Automatic C-to-CUDA Code Generation for Affine Programs -- Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors? -- The Polyhedral Model Is More Widely Applicable Than You Think -- The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK8957

Invited Talk -- Programming Clouds -- Optimization Techniques -- Mining Opportunities for Code Improvement in a Just-In-Time Compiler -- Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values -- Optimizing Matlab through Just-In-Time Specialization -- RATA: Rapid Atomic Type Analysis by Abstract Interpretation – Application to JavaScript Optimization -- Program Transformations -- JReq: Database Queries in Imperative Languages -- Verifying Local Transformations on Relaxed Memory Models -- Program Analysis -- Practical Extensions to the IFDS Algorithm -- Using Ownership to Reason about Inherent Parallelism in Object-Oriented Programs -- Register Allocation -- Punctual Coalescing -- Strategies for Predicate-Aware Register Allocation -- Preference-Guided Register Assignment -- High-Performance Systems -- Validating Register Allocation and Spilling -- Automatic C-to-CUDA Code Generation for Affine Programs -- Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors? -- The Polyhedral Model Is More Widely Applicable Than You Think -- The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha