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

16th International Conference on Informatics in Schools - Situation, Evolution, and Perspectives (ISSEP)

作者： Scapin, Emanuele Pozza, Nicola Dalla Mirolo, Claudio ITT G Chilesotti I-36016 Thiene Italy Univ Udine I-33100 Udine Italy Lab CINI Informat & Scuola Rome Italy

ISBN: (纸本)9783031448997;9783031449000

Students' difficulties to learn concurrent programming are well known amongst Computer Science instructors. While in the International Computing Education community it is still up to debate the extent to which such topic should be included in pre-university curricula, based on our country's Ministerial guidelines for technical high schools with a specialization in Computer Science, students are expected to acquire key concurrent programming skills. With the aim of getting insights about the nature of students' difficulties, as well as to identify possible pedagogical approaches to be adopted by teachers, we have undertaken an investigation on students' perception, proficiency and self-confidence when dealing with concurrency and synchronization tasks. We then present the results of a preliminary study carried out by submitting a survey in a couple of representative high schools of our area. The survey includes subjective perception questions as well as small program comprehension tasks addressing students' understanding of thread synchronization. Moreover, we also analyze students' self-confidence in connection with their actual performance in such tasks. A total of 68 high school students were engaged in the survey. Our findings indicate that students' perception of self-confidence tends to weakly correlate to their actual performance, although more in general they express a low self-confidence level in relation to the topic. In particular, the results clearly show that the concept of thread synchronization is especially difficult to master for a large majority of them.

关键词： Informatics education programming learning High school Threads concurrent programming

来源：评论

学校读者我要写书评

暂无评论

The OpenMP Cluster programming Model 51

The OpenMP Cluster Programming Model

引用

51st International Conference on Parallel Processing (ICPP)

作者： Yviquel, Herve Pereira, Marcio Francesquini, Emilio Valarini, Guilherme Leite, Gustavo Rosso, Pedro Ceccato, Rodrigo Cusihualpa, Carla Dias, Vitoria Rigo, Sandro Souza, Alan Araujo, Guido Univ Campinas UNICAMP Campinas Brazil Petrobras SA Rio De Janeiro Brazil

ISBN: (纸本)9781450394451

Despite the various research initiatives and proposed programming models, efficient solutions for parallel programming in HPC clusters still rely on a complex combination of different programming models (e.g., OpenMP and MPI), languages (e.g., C++ and CUDA), and specialized runtimes (e.g., Charm++ and Legion). On the other hand, task parallelism has shown to be an efficient and seamless programming model for clusters. This paper introduces OpenMP Cluster (OMPC), a task-parallel model that extends OpenMP for cluster programming. OMPC leverages OpenMP's offloading standard to distribute annotated regions of code across the nodes of a distributed system. To achieve that it hides MPI-based data distribution and load-balancing mechanisms behind OpenMP task dependencies. Given its compliance with OpenMP, OMPC allows applications to use the same programming model to exploit intra- and internode parallelism, thus simplifying the development process and maintenance. We evaluated OMPC using Task Bench, a synthetic benchmark focused on task parallelism, comparing its performance against other distributed runtimes. Experimental results show that OMPC can deliver up to 1.53x and 2.43x better performance than Charm++ on CCR and scalability experiments, respectively. Experiments also show that OMPC performance weakly scales for both Task Bench and a real-world seismic imaging application.

关键词： Parallel programming concurrent programming HPC

来源：评论

学校读者我要写书评

暂无评论

concurrent programming constructs for parallel MPI applications The MPI threads library

引用

JOURNAL OF SUPERCOMPUTING 2013年第2期63卷 385-406页

作者： Berka, Tobias Kollias, Giorgos Hagenauer, Helge Vajtersic, Marian Grama, Ananth Salzburg Univ Dept Comp Sci A-5020 Salzburg Austria Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Slovak Acad Sci Inst Math Dept Informat Bratislava 81473 Slovakia

Concurrency and parallelism have long been viewed as important, but somewhat distinct concepts. While concurrency is extensively used to amortize latency (for example, in web- and database-servers, user interfaces, etc.), parallelism is traditionally used to enhance performance through execution on multiple functional units. Motivated by an evolving application mix and trends in hardware architecture, there has been a push toward integrating traditional programming models for concurrency and parallelism. Use of conventional threads APIs (POSIX, OpenMP) with messaging libraries (MPI), however, leads to significant programmability concerns, owing primarily to their disparate programming models. In this paper, we describe a novel API and associated runtime for concurrent programming, called MPI Threads (MPIT), which provides a portable and reliable abstraction of low-level threading facilities. We describe various design decisions in MPIT, their underlying motivation, and associated semantics. We provide performance measurements for our prototype implementation to quantify overheads associated with various operations. Finally, we discuss two real-world use cases: an asynchronous message queue and a parallel information retrieval system. We demonstrate that MPIT provides a versatile, low overhead programming model that can be leveraged to program large parallel ensembles.

