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

What’s Missing in Agile Hardware Design? Verification!

Journal of computer Science & Technology 2023年第4期38卷 735-736页

作者： Babak Falsafi Parallel Systems Architecture Laboratory Institute of Computer and Communication SciencesSchool of Computer andCommunication SciencesEcole Polytechnique Fédérale de LausanneLausanneCH-1015Switzerland

Agile hardware design is an approach to developing hardware systems that draws inspiration from the principles and practices of agile software *** emphasizes collaboration,flexibility,iterative development,and quick adaptation to changing *** agile hardware design,the focus is on delivering functionalhardware systems in shorter development cycles while maintaining high-quality and customer *** particular,agile hardware design is of great interest in the open-source hardware ***-sourcehardware development—such as RISC-V—is at the forefront of initiatives to democratize hardware and drive innovation in chip design *** design is instrumental for the RISC-V community because it supportsrapid iteration,accommodates the evolving RISC-V standard and the addition of custom extensions,improvescommunity collaboration and time-to-market,and addresses the design challenges associated with complex architectural features.

关键词： hardware agile architectural

来源：评论

学校读者我要写书评

暂无评论

Coping with very high latencies in petaflop computer systems 2nd

引用

2nd International Symposium on High Performance Computing, ISHPC 1999

作者： Ryan, Sean Amaral, José N. Gao, Guang Ruiz, Zachary Marquez, Andres Theobald, Kevin Computer Architecture and Parallel Systems Laboratory University of Delaware NewarkDE United States

ISBN: (纸本)3540659692

The very long and highly variable latencies in the deep memory hierarchy of a petaflop-scale architecture design, such as the Hybrid Technology Multi-Threaded architecture (HTMT) [13], present a new challenge to its programming and execution model. A solution to coping with such high and variable latencies is to directly and explicitly expose the different memory regions of the machine to the program execution model, allowing better management of communication. In this paper we describe the novel percolation model that lies at the heart of the HTMT program execution model [13]. The Percolation Model combines multithreading with dynamic prefetching of coarse-grain contexts. In the past, prefetching techniques have concentrated on moving blocks of data within the memory hierarchy. Instead of only moving contiguous blocks of data, the thread percolation approach manages contexts that include data, program instructions, and control states. The main contributions of this paper include the specification of the HTMT runtime execution model based on the concept of percolation, and a discussion of the role of the compiler in a machine that exposes the memory hierarchy to the programming model. © 1999, Springer-Verlag. All rights reserved.

关键词： Solvents

来源：评论

学校读者我要写书评

暂无评论

GFaaS: Enabling Generic Functions in Serverless Computing 31

GFaaS: Enabling Generic Functions in Serverless Computing

引用

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Chadha, Mohak Wieland, Paul Gerndt, Michael Technische Universität München Computer Architecture and Parallel Systems Garching Germany

ISBN: (纸本)9798350330663

With the advent of AWS Lambda in 2014, Serverless Computing, particularly Function-as-a-Service (FaaS), has witnessed growing popularity across various application domains. FaaS enables an application to be decomposed into fine-grained functions that are executed on a FaaS platform. It offers several advantages such as no infrastructure management, a pay-per-use billing policy, and on-demand fine-grained autoscaling. However, despite its advantages, developers today encounter various challenges while adopting FaaS solutions that reduce productivity. These include FaaS platform lock-in, support for diverse function deployment parameters, and diverse interfaces for interacting with FaaS platforms. To address these challenges, we present gFaaS, a novel framework that facilitates the holistic development and management of functions across diverse FaaS platforms. Our framework enables the development of generic functions in multiple programming languages that can be seamlessly deployed across different platforms without modifications. Results from our experiments demonstrate that gFaaS functions perform similarly to native platform-specific functions across various scenarios. A video demonstrating the functioning of gFaaS is available from https://***/STbb6ykJFf0. © 2024 IEEE.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

A high performance distributed database system for enhanced internet services

引用

International Conference and Exhibition on High-Performance Computing and Networking, HPCN 1998

作者： Peddemors, A. Hertzberger, L.O. University of Amsterdam Department of Computer Science Computer Architecture and Parallel Systems Group Kruislaan 403 1098 SJ Amsterdam Netherlands

ISBN: (纸本)3540644431

Using a distributed database system as part of a distributed web server architecture has obvious advantages. It is shown that a first phase distributed database system can be build by extending an existing object oriented database system with application specific additions. A web database is implemented, as part of a traditional HTTP based distributed web server, using this distributed database system. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Distributed database systems

来源：评论

学校读者我要写书评

暂无评论

City Models: Past, Present and Future Prospects

arXiv

引用

arXiv 2025年

