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

Automatic generation of DAG parallelism

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 54-68页

作者： Cytron, Ron Hind, Michael Hsieh, Wilson IBM T.J. Watson Research Cent United States

We present an algorithm for automatically generating a nested, fork-join parallel program from a sequential program represented in terms of control and data dependences. This algorithm embodies two techniques for dealing with data dependences: the first implicitly satisfies such dependences by reducing parallelism, and the second eliminates some dependences by introducing private variables. This algorithm has been implemented in the PTRAN system.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Process decomposition through locality of reference

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 69-80页

作者： Rogers, Anne Pingali, Keshav Cornell Univ United States

In the context of sequential computers, it is common practice to exploit temporal locality of reference through devices such as caches and virtual memory. In the context of multiprocessors, we believe that it is equally important to exploit spatial locality of reference. We are developing a system which, given a sequential program and its domain decomposition, performs process decomposition so as to enhance spatial locality of reference. We describe an application of this method - generating code from shared-memory programs for the (distributed memory) Intel iPSC/2.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Technique for summarizing data access and its use in parallelism enhancing transformations

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 41-53页

作者： Balasundaram, Vasanth Kennedy, Ken Rice Univ United States

In this paper, we present a technique for summarizing the data accesses in a given region and show how this summary can be used to detect and enhance task parallelism in a program. For the sake of simplicity, we restrict our discussion to Fortran programs that consist of a sequence of perfectly-nested loops in which all subroutine calls are expanded inline. However, the techniques presented here can easily be extended to the general case of programs with imperfectly nested loops and subroutine calls.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Automatic volume management for programmable microfluidics

引用

acm sigplan NOTICES 2008年第6期43卷 56-67页

作者： Amin, Ahmed M. Thottethodi, Mithuna Vijaykumar, T. N. Wereley, Steven Jacobson, Stephen C. Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Purdue Univ Sch Mech Engn W Lafayette IN 47907 USA Indiana Univ Dept Chem Bloomington IN 47405 USA

Microfluidics has enabled lab-on-a-chip technology to miniaturize and integrate biological and chemical analyses to a single chip comprising channels, valves, mixers, heaters, separators, and sensors. Recent papers have proposed programmable labs-on-a-chip as an alternative to traditional application-specific chips to reduce design effort, time, and cost. While these previous papers provide the basic support for programmability, this paper identifies and addresses a practical issue, namely, fluid volume management. Volume management addresses the problem that the use of a fluid depletes it and unless the given volume of a fluid is distributed carefully among all its uses, execution may run out of the fluid before all its uses are complete. Additionally, fluid volumes should not overflow (i.e., exceed hardware capacity) or underflow (i.e., fall below hardware resolution). We show that the problem can be formulated as a linear programming problem ( LP). Because LP's complexity and slow execution times in practice may be a concern, we propose another approach, called DAGSolve, which over-constrains the problem to achieve linear complexity while maintaining good solution quality. We also propose two optimizations, called cascading and static replication, to handle cases involving extreme mix ratios and numerous fluid uses which may defeat both LP and DAGSolve. Using some real-world assays, we show that our techniques produce good solutions while being faster than LP.

关键词： algorithms design microfluidics programmable lab-on-a-chip fluid volume management

来源：评论

学校读者我要写书评

暂无评论

End-to-End Verification of Information-Flow Security for C and Assembly Programs

引用

acm sigplan NOTICES 2016年第6期51卷 648-664页

作者： Costanzo, David Shao, Zhong Gu, Ronghui Yale Univ New Haven CT 06520 USA

Protecting the confidentiality of information manipulated by a computing system is one of the most important challenges facing today's cybersecurity community. A promising step toward conquering this challenge is to formally verify that the end-to-end behavior of the computing system really satisfies various information-flow policies. Unfortunately, because today's system software still consists of both C and assembly programs, the end-to-end verification necessarily requires that we not only prove the security properties of individual components, but also carefully preserve these properties through compilation and cross-language linking. In this paper, we present a novel methodology for formally verifying end-to-end security of a software system that consists of both C and assembly programs. We introduce a general definition of observation function that unifies the concepts of policy specification, state indistinguishability, and whole-execution behaviors. We show how to use different observation functions for different levels of abstraction, and how to link different security proofs across abstraction levels using a special kind of simulation that is guaranteed to preserve state indistinguishability. To demonstrate the effectiveness of our new methodology, we have successfully constructed an end-to-end security proof, fully formalized in the Coq proof assistant, of a nontrivial operating system kernel (running on an extended CompCert x86 assembly machine model). Some parts of the kernel are written in C and some are written in assembly;we verify all of the code, regardless of language.

关键词： Verification Security Reliability languages design Information Flow Control Security Policy Specification Security-Preserving Simulation Program Verification Certified OS Kernels

来源：评论

学校读者我要写书评

暂无评论

Scannerless NSLR(1) parsing of programming languages

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 170-178页

作者： Salomon, Daniel J. Cormack, Gordon V. Univ of Waterloo Canada

The disadvantages of traditional two-phase parsing (a scanner phase preprocessing input for a parser phase) are discussed. We present metalanguage enhancements for context-free grammars that allow the syntax of programming languages to be completely described in a single grammar. The enhancements consist of two new grammar rules, the exclusion rule, and the adjacency-restriction rule. We also present parser construction techniques for building parsers from these enhanced grammars, that eliminate the need for a scanner phase.

关键词： Computer Operating Systems

来源：评论

学校读者我要写书评

暂无评论

Experiences creating a portable Cedar

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 322-329页

