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

FLEX - A HIGH-LEVEL LANGUAGE FOR SPECIFYING CUSTOMIZED MICROPROCESSORS

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1985年第4期11卷 387-396页

作者： COMER, DE GEHANI, NH AT&T BELL LABS MURRAY HILLNJ 07974

ATT Bell Laboratories has recently developed a silicon compiler, called Plex, that automatically generates mask-level very large scale integration (VLSI) layouts of high performance and area-efficient microprocessors. The Plex microprocessor interacts with the outside world via input and output wires and interrupts; its purpose is to provide high-level logic building blocks for a system on a chip. Presently, Plex specifications are programs written in Assembly-like language; a higher-level specification language, called Flex, has been designed for describing Plex-like logic blocks. Flex was developed for the silicon environment in which input-output is performed on wires and chip area severely restricts program complexity. The high-level language concepts of Flex are tailored to permit: 1. high-level description of input-output wires, 2. processing triggered by states and changes in states of input wires, and 3. concurrent and real-time programming. Discussion centers on the motivation for the advantages of Flex and an informal description of Flex; examples illustrate its use. Flex is not specific to Plex and can be used with other silicon compilers.

关键词： Wafer Computers concurrent programming Customized Chips Customized Microprocessors Microprocessor Design Real Time programming Language VLSI

来源：评论

学校读者我要写书评

暂无评论

Network Traffic Processing With PFQ

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2016年第6期34卷 1819-1833页

作者： Bonelli, Nicola Giordano, Stefano Procissi, Gregorio Univ Pisa Dipartimento Ingn Informaz I-56122 Pisa Italy Consorzio Nazl Interuniv Telecomunicaz I-56122 Pisa Italy

This paper presents Packet Family Queue (PFQ), a high-performance framework for packet processing designed to flexibly handle network applications parallelism and making traffic processing safe and easy. PFQ is an open-source module for the Linux kernel that combines software-accelerated packet I/O to in-kernel early stage packet processing and fine-grained distribution to network applications and physical devices. PFQ does not require any modification to network device drivers and exposes programming interfaces to multi-threaded applications natively designed to run on top of it, as well as to legacy monitoring tools using the pcap library. The results show that the flexibility and the backward compatibility provided by PFQ do not impact its processing performance that, in fact, reaches line rate figures in the cases of pure speed tests and real practical monitoring use cases on 10+Gb/s links.

关键词： Network monitoring concurrent programming multi-core architectures multi-queue NICs early stage processing application offload

来源：评论

学校读者我要写书评

暂无评论

Transaction Scheduling Using Dynamic Conflict Avoidance

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 2013年第1期41卷 89-110页

作者： Nicacio, Daniel Baldassin, Alexandro Araujo, Guido Univ Estadual Campinas Inst Comp Campinas SP Brazil Univ Estadual Paulista Rio Claro SP Brazil

Software transaction memory (STM) systems have been used as an approach to improve performance, by allowing the concurrent execution of atomic blocks. However, under high-contention workloads, STM-based systems can considerably degrade performance, as transaction conflict rate increases. Contention management policies have been used as a way to select which transaction to abort when a conflict occurs. In general, contention managers are not capable of avoiding conflicts, as they can only select which transaction to abort and the moment it should restart. Since contention managers act only after a conflict is detected, it becomes harder to effectively increase transaction throughput. More proactive approaches have emerged, aiming at predicting when a transaction is likely to abort, postponing its execution. Nevertheless, most of the proposed proactive techniques are limited, as they do not replace the doomed transaction by another or, when they do, they rely on the operating system for that, having little or no control on which transaction to run. This article proposes LUTS, a lightweight user-level transaction scheduler. Unlike other techniques, LUTS provides the means for selecting another transaction to run in parallel, thus improving system throughput. We discuss LUTS design and propose a dynamic conflict-avoidance heuristic built around its scheduling capabilities. Experimental results, conducted with the STAMP and STMBench7 benchmark suites, running on TinySTM and SwissTM, show how our conflict-avoidance heuristic can effectively improve STM performance on high contention applications.

关键词： Multiprocessor systems concurrent programming Transactional memory Contention management

来源：评论

学校读者我要写书评