作者： Ritter, Helge Herzog, Otthein Rothermel, Kurt Cohn, Anthony G. Wu, Zhiqiang College of Architecture and Urban Planning Tongji University 1239 Siping Road Shanghai200092 China Faculty of Technology Bielefeld University Universitätsstr.25 Bielefeld33615 Germany Institute of Parallel and Distributed Systems University of Stuttgart Universitätsstr. 38 Stuttgart70569 Germany FB 03 University of Bremen Bibliotheksstr. 5 Bremen28539 Germany School of Computer Science University of Leeds LeedsLS2 9JT United Kingdom The Alan Turing Institute LondonNW1 2DB United Kingdom

This paper attempts to take a comprehensive look at the challenges of representing the spatio-temporal structures and dynamic processes that define a city’s overall characteristics. For the task of urban planning and urban operation, we take the stance that even if the necessary representations of these structures and processes can be achieved, the most important representation of the relevant mindsets of the citizens are, unfortunately, mostly neglected. After a review of major "traditional" urban models of structures behind urban scale, form, and dynamics, we turn to major recent modeling approaches triggered by recent advances in AI that enable multimodal generative models. Some of these models can create representations of geometries, networks and images, and reason flexibly at a human-compatible semantic level. They provide huge amounts of knowledge extracted from huge collections of text and image documents and cover the required rich representation spectrum including geographic knowledge by different knowledge sources, degrees of granularity and scales. We then discuss what these new opportunities mean for coping with the modeling challenges posed by cities, in particular with regard to the role and impact of citizens and their interactions within the city infrastructure. We propose to integrate these possibilities with existing approaches, such as agent-based models, which opens up new modeling spaces including rich citizen models which are able to also represent social interactions. Finally, we put forward some thoughts about a vision of a "social AI in a city ecosystem" that adds relevant citizen models to state-of-the-art structural and process models. This extended city representation will enable urban planners to establish citizen-oriented planning of city infrastructures, to make them into inviting environments that reconcile and foster human culture, city resilience and sustainability. © 2025, CC BY-NC-ND.

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

Time series mining at petascale performance 35th

Time series mining at petascale performance

引用

35th International Conference on High Performance Computing, ISC High Performance 2020

作者： Raoofy, Amir Karlstetter, Roman Yang, Dai Trinitis, Carsten Schulz, Martin Computer Architecture and Parallel Systems Technical University of Munich Garching Germany IfTA GmbH Puchheim Germany NVIDIA Munich Germany

ISBN: (纸本)9783030507428

The mining of time series data plays an important role in modern information retrieval and analysis systems. In particular, the identification of similarities within and across time series has garnered significant attention and effort over the last few years. For this task, the class of matrix profile algorithms, which create a generic structure that encodes correlations among records and dimensions—the matrix profile—is a promising approach, as it allows simplified post-processing and analysis steps by examining the resulting matrix profile structure. However, it is expensive to create a matrix profile: it requires significant computational power to evaluate the distance among all subsequence pairs in a time series, especially for very long and multi-dimensional time series with a large dimensionality. Existing approaches are limited in their scalability, as they do not target High Performance Computing systems, and—for most realistic problems—are suited only for datasets with a small dimensionality. In this paper, we introduce a novel MPI-based approach for the calculation of a matrix profile for multi-dimensional time series that pushes these limits. We evaluate the efficiency of our approach using an analytical performance model combined with experimental data. Finally, we demonstrate our solution on a 128-dimensional time series dataset of 1 million records, solving 274 trillion sorts at a sustained 1.3 Petaflop/s performance on the SuperMUC-NG system. © Springer Nature Switzerland AG 2020.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

LoRa-Powered Energy-Effcient Object Detection Mechanism in Edge Computing Nodes 6

LoRa-Powered Energy-Effcient Object Detection Mechanism in E...

引用

6th International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud), I-SMAC 2022

作者： Jindal, Anshul Jose, Jiby Mariya Benedict, Shajulin Gerndt, Michael Technical University Munich Computer Architecture and Parallel Systems Germany Indian Institute of Information Technology Kottayam Department of Computer Science and Engg. India

ISBN: (数字)9781665469418

ISBN: (纸本)9781665469418