关键词： Threads Parallel programming concurrent programming Reliability Performance

来源：评论

学校读者我要写书评

暂无评论

Reasoning About Actors that Share State

Reasoning About Actors that Share State

引用

作者： Caldwell, Sam Northeastern University

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

concurrent programming is notoriously difficult. That challenge has prompted researchers to investigate approaches to organizing and understanding concurrent behavior. The recent dataspace model of actors is one such example of an organization methodology. It recognizes the benefit of isolation between components but also the need for sharing. My dissertation tackles the other aspect---understanding concurrency---by exploring the potential of reasoning about dataspace programs using types. The first challenge is integrating dataspace programming to a typed setting. Doing so allows for checking that each actor agrees on the types of communicated values. In initial work, I designed a type system that incorporates an approximation of the dataspace communication mechanism to ensure this structural agreement. The rest of the dissertation concerns the question of reasoning about the communication behavior of program components. By utilizing a structured notation for programming such actors, I show that it is possible to automatically check behavioral properties of programs.

关键词： Actor model Behavioral types concurrent programming Type systems Dataspace programming

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Fine-Grained Synchronization Protocols for Implicit Monitors

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2022年第OOPSLA期6卷 1–26页

作者： Ferles, Kostas Sepanski, Benjamin Krishnan, Rahul Bornholt, James Dillig, Isil Univ Texas Austin Comp Sci Dept Austin TX 78712 USA

A monitor is a widely-used concurrent programming abstraction that encapsulates all shared state between threads. Monitors can be classified as being either implicit or explicit depending on the primitives they provide. Implicit monitors are much easier to program but typically not as efficient. To address this gap, there has been recent research on automatically synthesizing explicit-signal monitors from an implicit specification, but prior work does not exploit all paralellization opportunities due to the use of a single lock for the entire monitor. This paper presents a new technique for synthesizing fine-grained explicit-synchronization protocols from implicit monitors. Our method is based on two key innovations: First, we present a new static analysis for inferring safe interleavings that allow violating mutual exclusion of monitor operations without changing its semantics. Second, we use the results of this static analysis to generate a MaxSAT instance whose models correspond to correct-by-construction synchronization protocols. We have implemented our approach in a tool called CORTADO and evaluate it on monitors that contain parallelization opportunities. Our evaluation shows that CORTADO can synthesize synchronization policies that are competitive with, or even better than, expert-written ones on these benchmarks.

关键词： implicit signal monitors fine-grained locking concurrent programming symbolic reasoning verification conditions monitor invariant

来源：评论

学校读者我要写书评

暂无评论

Improving Performance in concurrent Programs by Switching from Relational to NoSQL Perspectives 21st

Improving Performance in Concurrent Programs by Switching fr...

引用

21st International Symposium on Distributed Computing and Artificial Intelligence

作者： Wojszczyk, Rafal Mrzyglod, Lukasz Dvorak, Jiri Koszalin Univ Technol Sniadeckich 2 PL-75453 Koszalin Poland Czech Univ Life Sci Prague Kamycka 129 Prague 16500 Czech Republic

ISBN: (纸本)9783031764585;9783031764592

This paper describes how to improve performance in concurrent applications using a change of perspective from relational to NoSQL. Concurrency in programming has been used for many years to increase the efficiency of application code execution. This problem is particularly relevant in business applications that are used by multiple users simultaneously. The aim of this paper is to carry out a verification study of whether changing the data access layer and the type of database engine will result in increased performance in the execution of application code. The study will be carried out using the example of a school logbook application, which perfectly captures the disproportionate frequency of use of the application. The results of the research indicate that NoSQL solutions are superior to relational databases in terms of performance, flexibility of modification and expansion of the database structure.

关键词： SQL NoSQL RDBMS concurrent programming multithreading

来源：评论

学校读者我要写书评

暂无评论

The OpenMP Cluster programming Model 22

The OpenMP Cluster Programming Model

引用

Workshop Proceedings of the 51st International Conference on Parallel Processing

作者： Hervé Yviquel Marcio Pereira Emílio Francesquini Guilherme Valarini Gustavo Leite Pedro Rosso Rodrigo Ceccato Carla Cusihualpa Vitoria Dias Sandro Rigo Alan Souza Guido Araujo Institute of Computing UNICAMP Brazil Center for Mathematics Computing and Cognition UFABC Brazil CENPES PETROBRAS Brazil

ISBN: (纸本)9781450394451

