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

Frontiers in Education (FIE) conference

作者： R.L. Shackelford R.J. LeBlanc Georgia Institute of Technology Atlanta GA USA

In this paper, we describe a two course sequence that has been taught to majors in computer science and a variety of other disciplines. The first course is called "Introduction to Computing"; the second course is "Introduction to programming". The "Computing" course is a ten-week course that includes material on the following: the "computing perspective" (the algorithmic model as a way of thinking); foundational concepts underlying program design and implementation, including: algorithmic methods, static and dynamic data structures, and design using abstraction; fundamental notions of algorithm analysis and computability; and use of application tools such as e-mail, Web browsers, word processors, spreadsheets, databases, and equation solvers. Building on this foundational pre-programming material, students in the "programming" course are able to learn rapidly the skills in program design, implementation, and debugging necessary to solve computational problems in a high-level programming language. We emphasize effective use of abstraction and the acquisition of software development skills that are language independent. Our experience with these courses has convinced us that it is possible to introduce the conceptual foundations of computer science to beginning students in a way that both engages them and gives them a basis for learning advanced ways to solve problems using computing, either via programming or through use of modern, highly-programmable commercial applications.

关键词： Computer science Algorithm design and analysis Data structures Electronic mail Databases Equations Buildings Debugging Computer languages programming

来源：评论

学校读者我要写书评

暂无评论

Practical data breakpoints: design and implementation 93

Practical data breakpoints: design and implementation

引用

proceedings of the acm sigplan 1993 conference on programming language design and implementation

作者： Robert Wahbe Steven Lucco Susan L. Graham

ISBN: (纸本)9780897915984

A data breakpoint associates debugging actions with programmer-specified conditions on the memory state of an executing program. Data breakpoints provide a means for discovering program bugs that are tedious or impossible to isolate using control breakpoints alone. In practice, programmers rarely use data breakpoints, because they are either unimplemented or prohibitively slow in available debugging software. In this paper, we present the design and implementation of a practical data breakpoint facility.A data breakpoint facility must monitor all memory updates performed by the program being debugged. We implemented and evaluated two complementary techniques for reducing the overhead of monitoring memory updates. First, we checked write instructions by inserting checking code directly into the program being debugged. The checks use a segmented bitmap data structure that minimizes address lookup complexity. Second, we developed data flow algorithms that eliminate checks on some classes of write instructions but may increase the complexity of the remaining *** evaluated these techniques on the SPARC using the SPEC benchmarks. Checking each write instruction using a segmented bitmap achieved an average overhead of 42%. This overhead is independent of the number of breakpoints in use. Data flow analysis eliminated an average of 79% of the dynamic write checks. For scientific programs such the NAS kernels, analysis reduced write checks by a factor of ten or more. On the SPARC these optimizations reduced the average overhead to 25%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable cross-module optimization 98

Scalable cross-module optimization

引用

proceedings of the acm sigplan 1998 conference on programming language design and implementation

作者： Andrew Ayers Stuart de Jong John Peyton Richard Schooler Hewlett-Packard Massachusetts Language Laboratory 300 Apollo Drive Chelmsford MA

ISBN: (纸本)9780897919876

Large applications are typically partitioned into separately compiled modules. Large performance gains in these applications are available by optimizing across module boundaries. One barrier to applying crossmodule optimization (CMO) to large applications is the potentially enormous amount of time and space consumed by the optimization *** describe a framework for scalable CMO that provides large gains in performance on applications that contain millions of lines of code. Two major techniques are described. First, careful management of in-memory data structures results in sub-linear memory occupancy when compared to the number of lines of code being optimized. Second, profile data is used to focus optimization effort on the performance-critical portions of applications. We also present practical issues that arise in deploying this framework in a production environment. These issues include debuggability and compatibility with existing development tools, such as make. Our framework is deployed in Hewlett-Packard's (HP) UNIX compiler products and speeds up shipped independent software vendors' applications by as much as 71%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using wait-free synchronization in the design of distributed applications

