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

IEEE High Performance Extreme Computing Conference (HPEC)

作者： Diniz, Pedro C. USC Informat Sci Inst 4676 Admiralty WaySuite 1001 Marina Del Rey CA 90292 USA

ISBN: (纸本)9781467392860

The sheer size of data sets from application domains such as biomedical and social networks will lead to the need to develop algorithms that have strict time bounds and can tolerate temporary unavailability of data if they are to produce acceptable results in feasible time. In this paper we describe a simple, yet powerful, object-based concurrent programming model that features atomicity, timed execution and tolerance to data unavailability. We describe the underlying concepts and illustrate their use in a sample computation on large graphs. This experience shows that it is possible to augment existing concurrent programming models to support developers in developing and reasoning about incomplete computations, we believe, will become, an increasingly important class of algorithms.

关键词： concurrent programming Graph-based Computations Incomplete Traversals

来源：评论

学校读者我要写书评

暂无评论

Playing and learning with gamification: an in-class concurrent and distributed programming activity 45

Playing and learning with gamification: an in-class concurre...

引用

45th Annual Frontiers in Education Conference (FIE)

作者： Maia, Rodrigo Filev Graeml, Felipe Reis Ctr Univ FEI Comp Sci Sao Bernardo Do Campo Brazil Ctr Univ FEI Dept Prod Engn Sao Bernardo Do Campo Brazil

ISBN: (纸本)9781479984541

It seems that education is working fine, especially in several good and traditional Universities around the world. Nokia was also doing very well in a business world until clients' needs change. Are we academics really offering what the students and the labor market need and demand? We have offered the same product for decades, but we haven't realize that the client is different and is demanding another product. Sometimes, we may have the feeling that our students are beyond this world when they are connected in the internet. Some say that the new generation is not using technology in a properly way to study;however are academics using it better? We are not using the new generation's language to communicate with students and to transfer knowledge. Games and competitions is the "language of the new generation" and it may promote a desired long-term learning experience we academics always wished. This paper describes the use of gamification as a tool to support the lectures of concurrent and distributed subjects, for undergraduate students of computer science course. In the game students should create and optimize the production line of a specific product. In the programming class, students should create and balance the same production line to beat competitors. Students have to use concepts of distributed programming and concurrency, and create strategies to organize the threads (production line) in order to be more efficient than the other competitors. The best production lines sell more and get more benefits. This paper discusses the preliminary results obtained from a survey of learning inhibits, which were applied before and after doing the course activity. The study compares the results obtained in both surveys and indicate that with the use of gamification to support class activities the learning inhibits tend to reduce at same time that transversal competences are stimulate on students. The discussion conducted after each round of the game indicated the interes

关键词： gamification concurrent programming learning inhibits programming game

来源：评论

学校读者我要写书评

暂无评论

Boundary-Aware concurrent Queue: A Fast and Scalable concurrent FIFO Queue on GPU Environments

引用

APPLIED SCIENCES-BASEL 2025年第4期15卷 1834-1834页

作者： Polak, Md. Sabbir Hossain Troendle, David A. Jang, Byunghyun Univ Mississippi Comp & Informat Sci 201 Weir Hall Oxford MS 38677 USA

This paper presents Boundary-Aware concurrent Queue (BACQ), a high-performance queue designed for modern GPUs, which focuses on high concurrency in massively parallel environments. BACQ operates at the warp level, leveraging intra-warp locality to improve throughput. A key to BACQ's design is its ability to replace conflicting accesses to shared data with independent accesses to private data. It uses a ticket-based system to ensure fair ordering of operations and supports infinite growth of the head and tail across its ring buffer. The leader thread of each warp coordinates enqueue and dequeue operations, broadcasting offsets for intra-warp synchronization. BACQ dynamically adjusts operation priorities based on the queue's state, especially as it approaches boundary conditions such as overfilling the buffer. It also uses a virtual caching layer for intra-warp communication, reducing memory latency. Rigorous benchmarking results show that BACQ outperforms the BWD (Broker Queue Work Distributor), the fastest known GPU queue, by more than 2x while preserving FIFO semantics. The paper demonstrates BACQ's superior performance through real-world empirical evaluations.

关键词： GPGPU concurrent queues concurrent data structures concurrent programming parallel programming strict First-In-First-Out (FIFO)

来源：评论

学校读者我要写书评

暂无评论

Integration of ICT in concurrent and Parallel programming Lectures

Integration of ICT in Concurrent and Parallel Programming Le...

引用

21st International Conference on Parallel and Distributed Computing (Euro-Par)