Despite the various research initiatives and proposed programming models, efficient solutions for parallel programming in HPC clusters still rely on a complex combination of different programming models (e.g., OpenMP and MPI), languages (e.g., C++ and CUDA), and specialized runtimes (e.g., Charm++ and Legion). On the other hand, task parallelism has shown to be an efficient and seamless programming model for clusters. This paper introduces OpenMP Cluster (OMPC), a task-parallel model that extends OpenMP for cluster programming. OMPC leverages OpenMP’s offloading standard to distribute annotated regions of code across the nodes of a distributed system. To achieve that it hides MPI-based data distribution and load-balancing mechanisms behind OpenMP task dependencies. Given its compliance with OpenMP, OMPC allows applications to use the same programming model to exploit intra- and inter-node parallelism, thus simplifying the development process and maintenance. We evaluated OMPC using Task Bench, a synthetic benchmark focused on task parallelism, comparing its performance against other distributed runtimes. Experimental results show that OMPC can deliver up to 1.53x and 2.43x better performance than Charm++ on CCR and scalability experiments, respectively. Experiments also show that OMPC performance weakly scales for both Task Bench and a real-world seismic imaging application.

关键词： concurrent programming Parallel programming HPC

来源：评论

学校读者我要写书评

暂无评论

Reengineering the SLEEP Simulator in a concurrent and Distributed programming Course

引用

COMPUTER APPLICATIONS IN ENGINEERING EDUCATION 2014年第1期22卷 39-51页

作者： Radivojevic, Zaharije Cvetanovic, Milos Jovanovic, Zoran Univ Belgrade Sch Elect Engn Dept Comp Engn & Informat Theory Belgrade Serbia

This article presents laboratory exercises and project assignments developed to teach concepts of concurrent and distributed programming in Java. The exercises and assignments cover important topics determined after an analysis of topics that are often taught in different universities. During the exercises, students reengineer the general purpose discrete event simulator named SLEEP (Simulation, Logic, Execution, prEsentation, Physics). A multilayer organization of the SLEEP simulator enables coverage of the important topics in a coherent manner. In order to support parallel execution in SLEEP students start to reengineer the simulator layers with an exercise related to concurrent programming, followed by two exercises related to distributed programming, and finish with an exercise related to grid computing. The exercises follow the principles of error management training and teach students what common errors are and how to overcome them. The article also describes a practical experience with the use of SLEEP on a concurrent and distributed programming course over a 3-year period. The results show a positive impact on both students' satisfaction and performance. (c) 2011 Wiley Periodicals, Inc. Comput Appl Eng Educ 22: 39-51, 2014

关键词： computer science education concurrent programming distributed programming simulation software general purpose discrete event simulator

来源：评论

学校读者我要写书评

暂无评论

pseuCo Book: An Interactive Learning Experience 22

pseuCo Book: An Interactive Learning Experience

引用

27th ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE)

作者： Freiberger, Felix Saarland Univ Comp Sci Saarland Informat Campus Saarbrucken Germany

ISBN: (纸本)9781450392013

Software tools and apps are pervading educational technology in many areas, not least in the field of computer science education. However, many of these tools have a very narrow scope and lack context, or only work as add-ons to textbooks and other course materials. This paper advocates an alternative: a truly interactive textbook experience where interactive demonstrations and exercises are interwoven with more classical textual elements. We present a framework that provides authors with the infrastructure for writing such books, and present pseuCo Book, an interactive book for teaching concurrent programming. The effectiveness of this approach is demonstrated by a user study encompassing a detailed empirical evaluation.

关键词： computer science education concurrent programming concurrency theory interactive textbook

来源：评论

学校读者我要写书评

暂无评论

Kmclib: Automated Inference and Verification of Session Types from OCaml Programs 28th

Kmclib: Automated Inference and Verification of Session Type...

引用

28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) Held as Part of the 25th European Joint Conferences on Theory and Practice of Software (ETAPS)

作者： Imai, Keigo Lange, Julien Neykova, Rumyana Gifu Univ Gifu Japan Royal Holloway Univ London London England Brunel Univ London London England

ISBN: (纸本)9783030995249;9783030995232

Theories and tools based on multiparty session types offer correctness guarantees for concurrent programs that communicate using message-passing. These guarantees usually come at the cost of an intrinsically top-down approach, which requires the communication behaviour of the entire program to be specified as a global type. This paper introduces kmclib: an OCaml library that supports the development of correct message-passing programs without having to write any types. The library utilises the meta-programming facilities of OCaml to automatically infer the session types of concurrent programs and verify their compatibility (k-MC [15]). Well-typed programs, written with kmclib, do not lead to communication errors and cannot get stuck.

关键词： Multiparty Session Types concurrent programming OCaml

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：