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

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

来源：评论

学校读者我要写书评

暂无评论

EventHurdle: Supporting designers' exploratory interaction prototyping with gesture-based sensors 13

EventHurdle: Supporting designers' exploratory interaction p...

引用

31st Annual CHI conference on Human Factors in Computing Systems: Changing Perspectives, CHI 2013

作者： Kim, Ju-Whan Nam, Tek-Jin CIDR Lab Department of Industrial Design KAIST 291 Daehak-ro Yuseong-gu Daejeon 305-701 Korea Republic of

ISBN: (纸本)9781450318990

Prototyping of gestural interactions in the early phase of design is one of the most challenging tasks for designers without advanced programming skills. Relating users' input from gesture-based sensor values requires a great deal of effort on the designer's part and disturbs their reflective and creative thinking. To deal with this problem, we present EventHurdle, a visual gesture authoring tool to support designers' explorative prototyping. It supports remote gestures from a camera, handheld gestures with physical sensors, and touch gestures by utilizing touch screens. EventHurdle allows designers to visually define and modify gestures through interaction workspace and graphical markup language with hurdles. Because the created gestures can be integrated into a prototype as programming code and automatically recognized, designers do not need to pay attention in sensor-related implementation. Two user studies and a recognition test are reported to discuss the acceptance and implications of explorative prototyping tools for designers. Copyright © 2013 acm.

关键词： Touch screens

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

It''s Alive! Continuous Feedback in UI programming 13

It''s Alive! Continuous Feedback in UI Programming

引用

acm sigplan conference on programming language design and implementation

作者： Sebastian Burckhardt Peli de Halleux Michal Moskal Manuel Fahndrich Sean McDirmid Nikolai Tillmann Jun Kato Microsoft Research The University of Tokyo

ISBN: (纸本)9781450320146

Live programming allows programmers to edit the code of a running program and immediately see the effect of the code changes. This tightening of the traditional edit-compile-run cycle reduces the cognitive gap between program code and execution, improving the learning experience of beginning programmers while boosting the productivity of seasoned ones. Unfortunately, live programming is difficult to realize in practice as imperative languages lack well-defined abstraction boundaries that make live programming responsive or its feedback comprehensible. This paper enables live programming for user interface programming by cleanly separating the rendering and non-rendering aspects of a UI program, allowing the display to be refreshed on a code change without restarting the program. A type and effect system formalizes this separation and provides an evaluation model that incorporates the code update step. By putting live programming on a more formal footing, we hope to enable critical and technical discussion of live programming systems.

关键词： Live programming Graphical User Interface languages Human Factors

来源：评论

学校读者我要写书评

暂无评论

Petri-net evaluation using APL2

Petri-net evaluation using APL2

引用

proceedings of the International conference on APL

作者： Willhoft, Robert G. IBM Corp Endicott United States

ISBN: (纸本)0897914775

A Petri net is a graphical and mathematical modeling tool useful in the analysis of concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic systems. In addition, interest in Petri nets is increasing in the software community to model the behavior of parallel computer programs. The introduction of timed Petri nets allows system or program performance to be estimated as well. This paper begins with a general discussion, including definitions, for both ordinary and timed Petri nets. Several analysis tools are outlined for ordinary and timed Petri nets including analysis of the incidence matrix, coverability tree, firing diagram, and the GRID (Graph of Reachable Instantaneous Descriptions). This paper then introduces a method for representing Petri nets in APL2 and defines an easy input method. An APL2 implementation of each of the above analysis tools is given. These functions are described in detail as to their operation. Several examples of their use are given including examples of deadlock detection and performance estimation.

关键词： APL (programming language)

来源：评论

学校读者我要写书评

暂无评论

Ada as a parallel language for high performance computers: Experience and results

Ada as a parallel language for high performance computers: E...

引用

conference on TRI-ADA 1990

作者： Collard, Philippe Goforth, Andre Marquardt, Matthew TeleSoft 5959 Cornerstone Court West San Diego CA 92121-9891 United States NASA/Ames Research Center Information Science Division MS 244-4 Moffett Field CA 94035 United States Recom Technologies MS 244-4 Moffett Field CA 94035 United States California Space Institute University of California San Diego CA United States

ISBN: (纸本)0897914090