暂无评论

Autotuning Skeleton-Driven Optimizations for Transactional Worklist Applications

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2012年第12期23卷 2205-2218页

作者： Wanderley Goes, Luis Fabricio Ioannou, Nikolas Xekalakis, Polychronis Cole, Murray Cintra, Marcelo Pontificia Univ Catolica Minas Gerais BR-31015190 Belo Horizonte MG Brazil IBM Zurich Res Lab CH-8803 Ruschlikon Switzerland Intel Labs Barcelona Intel Barcelona Res Ctr Barcelona 08034 Spain Univ Edinburgh Edinburgh EH8 9AB Midlothian Scotland

Skeleton or pattern-based programming allows parallel programs to be expressed as specialized instances of generic communication and computation patterns. In addition to simplifying the programming task, such well structured programs are also amenable to performance optimizations during code generation and also at runtime. In this paper, we present a new skeleton framework that transparently selects and applies performance optimizations in transactional worklist applications. Using a novel hierarchical autotuning mechanism, it dynamically selects the most suitable set of optimizations for each application and adjusts them accordingly. Our experimental results on the STAMP benchmark suite show that our skeleton autotuning framework can achieve performance improvements of up to 88 percent, with an average of 46 percent, over a baseline version for a 16-core system and up to 115 percent, with an average of 56 percent, for a 32-core system. These performance improvements match or even exceed those obtained by a static exhaustive search of the optimization space.

关键词： concurrent programming transactional memory parallel patterns and application-transparent adaptation

来源：评论

学校读者我要写书评

暂无评论

Static slicing of explicitly synchronized languages

引用

INFORMATION AND COMPUTATION 2012年 214卷 10-46页

作者： Leuschel, Michael Llorens, Marisa Oliver, Javier Silva, Josep Tamarit, Salvador Univ Politecn Valencia E-46022 Valencia Spain Univ Dusseldorf Inst Informat D-40225 Dusseldorf Germany

Static analysis of concurrent languages is a complex task due to the non-deterministic execution of processes. If the concurrent language being studied allows process synchronization, then the analyses are even more complex (and thus expensive), e.g., due to the phenomenon of deadlock. In this work we introduce a static analysis technique based on program slicing for concurrent and explicitly synchronized languages in general, and CSP in particular. Concretely. given a particular point in a specification, our technique allows us to know what parts of the specification must necessarily be executed before this point, and what parts of the specification could be executed before it. Our technique is based on a new data structure that extends the Synchronized Control Flow Graph (SCFG). We show that this new data structure improves the SCFG by taking into account the context in which processes are called and, thus, it makes the slicing process more precise. The technique has been implemented and tested with real specifications, producing good results. After formally defining our technique, we describe our tool, its architecture, its main applications and the results obtained from several experiments conducted in order to measure the performance of the tool. (C) 2012 Elsevier Inc. All rights reserved.

关键词： concurrent programming CSP Program slicing

来源：评论

学校读者我要写书评

暂无评论

Packet Fan-Out Extension for the pcap Library

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2018年第3期15卷 976-990页

作者： Bonelli, Nicola Del Vigna, Fabio Giordano, Stefano Procissi, Gregorio Univ Pisa Dipartimento Ingn Informaz I-56122 Pisa Italy Univ Pisa CNIT Res Unit Pisa Italy

The large availability of multi-gigabit network cards for commodity PCs requires network applications to potentially cope with high volumes of traffic. However, computation intensive operations may not catch up with high traffic rates and need to be run in parallel over multiple processing cores. As of today, the vast majority of network applications-e.g., monitoring and IDS systems-are still based on the pcap library interface which, unfortunately, does not provide the native multi-core support, even though the current underlying capture technologies do. This paper introduces a novel version of the pcap library for the Linux operating system that enables transparent application level parallelism. The new library supports fan-out operations for both multi-threaded and multi-process applications, by means of extended API as well as by a declarative grammar for configuration files, suitable for legacy applications. In addition, the library can transparently run on top of the standard Linux socket as well as on other accelerated active engines. Performance evaluation has been carried out on a multi-core architecture in pure capture tests and in more realistic use cases involving monitoring applications such as Tstat and Bro, with standard Linux socket as well as PF_RING and PFQ accelerated engines.

