检索结果-内蒙古大学图书馆

28th Australasian Computer Science Conference, ACSC 2005

作者： Hua, Phung Xue, Nguyen Jingling Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2032 Australia

ISBN: (纸本)1920682201

We introduce a new approach to computing interprocedural modification side effects for Java programs in the presence of dynamic class loading. When compile-time unknown classes can be loaded dynamically, the points-to and modification sets computed statically based on the analysed program, called internal world, may be incomplete. Thus, the modification side effects cannot be determined based on such sets alone. We present a technique, called internal analysis (IA), to classify the references, objects and call sites in the analysed program so that we can determine which points-to and modification sets are deffinitely complete and which may be not. By combining the points-to sets and this classification, we obtain a new IA-based interprocedural side-effect analysis for determining the modification side-effects of any statement on any variable with good accuracy. We have implemented our algorithms in Soot. This paper demonstrates two important applications of this work: partial redundancy elimination (PRE) and copy propagation for field accesses. We report significantly increased opportunities in performing these optimisations over benchmarks when compared with a recently proposed technique in these areas. Our techniques are simple since they are flow-insensitive and achieve these improvements at small analysis costs. Copyright © 2005, Australian Computer Society, Inc.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

Ownership types for object synchronisation 1

引用

10th Asian Symposium on programming languages and Systems, APLAS 2012

作者： Lu, Yi Potter, John Xue, Jingling Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2052 Australia

ISBN: (数字)9783642351822

ISBN: (纸本)9783642351815

Shared-memory concurrent programming is difficult and error prone because memory accesses by concurrent threads need to be coordinated through synchronisation, which relies on programmer discipline and suffers from a lack of modularity and compile-time support. This paper exploits object structures, provided by ownership types, to enable a structured synchronisation scheme which guarantees safety and allows more concurrency within structured tasks. © Springer-Verlag 2012.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

ITKBoard: A visual dataflow language for biomedical image processing

ITKBoard: A visual dataflow language for biomedical image pr...

引用

2nd International Conference on Software and Data Technologies

作者： Le, Hoang D. K. Li, Rongxin Ourselin, Sebastien Potter, John M. BioMedIA Autonomous Systems Laboratory Australia Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney Australia

ISBN: (纸本)9789898111050

Experimenters in biomedical image processing rely on software libraries to provide a large number of standard filtering and image handling algorithms. The Insight Toolkit (ITK) is an open-source library that provides a complete framework for a range of image processing tasks, and is specifically aimed at segmentation and registration tasks for both two and three dimensional images. This paper describes a visual dataflow language, ITKBoard, designed to simplify building, and more significantly, experimenting with ITK applications. The ease with which image processing experiments can be interactively modified and controlled is an important aspect of the design. The experimenter can focus on the image processing task at hand, rather than worry about the underlying software. ITKBoard incorporates composite and parameterised components, and control constructs, and relies on a novel hybrid dataflow model, combining aspects of both demand and data-driven execution.

关键词： dataflow programming visual programming languages image processing software ITK ITKBoard

来源：评论

学校读者我要写书评

暂无评论

Completeness analysis for incomplete object-oriented programs

Completeness analysis for incomplete object-oriented program...

引用

14th International Conference on Compiler Construction, CC 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005

作者： Xue, Jingling Nguyen, Phung Hua Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2032 Australia

We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynamic class loading. One distinctive feature of this work is that the access and modification properties of fields are taken into account. By combining with a whole-program points-to analysis, completeness analysis yields not only the required points-to sets but also determines which points-to sets and call sites are complete (when the pointed-to objects and target methods are statically resolvable) or not. Such a compositional approach yields more precise points-to sets than those computed by the points-to analysis alone. In addition, our technique also determines (for the first time) which objects may be incompletely detectable, i.e., may be missing in some statically computed points-to sets. We provide experimental evidence to demonstrate that better analysis precision in benchmarks is obtained when the field access and modification properties are exploited. In particular, we are able to find significantly more complete and mono call sites in an incomplete program, which is useful in devirtualisation and inlining. Our analysis is simple since it is flow- and context-insensitive and achieves these improvements at reasonably small analysis costs. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Contention-Aware Scheduling for Asymmetric Multicore Processors