Using wait-free synchronization in the design of distributed...

引用

proceedings of the International conference on Parallel and Distributed Processing Techniques and Applications

作者： Berrios, Joseph S. Bermudez, Manuel E. Sch. of Elec. Eng. and Comp. Sci. University of Central Florida P.O. Box 162450 Orlando FL 32816-2450 United States Dept. Comp. and Info. Sci. and Eng. University of Florida E301 CSE P.O. Box 116120 Gainesville FL 32611-6120 United States

ISBN: (纸本)1892512416

Wait-free synchronization has been recognized in the literature as an effective concurrent programming technique. The concurrent programming community, however, has been slow to adopt this technique. This paper addresses the practical application of wait-free synchronization in the design of distributed applications. In this paper we present an implementation of a server that uses wait-free synchronization. The resulting code is more easily seen to be fault tolerant. The performance analysis of the wait-free synchronization server outperformed a server that uses traditional locking techniques. This practical demonstration of the benefits of wait-free synchronization should help foster its adoption in the development of distributed applications.

关键词： Client server computer systems

来源：评论

学校读者我要写书评

暂无评论

acm '76 - proceedings OF THE ANNUAL conference.

引用

1976年

作者： Anon

This symposium, held in Houston, Texas from October 20 to 22, 1976 contains 105 papers. Topics covered include: Theoretical results in compiler design and implementation; Computer system and network architecture; Recent developments in natural language understanding; Multinational information systems; Data base security; computers in medicine; Computer science education; Based learning and communication environments; Algorithm engineering; Computer architecture; Operating systems for minicomputers; Minicomputer and microcomputer applications; Data base systems organization and optimization; Operating system design; programming languages and their processors; Standardization in simulation; and Program testing.

关键词： COMPUTERS

来源：评论

学校读者我要写书评

暂无评论

Parasitic methods: an implementation of multi-methods for Java 97

Parasitic methods: an implementation of multi-methods for Ja...

引用

proceedings of the 12th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： John Boyland Giuseppe Castagna Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh PA CNRS LIENS École Normale Supérieure 45 rue d'Ulm 75005 Paris France

ISBN: (纸本)9780897919081

