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

作者： Victor Allombert UNIVERSITE PARIS-EST

学位级别：博士

From personal computers using an increasing number of cores, to supercomputers having mil- lions of computing units, parallel architectures are the current standard. The high performance architectures are usually referenced to as hierarchical, as they are composed from clusters of multi-processors of multi-cores. programming such architectures is known to be notoriously difficult. Writing parallel programs is, most of the time, difficult for both the algorithmic and the implementation phase. To answer those concerns, many structured models and languages were proposed in order to increase both expressiveness and efficiency. Among other models, multi-bsp is a bridging model dedicated to hierarchical architecture that ensures efficiency, execution safety, scalability and cost prediction. It is an extension of the well known bsp model that handles flat architectures. In this thesis we introduce the multi-ml language, which allows programming multi-bsp algorithms "a la ml" and thus, guarantees the properties of the multi-bsp model and the ex- ecution safety, thanks to a ml type system. To deal with the multi-level execution model of multi-ml, we defined formal semantics which describe the valid evaluation of an expression. To ensure the execution safety of multi-ml programs, we also propose a typing system that preserves replicated coherence. An abstract machine is defined to formally describe the evalua- tion of a multi-ml program on a multi-bsp architecture. An implementation of the language is available as a compilation toolchain. It is thus possible to generate an efficient parallel code from a program written in multi-ml and execute it on any hierarchical machine.

关键词： Parallel programming multi-bsp ML programming language Parallel execution safety

来源：评论

学校读者我要写书评

暂无评论

Democratizing computational tools for interaction designers

Democratizing computational tools for interaction designers

引用

2010 IEEE Symposium on Visual languages and Human-Centric Computing, VL/HCC 2010

作者： Oney, Stephen Human-Computer Interaction Institute School of Computer Science Carnegie Mellon University Pittsburgh PA 15213 United States

I am creating a new programming language and editor that is aimed towards authoring interactive behaviors. This language is intended to allow more interaction designers to write their own interactive applications. Thi... 详细信息

ISBN: (纸本)9780769542065

关键词： authoring systems computational tools interaction designers interactive behavior authoring programming editor programming language programming languages

来源：评论

学校读者我要写书评

暂无评论

Allegories for learning abstract programming concepts 14

Allegories for learning abstract programming concepts

引用

10th Annual International Conference on International Computing Education Research, ICER 2014

作者： Hidalgo-Céspedes, Jeisson Universidad de Costa Rica San José 2060 Costa Rica

ISBN: (纸本)9781450327558

Constructivism theory states that learning is unavoidably done through association of new concepts with existing ones. Although programming concepts are abstract metaphors of some colloquial concepts, they seem to be not enough to overcome learning difficulties. We hypothesize that interrelated systems of metaphors (allegories) of abstract programming concepts can ease the association process and improve student learning. Our research introduces allegoric development environments and proposes to experimentally evaluate their effects on learning of programming concepts reported as difficult by students. Copyright © 2014 ACM.

关键词： learning allegory metaphor programming language

来源：评论

学校读者我要写书评

暂无评论

Fast and Effective Approaches for Verifying and Debugging Concurrent Programs

Fast and Effective Approaches for Verifying and Debugging Co...

引用

作者： Huang, Shiyou Texas A&M University

学位级别：Ph.D., Doctor of Philosophy

Concurrent programs are ubiquitous, from the high-end servers to personal machines, due to the fact of multi-core hardware. Unfortunately, it is difficult to write correct concurrent programs. Stateless Model Checking (SMT) and Deterministic Replay are powerful techniques for systematic testing and reproducing concurrent failures. However, it is challenging to develop efficient and practical SMT and bug reproduction systems due to the exponentially large thread interleaving space which can be exacerbated when it comes to relaxed memory models. In this work, I introduce my research efforts to address the challenges in developing fast and effective SMT and deterministic replay techniques. I present a new model checking technique based on maximal causality reduction for verifying concurrent programs under different memory models. I also optimize the model checker by using static dependency analysis to reduce the constraints size and introducing a new equivalence for checking the seed interleavings, which I call switch equivalence to further reduce the redundant *** debug heisenbugs more efficiently, I presents a new concurrency failure reproduction technique, H3, that enables reproducing concurrency bugs in production runs on commercial off-the-shelf hardware for the first time. H3 integrates the hardware control flow tracing capability provided in recent Intel processors, Processor Tracing (PT), with symbolic constraint analysis. Compared to a state-of-the-art solution, CLAP, this integration allows H3 to reproduce failures with much lower runtime overhead and much more compact control-flow trace. Moreover, it allows us to develop a highly effective core-based constraint reduction technique that reduces the complexity of the generated symbolic constraints from exponential in the trace size to exponential in the number of cores.