Contention-Aware Scheduling for Asymmetric Multicore Process...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xiaokang Fan Yulei Sui Jingling Xue Programming Languages and Compilers Group UNSW Australia

Asymmetric multicore processors (AMPs) have been proposed as an energy-efficient alternative to symmetric mul-ticore processors (SMPs). However, AMPs derive their performance from core specialization, which requires co-running applications to be scheduled to run on their most appropriate core types. Despite extensive research on AMP scheduling, developing an effective scheduling algorithm remains challenging. Contention for shared resources is a key performance-limiting factor, which often renders existing contention-free scheduling algorithms ineffective. We introduce a contention-aware scheduling algorithm for ARM's ***, a commercial AMP platform. Our algorithm comprises an offline stage and an online stage. The offline stage builds a performance interference model for an application by training it with a set of co-running applications. Guided by this model, the online stage schedules a workload by assigning its applications to their most appropriate core types in order to minimize the performance degradation caused by contention for shared resources. Our model can accurately predict the performance degradation of an application when co-running with other applications with an average prediction error of 9.60%. Compared with the default scheduler provided for ARM's *** and the speedup-factor-driven scheduler, our contention-aware scheduler can improve overall system performance by up to 28.32% and 28.51%, respectively.

关键词： Multicore processing Interference Program processors Scheduling algorithms Scheduling Degradation

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Circular Queue Method for Iterative Stencil Computations on GPUs

引用

Journal of Computer Science & Technology 2012年第1期27卷 57-74页

作者： Yang Yang Hui-Min Cui Xiao-Bing Feng Jing-Ling Xue State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190China Graduate University of Chinese Academy of Sciences Beijing 100190China Programming Languages and Compilers Group School of Computer Science and Engineering University of New South WalesSydneyNSW 2052Australia

In this paper, we present a hybrid circular queue method that can significantly boost the performance of stencil computations on GPU by carefully balancing usage of registers and shared-memory. Unlike earlier methods that rely on circular queues predominantly implemented using indirectly addressable shared memory, our hybrid method exploits a new reuse pattern spanning across the multiple time steps in stencil computations so that circular queues can be implemented by both shared memory and registers effectively in a balanced manner. We describe a framework that automatically finds the best placement of data in registers and shared memory in order to maximize the performance of stencil computations. Validation using four different types of stencils on three different GPU platforms shows that our hybrid method achieves speedups up to 2.93X over methods that use circular queues implemented with shared-memory only.

关键词： stencil computation circular queue GPU occupancy register

来源：评论

学校读者我要写书评

暂无评论

Trace-based data cache leakage reduction at link time

Trace-based data cache leakage reduction at link time

引用

11th Asia-Pacific Conference on Advances in Computer Systems Architecture, ACSAC 2006

作者： Li, An Xue, Jingling Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2052 Australia National ICT Australia Australia

ISBN: (纸本)3540400567

This paper investigates the benefits of conducting leakage energy optimisations for data caches at link time for embedded applications. We introduce an improved algorithm for identifying and constructing the traces in a binary program and present a trace-based optimisation for reducing leakage energy in data caches. Our experimental results using Mediabench benchmarks show that good leakage energy savings can be achieved at the cost of some small performance and code size penalties. Furthermore, by varying the granularity of optimisation regions, which is a tunable parameter, embedded application programmers can make the tradeoffs between energy savings and these associated costs. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Region-Based selective flow-sensitive pointer analysis

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8723卷 319-336页

作者： Ye, Sen Sui, Yulei Xue, Jingling Programming Languages and Compilers Group School of Computer Science and Engineering UNSW Kensington Australia