The ongoing accomplishments in the decades-long realization of computer vision have infused new dimensions in various research areas such as smart mobility, smart healthcare, education, finance, and so forth. Research works relating to automated object detection, deep learning-assisted data pipelines, and energy-efficient end-to-end solutions have enabled newer perceptions among researchers, albeit the existence of challenges. This paper proposes an object detection system using energy-efficient Long Range (LoRA) communication media on edge nodes such as Raspberry Pi, Coral DevBoard, and Nvidia Jetson Nano. The proposed approach utilized energy-efficient methods to collaboratively offload object detection-related tasks such as capturing images, training images, and inferring objects across a compendium of computing nodes using LoRA. In addition, this research study has attempted to reveal the inference capabilities of images on three different edge nodes. The proposed work has achieved a power difference of at least 1.2 watts during the inference period of the deep learning models without challenging the prediction accuracy with respect to the base model. © 2022 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Massively parallel breadth first search using a tree-structured memory model

Massively parallel breadth first search using a tree-structu...

引用

2012 International Workshop on Programming Models and Applications for Multicores and Manycores, PMAM 2012

作者： St. John, Tom Dennis, Jack B. Gao, Guang R. Computer Architecture and Parallel Systems Laboratory University of Delaware United States Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States

ISBN: (纸本)9781450312110

Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be used to perform breadth-first search of large undirected graphs. Overall, the computation can be expressed as a data flow process wherein a set of vertices to be searched is partitioned into a set of sub-domains and processed independently by many concurrent tasks. The main contributions of the paper are listed below. • We present the first case study demonstrating the power of the Fresh Breeze program execution model (PXM) in the exploitation of fine-grain parallelism found in irregular applications such as graph algorithms. • We present a novel parallel breadth-first search algorithm which is fully determinate. • We describe a unique sparse vector representation that represents the set of adjacencies for each vertex. • We provide an experimental study and analysis of our implementation. An estimate is also made of the performance that might be achieved with a massively parallel system built according to Fresh Breeze principles. © 2012 ACM.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

TurboTag: Lookup filtering to reduce coherence directory power 10

TurboTag: Lookup filtering to reduce coherence directory pow...

引用

Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design

作者： Lotfi-Kamran, Pejman Ferdman, Michael Crisan, Daniel Falsafi, Babak Parallel Systems Architecture Lab École Publique Polytechnique Fédérale de Lausanne Switzerland Computer Architecture Lab Carnegie Mellon University United States

ISBN: (纸本)9781450301466

On-chip coherence directories of today's multi-core systems are not energy efficient. Coherence directories dissipate a significant fraction of their power on unnecessary lookups when running commercial server and scientific workloads. These workloads have large working sets that are beyond the reach of on-chip caches of modern processors. Limited to capturing a small part of the working set, private caches retain cache blocks only for a short period of time before replacing them with new blocks. Moreover, coherence enforcement is a known performance bottleneck of multi-threaded software, hence data-sharing in optimized high-performance software is minimal. Consequently, the majority of the accesses to the coherence directory find no sharers in the directory because the data are not available in the on-chip private caches, effectively wasting power on the coherence checks. To improve energy-efficiency for future many-core systems, we propose TurboTag, a filtering mechanism to eliminate needless directory lookups. We analyze full-system traces of server and scientific workloads and find that over 69% of accesses to the directory find no sharers and can be entirely avoided. Taking advantage of this behavior, TurboTag achieves a 58% reduction in the directory's dynamic power consumption. Copyright 2010 ACM.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Realistic Neutral Atom Image Simulation 4

Realistic Neutral Atom Image Simulation

引用

4th IEEE International Conference on Quantum Computing and Engineering, QCE 2023

作者： Winklmann, Jonas Tsevas, Dimitrios Schulz, Martin Computer Architecture and Parallel Systems Technical University of Munich Munich Germany Max Planck Institute of Quantum Optics Quantum Many-Body Systems Division Garching Germany

ISBN: (纸本)9798350343236

Neutral atom quantum computers require accurate single atom detection for the preparation and readout of their qubits. This is usually done using fluorescence imaging. The occupancy of an atom site in these images is often somewhat ambiguous due to the stochastic nature of the imaging process. Further, the lack of ground truth makes it difficult to rate the accuracy of reconstruction algorithms. We introduce a bottom-up simulator that is capable of generating sample images of neutral atom experiments from a description of the actual state in the simulated system. Possible use cases include the creation of exemplary images for demonstration purposes, fast training iterations for deconvolution algorithms, and generation of labeled data for machine-learning-based atom detection approaches. The implementation is available through our GitHub as a C library or wrapped Python package. We show the modeled effects and implementation of the simulations at different stages of the imaging process. Not all real-world phenomena can be reproduced perfectly. The main discrepancies are that the simulator allows for only one characterization of optical aberrations across the whole image, supports only discrete atom locations, and does not model all effects of complementary metal-oxide-semiconductor (CMOS) cameras perfectly. Nevertheless, our experiments show that the generated images closely match real-world pictures to the point that they are practically indistinguishable and can be used as labeled data for training the next generation of detection algorithms. © 2023 IEEE.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：