This paper reports on experimental results which demonstrate the potential of Ada as a parallel programming language for large scale, scientific applications on high performance multiprocessors. Reported performance results show a linear speed-up of a factor of 10 over 10 processors. A linear speed-up performance over a larger number of processors is indicated given the availability of higher performance configurations and larger data sets. The results were obtained for an Ada program written to take advantage of the multiprocessing of the Sequent Balance and Symmetry computer series, which performed the classification of stars in a large infrared astronomical database, (IRAS). The classification procedure and algorithms, which were developed at NASA Ames Research Center and were originally coded in a Lisp program called AutoClassII, use an approximate Bayesian criterion. The procedure has been applied to a wide variety of classification domains besides astronomy. Through its tasking structure, Ada possesses the intrinsic ability to support parallel processing at the language level;however, much remains to be learned about the implementation of concurrent software systems in Ada on multiprocessor architectures. The paper provides a case study of the design issues faced in the attempt to exploit the inherent concurrency of the procedure and algorithms in the implementation of a portable version of AutoClassII in Ada for benchmarking multiprocessors. ©1990 acm.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language

引用

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

作者： Chambers, Craig Ungar, David Stanford Univ United States

Dynamically-typed object-oriented languages please programmers, but their lack of static type information penalizes performance. Our new implementation techniques extract static type information from declaration-free programs. Our system compliles several copies of a given procedure, each customized for one receiver type, so that the type of the receiver is bound at compile time. The compiler predicts types that are statically unknown but likely, and inserts run-time type tests to verify its predictions. It splits calls, compiling a copy on each control path, optimized to the specific types on that path. Coupling these new techniques with compile-time message lookup, aggressive procedure inlining, and traditional optimizations has doubled the performance of dynamically-typed object-oriented languages.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

RTL-datapath verification using integer linear programming 7

RTL-datapath verification using integer linear programming

引用

7th Asia and South Pacific design Automation conference/15th International conference on VLSI design

作者： Brinkmann, R Drechsler, R Siemens AG Corp Technol D-81370 Munich Germany

ISBN: (纸本)0769514413

Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most designs are described in a hardware description language (HDL), like Verilog or VHDL, usually, this problem is solved in the Boolean domain, using Boolean solvers. These engines often show a poor performance for data path verification. Instead of solving the problem at the bit-level, a method is proposed to transform conjunctions of bitvector equalities and inequalities into sets of integer linear arithmetic constraints. It is shown that it is possible to correctly model the modulo semantics of HDL operators as linear constraints. Integer linear constraint solvers are used as a decision procedure for bitvector arithmetic. In the implementation we focus on verification of arithmetic properties of Verilog-HDL designs. Experimental results show considerable performance advantages over high-end Boolean SAT solver approaches. The speed-up on the benchmarks studied is several orders of magnitude.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Matrix operations over integral domains using nested APL 92

Matrix operations over integral domains using nested APL

引用

proceedings of the International conference on APL

作者： Willhoft, Robert G. IBM Corp Endicott NY United States

ISBN: (纸本)0897914775

This paper deals with the use of APL to solve matrix theory problems with elements that are members of an integral domain. Two types of integral domains are used to illustrate the methods developed in this paper, integers (Z) and polynomials with real coefficients (Re[X]). However, the method of approach can be easily generalized to include other integral domains. APL2, due to its generalized data representations and rich functional semantics, was chosen to implement the solution to this problem. For each integral domain presented, a method of data representation is developed, and implementations of the necessary `primitive' functions (Addition, Multiplication, Division, and Comparison) are given. Finally, this newly developed system of functions and data representation is used to solve several of the most common Matrix Algebra problems. A simple recursive determinant and an implementation of Euclid's Greatest Common Divisor Algorithm are presented. Then, with these building blocks, a general algorithm for finding Smith's Canonical form and an algorithm to find the Invariant Factors are presented.

关键词： APL (programming language)

来源：评论

学校读者我要写书评

暂无评论

Formal system design based on the synchrony hypothesis, functional models, and skeletons

Formal system design based on the synchrony hypothesis, func...

引用

12th International conference on VLSI design

作者： Sander, I Jantsch, A Royal Inst Technol Dept Elect S-10044 Stockholm Sweden

ISBN: (纸本)0769500137

Formal approaches to HW and system design have not been generally adopted, because designers often view the modelling concepts in these approaches as unsuitable for their problems. Moreover;they are frequently on a too high abstraction level to allow for efficient synthesis with today's techniques. We address this problem with a modelling method, which is strictly formal and based on formal semantics, a pure functional language, and the synchrony hypothesis. But the use of skeletons in conjunction with a proper computational model allows to associate a direct hardware interpretation. In particular we use (1) the synchrony hypothesis and a timed signal model to provide a high abstraction for communication at the system level. This facilitates efficient modelling and design space exploration at the functional level, because the designer is Hot concerned with complex communication mechanisms, mid functionality can easily be moved front one block to another: To bridge the gap bent een an elegant and abstract functional model and the details of an implementation we use (2) skeletons to encapsulate primitive structures, such as FSMs, buffers, computation units, etc, irt a purely functional way.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：