In an object-oriented programming language, method selection is (usually) done at run-time using the class of the receiver. Some object-oriented languages (such as CLOS) have multi-methods which comprise several methods selected on the basis of the runtime classes of all the parameters, not just the receiver. Multi-methods permit intuitive and typesafe definition of binary methods such as structural equality, set inclusion and matrix multiplication, just to name a few. Java as currently defined does not support multimethods. This paper defines a simple extension to Java that enables the writing of "encapsulated" multi-methods through the use of parasitic methods, methods that "attach" themselves to other methods. Encapsulated multi-methods avoid some of the modularity problems that, arise with fully general multi-methods. Furthermore, this. extension yields for free both covariant and contravariant specialization of methods (besides Java's current invariant specialization).Programs using this extension. can be translated automatically at the source level into programs that do not; they are modular, type-safe, and allow separate compilation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Object views: language support for intelligent object caching in parallel and distributed computations 99

Object views: language support for intelligent object cachin...

引用

proceedings of the 14th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Ilya Lipkind Igor Pechtchanski Vijay Karamcheti Courant Institute of Mathematical Sciences New York University 715 Broadway 7th Floor New York NY

ISBN: (纸本)9781581132380

Object-based parallel and distributed applications are becoming increasingly popular, driven by the programmability advantages of component technology and a flat shared-object space. However, the flat shared-object space introduces a performance challenge: applications that rely on the transparent coherent caching of objects achieve high performance only on tightly coupled parallel machines. In distributed environments, the overheads of object caching force application designers to choose other solutions. Consequently, most applications sacrifice programmability, relying instead on either the explicit coherence management of cached objects, or on vastly different middleware abstractions such as multicast and *** this paper, we describe object views — language support for efficient object caching in parallel and distributed computations. Object views specify restrictions on how computation threads can use an object, providing the underlying implementation with information about the potential side effects of object access, and thereby enabling construction of scalable, low-overhead caching protocols customized to application requirements. We present extensions to the Java programming language for expressing object views, and describe the design and implementation of a translator and run-time system for executing view-augmented Java programs on a distributed cluster of workstations. Experimental results based on a shared whiteboard application demonstrate that view-based object caching can achieve performance superior to multicast- and event-based implementations, while retaining essentially a shared object interface.

关键词： object representation distributed objects object caching views collaborative applications shared objects Java

来源：评论

学校读者我要写书评

暂无评论

language support for lightweight transactions 03

Language support for lightweight transactions

引用

proceedings of the 18th annual acm sigplan conference on Object-oriented programing, systems, languages, and applications

作者： Tim Harris Keir Fraser University of Cambridge Computer Laboratory Cambridge UK

ISBN: (纸本)9781581137125

Concurrent programming is notoriously difficult. Current abstractions are intricate and make it hard to design computer systems that are reliable and scalable. We argue that these problems can be addressed by moving to a declarative style of concurrency control in which programmers directly indicate the safety properties that they require. In our scheme the programmer demarks sections of code which execute within lightweight software-based transactions that commit atomically and exactly once. These transactions can update shared data, instantiate objects, invoke library features and so on. They can also block, waiting for arbitrary boolean conditions to become true. Transactions which do not access the same shared memory locations can commit concurrently. Furthermore, in general, no performance penalty is incurred for memory accesses outside *** present a detailed design of this proposal along with an implementation and evaluation. We argue that the resulting system (i) is easier for mainstream programmers to use, (ii) prevents lock-based priority-inversion and deadlock problems and (iii) can offer performance advantages.

关键词： transactions conditional critical regions concurrency non-blocking systems

来源：评论

学校读者我要写书评

暂无评论

Java as a specification language for hardware-software systems 97

Java as a specification language for hardware-software syste...

引用

proceedings of the 1997 IEEE/acm international conference on Computer-aided design

作者： Rachid Helaihel Kunle Olukotun Computer Systems Laboratory Stanford University Stanford CA

ISBN: (纸本)9780818682001

The specification language is a critical component of the hardware-software co-design process since it is used for functional validation and as a starting point for hardware- software partitioning and co-synthesis. This paper pro poses the Java programming language as a specification language for hardware-software systems. Java has several characteristics that make it suitable for system specification. However, static control and dataflow analysis of Java programs is problematic because Java classes are dynamically linked. This paper provides a general solution to the problem of statically analyzing Java programs using a technique that pre-allocates most class instances and aggressively resolve memory aliasing using global analysis. The output of our analysis is a control dataflow graph for the input specification. Our results for sample designs show that the analysis can extract fine to coarse-grained concurrency for subsequent hardware-software partitioning and co-synthesis steps of the hardware-software co- design process to exploit.

关键词： hardware-software co-design

来源：评论

学校读者我要写书评

暂无评论

A descriptive model for the design and implementation of computer systems 73

A descriptive model for the design and implementation of com...

引用

proceedings of the acm annual conference

作者： John Mazur

ISBN: (纸本)9781450374903

We postulate a general computing model and investigate the design and implementation of systems in the postulated environment. The model is drawn from our interpretation of the writings of John von Newmann 1 and others. Its central concept is an abstraction of the capability of all digital computers to modify cells contents that represent addresses of other cells. We discuss three formulations of the model; namely, a “programming language” formulation using vectors, pointers, and move operators, an “emulator” formulation extending the first formulation to include control structure and execution semantics, and a “mathematical” formulation. The proposed model is specifically intended for the interactive design and implementation of software (and also hardware) computer systems. The completeness and the hierarchial nature of the descriptions based on the model allow those descriptions to serve as simulation models and documentation for the complete system being described or for any well-defined part of the system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：