標題: Titlebook: Compiler Construction; 16th International C Shriram Krishnamurthi,Martin Odersky Conference proceedings 2007 Springer-Verlag Berlin Heidelb [打印本頁] 作者: 滲漏 時間: 2025-3-21 18:28
書目名稱Compiler Construction影響因子(影響力)
書目名稱Compiler Construction影響因子(影響力)學科排名
書目名稱Compiler Construction網(wǎng)絡公開度
書目名稱Compiler Construction網(wǎng)絡公開度學科排名
書目名稱Compiler Construction被引頻次
書目名稱Compiler Construction被引頻次學科排名
書目名稱Compiler Construction年度引用
書目名稱Compiler Construction年度引用學科排名
書目名稱Compiler Construction讀者反饋
書目名稱Compiler Construction讀者反饋學科排名
作者: Exclaim 時間: 2025-3-21 23:36 作者: Friction 時間: 2025-3-22 01:01
Layout Transformations for Heap Objects Using Static Access Patterns the chosen structures. To verify the effect of our static optimization, we implement our analyses and optimizations with the CIL compiler. Our experiments with the Olden benchmarks demonstrate that layout transformations for heap objects based on our static access pattern analysis improve cache loc作者: Factorable 時間: 2025-3-22 05:55
https://doi.org/10.1007/978-0-387-71673-2d. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops a作者: GUEER 時間: 2025-3-22 10:17
https://doi.org/10.1007/978-0-387-71673-2d varied from 15× to 68×. In addition, the resulting execution time improved by up to 5.8%, with an average improvement of 2.3%..Together, these results show that Extended Linear Scan is promising as an alternate foundation for global register allocation, compared to Graph Coloring, due to its compi作者: 子女 時間: 2025-3-22 15:15
,After the Cold War—regional tensions, the chosen structures. To verify the effect of our static optimization, we implement our analyses and optimizations with the CIL compiler. Our experiments with the Olden benchmarks demonstrate that layout transformations for heap objects based on our static access pattern analysis improve cache loc作者: 子女 時間: 2025-3-22 18:56 作者: 威脅你 時間: 2025-3-23 00:05
https://doi.org/10.1007/978-0-387-71673-2 binary tree to represent flowgraph information, dominance relation of flowgraphs, and the topological order of nodes. The construction of the annotated decomposition trees runs in .. Experiments were conducted with reducible flowgraphs of the SPEC2000 benchmark suite.作者: Discrete 時間: 2025-3-23 03:56
Program Refactoring, Program Synthesis, and Model-Driven Developmentis paper, I explore their underlying connections by reviewing recent advances in each area from an architectural metaprogramming perspective. I conjecture how these areas can converge and outline a theory that may unify them.作者: LIEN 時間: 2025-3-23 08:24 作者: 序曲 時間: 2025-3-23 10:36 作者: BLANK 時間: 2025-3-23 16:32
https://doi.org/10.1007/978-3-658-29933-0eference-counting collector and report an implementation of a collector that employs such prefetching. The proposed prefetch instructions were inserted into the Jikes reference-counting collector obtaining an average reduction of 8.7% of the memory management overheads.作者: Tailor 時間: 2025-3-23 20:31
https://doi.org/10.1057/9780230373174e., our ILP model outperforms previous approaches. Additionally, we use these optimal solutions to assess the quality of well-known heuristics. A second benchmark on SPEC CPU2000 programs emphasizes the practicality of our algorithm.作者: 浪費時間 時間: 2025-3-23 23:02 作者: 認為 時間: 2025-3-24 06:15
https://doi.org/10.1007/978-3-658-29933-0nteger Linear Programming (ILP) formulation for the above problem. Our approach achieves, on an average, 20% energy reduction over the base scheme, and 8% to 10% energy reduction over previously suggested methods. Further, the results obtained using our heuristic are within 1% of optimal results obtained by using our ILP method.作者: 歡樂中國 時間: 2025-3-24 10:03 作者: ticlopidine 時間: 2025-3-24 11:21
An Array Allocation Scheme for Energy Reduction in Partitioned Memory Architecturesnteger Linear Programming (ILP) formulation for the above problem. Our approach achieves, on an average, 20% energy reduction over the base scheme, and 8% to 10% energy reduction over previously suggested methods. Further, the results obtained using our heuristic are within 1% of optimal results obtained by using our ILP method.作者: 沉著 時間: 2025-3-24 15:56
A Declarative Framework for Analysis and Optimizationxtract structured control flow constructs. This paper motivates the design, and demonstrates some of its power, using a sequence of examples including performance profiling and domain-specific performance optimisations for database access and remote method invocation.作者: 使虛弱 時間: 2025-3-24 19:02
New Algorithms for SIMD Alignmentions for these two cases. The new algorithms employ dynamic programming and a ./. algorithm as subroutines. We also discuss the relation between the . problem and the . and . problems; and we show how to derive an approximated solution to the . problem based on approximation algorithms to these two known problems.作者: Incorporate 時間: 2025-3-25 01:36
Using Prefetching to Improve Reference-Counting Garbage Collectorseference-counting collector and report an implementation of a collector that employs such prefetching. The proposed prefetch instructions were inserted into the Jikes reference-counting collector obtaining an average reduction of 8.7% of the memory management overheads.作者: Facilities 時間: 2025-3-25 04:16 作者: 犬儒主義者 時間: 2025-3-25 10:53 作者: GIDDY 時間: 2025-3-25 12:17 作者: Polydipsia 時間: 2025-3-25 16:28
Bovenste extremiteit en schoudergordel,such uncooperative environments. We implemented the new technique in the Ovm Java virtual machine with our own Java-to-C++ compiler and GCC as a back-end, and found that our technique outperforms existing approaches.作者: intercede 時間: 2025-3-25 22:13 作者: 產(chǎn)生 時間: 2025-3-26 02:30
https://doi.org/10.1057/9780230373174se results show that most of the obfuscations have only minor negative performance impacts and many increase complexity. In almost all cases, tested decompilers fail to produce legal source code or crash completely. Those obfuscations that are decompilable greatly reduce the readability of output source.作者: Trigger-Point 時間: 2025-3-26 07:22 作者: 正式通知 時間: 2025-3-26 10:09
Accurate Garbage Collection in Uncooperative Environments with Lazy Pointer Stackssuch uncooperative environments. We implemented the new technique in the Ovm Java virtual machine with our own Java-to-C++ compiler and GCC as a back-end, and found that our technique outperforms existing approaches.作者: climax 時間: 2025-3-26 15:00 作者: 替代品 時間: 2025-3-26 17:05
Obfuscating Java: The Most Pain for the Least Gainse results show that most of the obfuscations have only minor negative performance impacts and many increase complexity. In almost all cases, tested decompilers fail to produce legal source code or crash completely. Those obfuscations that are decompilable greatly reduce the readability of output source.作者: Expressly 時間: 2025-3-26 21:26
New Algorithms for SIMD Alignmentallenging aspect: the . problem. Previously, only heuristics were used to solve this problem, without guarantees on the number of shifts in the obtained solution. We study two interesting and realistic special cases of the . problem and present two novel and efficient algorithms that provide . solut作者: 釘牢 時間: 2025-3-27 04:23 作者: Kidnap 時間: 2025-3-27 08:23 作者: hieroglyphic 時間: 2025-3-27 09:49
Using Prefetching to Improve Reference-Counting Garbage Collectorsorious overhead and extend the basic method to run concurrently and efficiently on a modern computing platform. In this paper we investigate the use of prefetching to further improve the efficiency of the reference-counting collector..We propose potential prefetching opportunities for the advanced r作者: Nutrient 時間: 2025-3-27 14:09
Accurate Garbage Collection in Uncooperative Environments with Lazy Pointer Stacksms supported by the host language and reduces the development time as many low-level tasks can be delegated to the host compiler. The C and C++ programming languages are popular choices for many language implementations due to the availability of efficient compilers on many platforms, and good porta作者: Agronomy 時間: 2025-3-27 19:40 作者: 誰在削木頭 時間: 2025-3-27 23:10 作者: 帶來 時間: 2025-3-28 02:58
A Fast Cutting-Plane Algorithm for Optimal Coalescingpresents an algorithm for the coalescing subproblem that relies on this separation. The algorithm uses 0/1 Linear Programming (ILP), a general-purpose optimization technique, to derive optimal solutions..We provide the first optimal solutions for a benchmark called “Optimal Coalescing Challenge”, i.作者: 為寵愛 時間: 2025-3-28 10:01
Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer hedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spi作者: 問到了燒瓶 時間: 2025-3-28 11:34 作者: indicate 時間: 2025-3-28 17:41
Program Refactoring, Program Synthesis, and Model-Driven Development all architectural metaprogramming technologies as they treat programs as values and use functions (a.k.a. .) to map programs to other programs. In this paper, I explore their underlying connections by reviewing recent advances in each area from an architectural metaprogramming perspective. I conjec作者: Impugn 時間: 2025-3-28 21:22
A Practical Escape and Effect Analysis for Building Lightweight Method Summarieslysis is parameterized on two values: ., indicating the heap depth beyond which objects escape; and ., a branching factor indicating the maximum number of fields per object that the analysis precisely tracks. Restricting these parameters to small values allows us to keep the method summaries lightwe作者: Enzyme 時間: 2025-3-28 23:59 作者: CLAN 時間: 2025-3-29 04:35 作者: 人工制品 時間: 2025-3-29 09:57
A Declarative Framework for Analysis and Optimizationnsists of a query part, and a part which may modify code. DeepWeaver’s query language is based on Prolog, and provides access to data-flow and control-flow reachability analyses. DeepWeaver provides a declarative way to access the internal structure of methods, and supports cross-cutting weaves whic作者: fabricate 時間: 2025-3-29 13:28 作者: 保留 時間: 2025-3-29 18:35 作者: 啜泣 時間: 2025-3-29 21:57 作者: 短程旅游 時間: 2025-3-30 03:40 作者: 群居動物 時間: 2025-3-30 07:37 作者: RACE 時間: 2025-3-30 08:33 作者: Euthyroid 時間: 2025-3-30 12:53
Bovenste extremiteit en schoudergordel,ms supported by the host language and reduces the development time as many low-level tasks can be delegated to the host compiler. The C and C++ programming languages are popular choices for many language implementations due to the availability of efficient compilers on many platforms, and good porta作者: ordain 時間: 2025-3-30 20:11
https://doi.org/10.1007/978-90-313-6563-0th low runtime overhead. As object-oriented programmers compose increasingly complex programs, inaccurate call graphs will inhibit analysis and optimizations. This paper demonstrates how to use static and dynamic . (CFG) constraints to improve the accuracy of the DCG. We introduce the . (FDOM), a no作者: lobster 時間: 2025-3-31 00:11