We introduce a new region-based SELective Flow-Sensitive (Selfs) approach to inter-procedural pointer analysis for C that operates on the regions partitioned from a program. Flow-sensitivity is maintained between the regions but not inside, making traditional flow-insensitive and flow-sensitive as well as recent sparse flow-sensitive analyses all special instances of our Selfs framework. By separating region partitioning as an independent concern from the rest of the pointer analysis, Selfs facilitates the development of flow-sensitive variations with desired efficiency and precision tradeoffs by reusing existing pointer resolution algorithms. We also introduce a new unification-based approach for region partitioning to demonstrate the generality and flexibility of our Selfs framework, as evaluated using SPEC2000/2006 benchmarks in LLVM. © Springer International Publishing Switzerland 2014.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs

Scratchpad memory allocation for data aggregates via interva...

引用

作者： Li, Lian Xue, Jingling Knoop, Jens University of New South Wales School of Computer Science and Engineering Programming Languages and Compilers Group Sydney NSW 2052 Australia Technische Universität Wien Institut für Computersprachen Argentinierstraße 8 1040 Wien Austria

Existing methods place data or code in scratchpad memory (SPM) by relying on heuristics or resorting to integer programming or mapping it to a graph-coloring problem. In this article, the SPM allocation problem for arrays is formulated as an interval coloring problem. The key observation is that in many embedded C programs, two arrays can bemodeled such that either their live ranges do not interfere or one contains the other (with good accuracy). As a result, array interference graphs often form a special class of superperfect graphs (known as comparability graphs), and their optimal interval colorings become efficiently solvable. This insight has led to the development of an SPM allocation algorithm that places arrays in an interference graph in SPM by examining its maximal cliques. If the SPM is no smaller than the clique number of an interference graph, then all arrays in the graph can be placed in SPM optimally. Otherwise, we rely on containment-motivated heuristics to split or spill array live ranges until the resulting graph is optimally colorable. We have implemented our algorithm in SUIF/machSUIF and evaluated it using a set of embedded C benchmarks from MediaBench and MiBench. Compared to a graph-coloring algorithm and an optimal ILP algorithm (when it runs to completion), our algorithm achieves close-to-optimal results and is superior to graph coloring for the benchmarks tested. © 2010 ACM.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Acculock: Accurate and efficient detection of data races 11

Acculock: Accurate and efficient detection of data races

引用

International Symposium on Code Generation and Optimization (CGO)

作者： Xinwei Xie Jingling Xue Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales NSW Australia

ISBN: (纸本)9781612843568

Happens-before detectors are precise but can be too conservative to detect certain data races in repeated test runs as they are sensitive to thread interleaving. By making the opposite tradeoffs, lockset detectors can detect more races but are not precise (by reporting false positives). For both types of detectors, happens-before detectors run more slowly as they use expensive vector clocks. Existing hybrid race detectors (combining lockset and happens-before) alleviate some of the limitations in both analysis techniques at the cost of additional analysis overhead. Recently, due to FastTrack, epoch-based happens-before and lockset detectors now exhibit comparable performance. It is the time to rethink how to design a hybrid race detector to balance precision and coverage, by leveraging the lightweightness of epoch clocks. Acculock is the first such a solution. Acculock analyzes a program by reasoning about the subset of the happens-before relation observed with lock acquires and releases excluded, thereby reducing its sensitivity to thread interleaving. When such a weaker happens-before relation is violated, Acculock applies a new efficient lockset algorithm to enforce a lock-based synchronization discipline by distinguishing the locks protecting reads and writes. The key motivation behind is to ensure that Acculock can improve happens-before detectors by discovering also data races in alternate thread interleavings when analyzing one program execution while limiting false warnings thus incurred in a controlled manner. In addition, Acculock achieves these objectives by maintaining comparable performance as FastTrack, the fastest happens-before detector. All these properties of Acculock are validated and confirmed by comparing it against six other detectors, all implemented in Jikes RVM using 11 benchmark programs.

关键词： Detectors Clocks Synchronization Instruction sets Copper Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：