作者： Tomeu-Hardasmal, Antonio J. Salguero, Alberto G. Capel, Manuel I. Univ Cadiz Cadiz Spain Univ Granada Granada Spain

ISBN: (纸本)9783319273082;9783319273075

An effective teaching and learning in concurrent and parallel programming needs the presentation of short excerpts of code to students in a selected programming language during lectures. This is sometimes necessary to make understandable complicate syntactical constructs. Traditionally, these codes have been presented by the teacher to the students on a blackboard, with slides or by means any projection facilities, together with an oral description of their operation and significance. Teachers try to explain those syntactical constructs with more or less success and students do not usually test program code during lectures, nor can do any modifications to the programs, which are helpful in order to master difficult concepts of parallel programming and Concurrency. In the best possible scenario, students will carry out any tests on the real code of an example presented in lectures during practical lessons at the lab. Nevertheless, without a clear illustration of their actual behavior in a real computer program, any new concepts of concurrent constructs taught in lectures will remain fuzzy and prone to be forgotten. The presented approach consists of changing the traditional teaching and learning model of parallel programming into another where students will be equipped with multicore processors inside their laptops, which in addition to Virtual Campus services will serve to put into practice any programming code that illustrates a programming concept the minute it is presented during any lecture by the teacher to the class.

关键词： Teaching innovation Teaching improvement Virtual campus ICT integration Lecturing model concurrent programming Parallel programming Code Performance improvement Interactive theoretical teaching Students

来源：评论

学校读者我要写书评

暂无评论

A Linear Logic programming Language for concurrent programming over Graph Structures

引用

THEORY AND PRACTICE OF LOGIC programming 2014年第4-5期14卷 493-507页

作者： Cruz, Flavio Rocha, Ricardo Goldstein, Seth Copen Pfenning, Frank Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Porto CRACS P-4169007 Oporto Portugal Univ Porto Fac Sci INESC TEC P-4169007 Oporto Portugal

We have designed a new logic programming language called LM (Linear Meld) for programming graph- based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we present the syntax and operational semantics of our language and illustrate its use through a number of examples.

关键词： Language Design Semantics Linear Logic concurrent programming Graphs

来源：评论

学校读者我要写书评

暂无评论

A Linear Logic programming Language for concurrent programming over Graph Structures

A Linear Logic Programming Language for Concurrent Programmi...

引用

30th International Conference on Logic programming

关键词： Language Design Semantics Linear Logic concurrent programming Graphs

来源：评论

学校读者我要写书评

暂无评论

An Interleaving Guided Metamorphic Testing Approach for concurrent Programs

引用

ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY 2024年第1期33卷 1-21页

作者： Sun, Chang-Ai Dai, Hepeng Geng, Ning Liu, Huai Chen, Tsong Yueh Wu, Peng Cai, Yan Wang, Jinqiu Univ Sci & Technol Beijing 30 Xueyuan Rd Beijing 100083 Peoples R China Swinburne Univ Technol John St Hawthorn Vic 3122 Australia Chinese Acad Sci State Key Lab Comp Sci Inst Software Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100190 Peoples R China

concurrent programs are normally composed of multiple concurrent threads sharing memory space. These threads are often interleaved, which may lead to some non-determinism in execution results, even for the same program input. This poses huge challenges to the testing of concurrent programs, especially on the test result verification-that is, the prevalent existence of the oracle problem. In this article, we investigate the application of metamorphic testing (MT), a mainstream technique to address the oracle problem, into the testing of concurrent programs. Based on the unique features of interleaved executions in concurrent programming, we propose an extended notion of metamorphic relations, the core part of MT, which are particularly designed for the testing of concurrent programs. A comprehensive testing approach, namely ConMT, is thus developed and a tool is built to automate its implementation on concurrent programs written in Java. Empirical studies have been conducted to evaluate the performance of ConMT, and the experimental results show that in addition to addressing the oracle problem, ConMT outperforms the baseline traditional testing techniques with respect to a higher degree of automation, better bug detection capability, and shorter testing time. It is clear that ConMT can significantly improve the cost-effectiveness for the testing of concurrent programs and thus advances the state of the art in the field. The study also brings novelty into MT, hence promoting the fundamental research of software testing.

关键词： concurrent programming metamorphic testing interleaving executions data race

来源：评论

学校读者我要写书评

暂无评论

Wait-free Trees with Asymptotically-Efficient Range Queries 38

Wait-free Trees with Asymptotically-Efficient Range Queries

引用

International Parallel and Distributed Processing Symposium (IPDPS)