关键词： Software verification Concurrency debugging programming language Record and Replay Software engineering Stateless Model Checking

来源：评论

学校读者我要写书评

暂无评论

Initialization problems for Java

引用

Software-Concepts and Tools 2000年第4期19卷 175-178页

作者： Börger, Egon Schulte, Wolfram Università di Pisa Dipartimento di Informatica I-56125 Pisa Italy Universität Ulm Fakultät für Informatik D-89069 Ulm Germany

We reveal a grey area in the specification of Java and of its implementation through the Java Virtual Machine (JVM): the treatment of initialization of classes and interfaces. We report the results of our experiments with different implementations of Java, which confirm the theoretical prediction of our work on mathematical models for Java [4] and the JVM [3], namely that the designers of Java and the JVM have used notions of initialization which do not match and which afflict the portability of Java programs. We also show that concurrent initialization may deadlock and that various current Java compilers violate the initialization semantics through standard optimization techniques. © 2000 Springer-Verlag.

关键词： Compiler Java programming language Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Mastering High Performance with Kotlin 1

引用

丛书名： []

2018年

作者： Igor Kucherenko

ISBN: (数字)9781788998352

ISBN: (纸本)9781788996648

Find out how to write Kotlin code without overhead and how to use different profiling tools and bytecode viewer to inspect expressions of Kotlin language. Key Features Apply modern Kotlin features to speed up processing and implement highly efficient and reliable codes. Learn memory optimization, concurrency, multi-threading, scaling, and caching techniques to achieve high performance. Learn how to prevent unnecessary overhead and use profiling tools to detect performance issues. Book Description The ease with which we write applications has been increasing, but with it comes the need to address their performance. A balancing act between easily implementing complex applications and keeping their performance optimal is a present-day requirement In this book, we explore how to achieve this crucial balance, while developing and deploying applications with Kotlin. The book starts by analyzing various Kotlin specifcations to identify those that have a potentially adverse effect on performance. Then, we move on to monitor techniques that enable us to identify performance bottlenecks and optimize performance metrics. Next, we look at techniques that help to us achieve high performance: memory optimization, concurrency, multi threading, scaling, and caching. We also look at fault tolerance solutions and the importance of logging. We'll also cover best practices of Kotlin programming that will help you to improve the quality of your code base. By the end of the book, you will have gained some insight into various techniques and solutions that will help to create high-performance applications in the Kotlin environment What you will learn Understand the importance of high performance Learn performance metrics Learn popular design patterns currently being used in Kotlin Understand how to apply modern Kotlin features to data processing Learn how to use profling tools Discover how to read bytecode Learn to perform memory optimizations Uncover approaches to the multithreading envi

关键词： Kotlin Android app development programming language Kotlin language High performance

来源：评论

学校读者我要写书评

暂无评论

Guarantees in Program Synthesis

Guarantees in Program Synthesis

引用

作者： Hu, Qinheping The University of Wisconsin - Madison

学位级别：Ph.D., Doctor of Philosophy

Program synthesis is the classic problem of automatically finding a program in some search space that satisfies a given correctness specification. Program synthesis significantly impacts software development because it reduces programmers’ efforts to produce programs with daunting detail. Unfortunately, it is usually not enough to produce any correct solution in program synthesis. For many program synthesis problems, there are multiple correct solutions in the search space, but some of them are not expected because, for example, their sizes are too large to be read. Besides, for synthesis problems that admit no solution—we call such synthesis problems unrealizable—, most of the enumeration-based synthesizers do not terminate. Therefore, besides correctness and efficiency, one may want to ask two more questions about a synthesis solver: Can the solver provide a good solution when there are multiple ones? Can the solver provide a proof when there is no solution? In this dissertation, we introduce two types of guarantees in program synthesis: quantitative objectives and proof of unrealizability. First, we present QSyGuS, a synthesis framework extending syntax-guided synthesis (SyGuS) with quantitative syntactic objectives, which allow users to prefer some solutions over others, and an algorithm Quasi of solving QSyGuS problems. Quasi reduces QSyGuS problems to SyGuS problems and solves the reduced problems by off-the-shelf solvers. Second, we introduce two algorithms Nope and Nay of proving the unrealizability of SyGuS problems. Nope is based on the idea of encoding an unrealizable problem as a verification problem. Nay proves the unrealizability with grammar-flow analysis. Finally, we focus on a particular kind of quantitative objectives: asymptotic resource usage. We develop a type-based algorithm SynPlexity for solving synthesis problems with asymptotic resource usage.