作者： Atkinson, Russ Demers, Alan Hauser, Carl Jacobi, Christian Kessler, Peter Weiser, Mark Xerox PARC United States

Cedar is the name for both a language and an environment in use in the Computer Science Laboratory at Xerox PARC since 1980. The Cedar language is a superset of Mesa, the major additions being garbage collection and runtime types. Neither the language nor the environment was originally intended to be portable, and for many years ran only on D-machines at PARC and a few other locations in Xerox. We recently re-implemented the language to make it portable across many different architectures. We present a brief description of the Cedar language, our portability strategy for the compiler and runtime, our manner of making connections to other languages and the Unix operating system, and some measures of the performance of our 'Portable Cedar'.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Java™ on the bare metal of wireless sensor devices the squawk java virtual machine

Java™ on the bare metal of wireless sensor devices the squa...

引用

VEE 2006 - 2nd International conference on Virtual Execution Environments

作者： Simon, Doug Cifuentes, Cristina Cleal, Dave Daniels, John White, Derek Sun Microsystems Laboratories 16 Network Drive Menlo Park CA 94025 United States Sun Microsystems Laboratories Level 10 80 Albert Street Brisbane QLD 4000 Australia Syntropy Limited 2 Stambourne Way West Wickham Kent BR4 9NF United Kingdom Sun Microsystems Laboratories One Network Drive Burlington MA 01803 United States

The Squawk virtual machine is a small Java™ virtual machine (VM) written mostly in Java that runs without an operating system on a wireless sensor platform. Squawk translates standard class file into an internal pre-linked, position independent format that is compact and allows for efficient execution of bytecodes that have been placed into a read-only memory. In addition, Squawk implements an application isolation mechanism whereby applications are represented as object and are therefore treated as first class objects (i.e., they can be reified): Application isolation also enables Squawk to run multiple applications at once with all immutable state being shared between the applications. Mutable state is not shared. The combination of these features reduce the memory footprint of the VM, making it ideal for deployment on small devices. Squawk provides a wireless API that allows developers to write applications for wireless sensor networks (WSNs), this API is an extension of the generic connection framework (GCF). Authentication of deployed files on the wireless device and migration of applications between devices is also performed by the VM. This paper describes the design and implementation of the Squawk VM as applied to the Sun™ Small Programmable Object Technology (SPOT) wireless device;a device developed at Sun Microsystems Laboratories for experimentation with wireless sensor and actuator applications.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Hybrid Context-Sensitivity for Points-To Analysis 13

Hybrid Context-Sensitivity for Points-To Analysis

引用

acm sigplan conference on programming language design and implementation

作者： George Kastrinis Yannis Smaragdakis Department of Informatics University of Athens

ISBN: (纸本)9781450320146

Context-sensitive points-to analysis is valuable for achieving high precision with good performance. The standard flavors of context-sensitivity are call-site-sensitivity (kCFA) and object-sensitivity. Combining both flavors of context-sensitivity increases precision but at an infeasibly high cost. We show that a selective combination of call-site- and object-sensitivity for Java points-to analysis is highly profitable. Namely, by keeping a combined context only when analyzing selected language features, we can closely approximate the precision of an analysis that keeps both contexts at all times. In terms of speed, the selective combination of both kinds of context not only vastly outperforms non-selective combinations but is also faster than a mere object-sensitive analysis. This result holds for a large array of analyses (e.g., 1-object-sensitive, 2-object-sensitive with a context-sensitive heap, type-sensitive) establishing a new set of performance/precision sweet spots.

关键词： Points-to analysis Context-sensitivity Object-sensitivity Type-sensitivity Algorithms languages Performance language algorithms Analysis Flavoring Agents Precision language feature

来源：评论

学校读者我要写书评

暂无评论

XMem: Type-safe, transparent, shared memory for cross-runtime communication and coordination

引用

acm sigplan NOTICES 2008年第6期43卷 327-338页

作者： Wegiel, Michal Krintz, Chandra Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

Developers commonly build contemporary enterprise applications using type-safe, component-based platforms, such as J2EE, and architect them to comprise multiple tiers, such as a web container, application server, and database engine. Administrators increasingly execute each tier in its own managed runtime environment (MRE) to improve reliability and to manage system complexity through the fault containment and modularity offered by isolated MRE instances. Such isolation, however, necessitates expensive cross-tier communication based on protocols such as object serialization and remote procedure calls. Administrators commonly co-locate communicating MREs on a single host to reduce communication overhead and to better exploit increasing numbers of available processing cores. However, state-of-the-art MREs offer no support for more efficient communication between co-located MREs, while fast inter-process communication mechanisms, such as shared memory, are widely available as a standard operating system service on most modern platforms. To address this growing need, we present the design and implementation of XMem - type-safe, transparent, shared memory support for co-located MREs. XMem guarantees type-safety through coordinated, parallel, multi-process class loading and garbage collection. To avoid introducing any level of indirection, XMem manipulates virtual memory mapping. In addition, object sharing in XMem is fully transparent: shared objects are identical to local objects in terms of field access, synchronization, garbage collection, and method invocation, with the only difference being that shared-to-private pointers are disallowed. XMem facilitates easy integration and use by existing communication technologies and software systems, such as RMI, JNDI, JDBC, serialization/XML, and network sockets. We have implemented XMem in the open-source, production-quality HotSpot Java Virtual Machine. Our experimental evaluation, based on core communication technologies un

关键词： design experimentation languages management measurement performance interprocess communication managed runtimes shared memory transparent type-safe garbage collection synchronization class loading parallel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：