作者： Kokorin, Ilya Yudov, Victor Aksenov, Vitaly Alistarh, Dan ITMO Univ VK com St Petersburg Russia ITMO Univ St Petersburg Russia City Univ London London England IST Austria Vienna Austria

ISBN: (纸本)9798350387117;9798350387124

Tree data structures, such as red-black trees, quad trees, treaps, or tries, are fundamental tools in computer science. A classical problem in concurrency is to obtain expressive, efficient, and scalable versions of practical tree data structures. We are interested in concurrent trees supporting range queries, i.e., queries that involve multiple consecutive data items. Existing implementations with this capability can list keys in a specific range, but do not support aggregate range queries: for instance, if we want to calculate the number of keys in a range, the only choice is to retrieve a whole list and return its size. This is suboptimal: in the sequential setting, one can augment a balanced search tree with counters and, consequently, perform these aggregate requests in logarithmic rather than linear time. In this paper, we propose a generic approach to implement a broad class of range queries on concurrent trees in a way that is wait-free, asymptotically efficient, and practically scalable. The key idea is a new mechanism for maintaining metadata concurrently at tree nodes, which can be seen as a wait-free variant of hand-over-hand locking (which we call hand-over-hand helping). We did a preliminary implementation of the wait-free binary search tree and preliminary experiments have indicated the soundness of our approach.

关键词： Data structures concurrent programming Range queries

来源：评论

学校读者我要写书评

暂无评论

Forkfuzz: Leveraging the Fork-Awareness in Coverage-Guided Fuzzing

Forkfuzz: Leveraging the Fork-Awareness in Coverage-Guided F...

引用

28th European Symposium on Research in Computer Security (ESORICS)

作者： Maugeri, Marcello Daniele, Cristian Bella, Giampaolo Univ Catania Catania Italy Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9783031541285;9783031541292

Fuzzing is a widely adopted technique for automated vulnerability testing due to its effectiveness and applicability throughout the Software Development Life Cycle. Nevertheless, applying fuzzing "out of the box" to any system can prove to be a challenging endeavour. Consequently, the demand for target-specific solutions necessitates a substantial amount of manual intervention, which diverges from the automated nature typically associated with fuzzing. For example, prior research identified the lack of a solution for testing multi-process systems effectively. The problem is that coverage-guided fuzzers do not consider the possibility of having a system with more than one process. In this paper, we present Forkfuzz, a "fork-aware" fuzzer able to deal with multi-process systems. To the best of our knowledge, Forkfuzz is the first fork-aware fuzzer. It is built on top of Honggfuzz, one of the most popular and effective coverage-guided fuzzers, as reported by the Fuzzbench benchmark. To show its effectiveness, we tested our fuzzer over two classical programming problems: the Dining Philosophers Problem and a version of the Producer-Consumer Problem where the consumer (the child) process crashes for specific inputs. Furthermore, we evaluated Forkfuzz against a real and more complex scenario involving an HTTP server that handles multiple connections through multiple processes. The results of our evaluation demonstrate the effectiveness of Forkfuzz in identifying crashes and timeouts. Finally, we discuss possible improvements and challenges for the development and application of fork-aware fuzzing techniques.

关键词： fuzzing automated vulnerability testing multi-process system security testing concurrent programming

来源：评论

学校读者我要写书评

暂无评论

DHash: Dynamic Hash Tables With Non-Blocking Regular Operations

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第12期33卷 3274-3290页

作者： Wang, Junchang Liu, Dunwei Fu, Xiong Xiao, Fu Tian, Chen Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing 210023 Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210008 Peoples R China

Once started, existing hash tables cannot change their pre-defined hash functions, even if the incoming data cannot be evenly distributed to the hash table buckets. In this paper, we present DHash, a type of hash table for shared memory systems, that can change its hash function and rebuild the hash table on the fly, without noticeably degrading its service. The major technical novelty of DHash stems from an efficient distributing mechanism that can atomically distribute every node when rebuilding, without locking the corresponding hash table buckets. This not only enables non-blocking lookup, insert, and delete operations, but more importantly, makes DHash independent of the implementation of hash table buckets, such that DHash allows programmers to select the set algorithms that meet their requirements best from a variety of existing lock-free and wait-free set algorithms. Evaluations show that DHash can efficiently change its hash function on the fly. Moreover, when rebuilding, DHash consistently outperforms the state-of-the-art hash tables in terms of throughput and response time of concurrent operations, at different concurrency levels, and with different operation mixes and average load factors.

关键词： Hash functions Heuristic algorithms Robustness Kernel Synchronization Linux Time factors concurrent programming parallelism and concurrency dynamic hash tables

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：