关键词： Formal method Program synthesis programming language

来源：评论

学校读者我要写书评

暂无评论

Accelerating Multilingual Applications with In-memory Array Sharing

Accelerating Multilingual Applications with In-memory Array ...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Nozawa, Masanobu Imamura, Satoshi Kono, Kenji Keio University Japan Computing Laboratory Fujitsu Limited Japan

ISBN: (纸本)9798350324457

Data analysis applications are recently developed by combining multiple programming languages to utilize the advantage of each of them. Such applications are called multilingual applications and can accelerate data-intensive tasks such as data preprocessing and machine learning. However, multilingual applications require time-consuming serialization and deserialization (S/D) processes to exchange data between different programming languages. Although state-of-the-art mechanisms have developed to reduce the time overheads of S/D processes, the overheads are still not trivial due to memory copy of shared data. In this paper, for multilingual applications combining Python and Julia, we propose an in-memory array sharing method that serializes/deserializes only lightweight metadata and directly shares heavy data arrays in a shared memory space. It completely eliminates memory copy of numeric arrays by using a common in-memory metadata format between Python and Julia. Our evaluation shows that the proposed method reduces the execution times of three multilingual machine learning applications by 40.8% to 44.5% compated to a state-of-the-art S/D mechanism. Consequently, it brings the benefit of combining Python and Julia to develop machine learning applications. In addition, we demonstrate that the proposed method has a high scalability to the larger amount of data. © 2023 IEEE.

关键词： data serialization and deserialization multilingual applications programming language

来源：评论

学校读者我要写书评

暂无评论

Mechanized Reasoning about "How" Using Functional Programs and Embeddings

Mechanized Reasoning about "How" Using Functional Programs a...

引用

作者： Li, Yao University of Pennsylvania

学位级别：Ph.D., Doctor of Philosophy

Embedding describes the process of encoding a program's syntax and/or semantics in another language—typically a theorem prover in the context of mechanized reasoning. Among different embedding styles, deep embeddings are generally preferred as they enable the most faithful modeling of the original language. However, deep embeddings are also the most complex, and working with them requires additional effort. In light of that, this dissertation aims to draw more attention to alternative styles, namely shallow and mixed embeddings, by studying their use in mechanized reasoning about programs' properties that are related to "how". More specifically, I present a simple shallow embedding for reasoning about computation costs of lazy programs, and a class of mixed embeddings that are useful for reasoning about properties of general computation patterns in effectful programs. I show the usefulness of these embedding styles with examples based on real-world applications.

关键词： Coq Embedding Formal verification Functional programming Mechanized reasoning programming language

来源：评论

学校读者我要写书评

暂无评论

An algorithm to calculate the diameter of triple-loop networks TL(N;1,s,s+2)

An algorithm to calculate the diameter of triple-loop networ...

引用

International Conference on Internet Technology and Applications, ITAP 2010

作者： Tai, Wei-Peng Fang, Mu-Yun School of the Earth Sciences and Resources China University of Mining and Technology XuzhouJiangsu 221008 China Dept. of Computer Science Anhui University of Technology Ma'anshan Anhui 243002 Dept. of Computer Science University of Science and Technology of China Heifei Anhui 230027

ISBN: (纸本)9781424451432

An Algorithm to caculate the diameter of triple-loop networks TL(N;1,s,s+2) is presented. C# serving as programming language and SQL Server 2000 serving as database are used to execute the algrithm. The diameter of such family of triple-loop networks whose N is given at random and s varied from 2 to N-3, can be caculated by simulating the hyper-L shape tiles. The diameter of such family of triple-loop networks has such characters: maximum values, minimum values, symmetry. ©2010 IEEE.

关键词： C# serving SQL SQL server diameter calculation hyper-L shape tiles local area networks parallel processing programming language triple loop networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：