关键词： Accelerated sockets concurrent programming multi-core architectures network applications packet fanout pcap library

来源：评论

学校读者我要写书评

暂无评论

PROCESS SCHEDULING AND UNIX SEMAPHORES

引用

SOFTWARE-PRACTICE & EXPERIENCE 1995年第10期25卷 1141-1153页

作者： DUNSTAN, N FRIS, I Department of Mathematics Statistics and Computing Science University of New England Armidale NSW 2351 Australia

Semaphores have been used extensively in programming concurrent tasks. Various extensions have been proposed for problems in which traditional semaphores turned out to be difficult to use, The extended semaphore primitives investigated here are based on the version of semaphores implemented in UNIX System V. Implementation issues are discussed and practical illustrations of their use are provided. In particular, algorithms for a variety of common process scheduling schemes are shown. These solutions are evaluated and the strengths and weaknesses of UNIX semaphores are discussed.

关键词： UNIX SEMAPHORES SYNCHRONIZATION concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Actor model of Anemone functional language

引用

JOURNAL OF SUPERCOMPUTING 2018年第4期74卷 1485-1496页

作者： Batko, Pawel Kuta, Marcin VirtusLab Smolensk 21-15 PL-31108 Krakow Poland AGH Univ Sci & Technol Dept Comp Sci Al Mickiewicza 30 PL-30059 Krakow Poland

This paper describes actor system of a new functional language called Anemone and compares it with actor systems of Scala and Erlang. Implementation details of the actor system are described. Performance evaluation is... 详细信息

关键词： Compiler construction concurrent programming Actors Threads Message passing Garbage collector

来源：评论

学校读者我要写书评

暂无评论

Optimizing Sparse Linear Algebra for Large-Scale Graph Analytics

引用

COMPUTER 2015年第8期48卷 26-34页

作者： Buono, Daniele Gunnels, John A. Que, Xinyu Checconi, Fabio Petrini, Fabrizio Tuan, Tai-Ching Long, Chris IBM TJ Watson Res Ctr High Performance Analyt Grp Yorktown Hts NY 10598 USA IBM TJ Watson Res Ctr Data Centr Syst Grp Yorktown Hts NY USA Univ Maryland Lab Phys Sci College Pk MD USA US Dept Def Arlington VA USA

Emerging data-intensive applications attempt to process and provide insight into vast amounts of online data. A new class of linear algebra algorithms can efficiently execute sparse matrix-matrix and matrix-vector multiplications on large-scale, shared memory multiprocessor systems, enabling analysts to more easily discern meaningful data relationships, such as those in social networks.

关键词： graph theory mathematics computing matrix multiplication multiprocessing systems sparse matrices vectors data relationships data-intensive applications large-scale graph analytics large-scale-shared memory multiprocessor systems linear algebra algorithms matrix-vector multiplications online data social networks sparse linear algebra optimization sparse matrix-matrix multiplications concurrent programming Data analysis Data-intensive applications Memory management Multiprocessors Software engineering Sparse matrices concurrent programming data analysis graph analytics irregular applications shared memory multiprocessor systems software software engineering sparse linear algebra system performance

来源：评论

学校读者我要写书评

暂无评论

Parallelizing Bzip2: A Case Study in Multicore Software Engineering

引用

IEEE SOFTWARE 2009年第6期26卷 70-77页

作者： Pankratius, Victor Jannesari, Ali Tichy, Walter F. Univ Karlsruhe Young Investigator Grp Multicore Software Engn Karlsruhe Germany Univ Karlsruhe Multicore Software Engn Grp Karlsruhe Germany

The article discusses a case study of parallelizing the Bzip2 program for multicore software engineering. Graduate computer science students participated, working in independent teams of two to parallelize Bzip2 in a competition. The strategies used by the teams are described, including the use of a mixture of OpenMP and PThreads. It indicates that parallelizing a sequential program might not be possible right way. Refactorings improve code modularity and remove unnecessary data dependencies.

关键词： Libraries Data mining Parallel processing Multicore processing Posix programming techniques concurrent programming parallel programming multicore systems bzip concurrency synchronization patterns OpenMP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：