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

37th IEEE International System-on-Chip Conference, SOCC 2024

作者： Liu, Shuang Radetzki, Martin University of Stuttgart Embedded Systems Institute of Computer Architecture and Computer Engineering Stuttgart Germany

ISBN: (纸本)9798350377569

Chiplet-based systems have become prominent in large systems-on-Chips (SoCs) as a means to mitigate increasing design costs. However, the integration of multiple chiplets introduces new challenges in the interconnection network, potentially leading to deadlocks. In this paper, we propose an Integer Linear Programming (ILP) based design approach to address this issue. Our method considers various design factors for deadlock-free routing, such as topology, latency, load balancing, path diversity, and fault tolerance, applicable to both general-purpose chiplets and application-specific chiplets. It facilitates the determination of optimal turn restrictions for general-purpose chiplets or constructs optimal deadlock-free routing paths for application-specific chiplets if the communication patterns are known. The results demonstrate the capability of the method to find optimal solutions under various design considerations. © 2024 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Matching Traffic Lights to Routes for Real-World Deployments of Mobile GLOSA Apps 8

Matching Traffic Lights to Routes for Real-World Deployments...

引用

8th IEEE International Smart Cities Conference, ISC2 2022

作者： Matthes, Philipp Springer, Thomas Institute of Systems Architecture Computer Networks United States

ISBN: (数字)9781665485616

ISBN: (纸本)9781665485616

Green Light Optimized Speed Advisory (GLOSA) apps provide speed recommendations for drivers to pass traffic lights during their green phases. In this way, the comfort and efficiency of traveling can be significantly improved. Thus, GLOSA apps are a valuable contribution to smart mobility. Mobile GLOSA apps provide an attractive alternative to static info signs, but they need to anticipate upcoming traffic lights that the vehicle will pass. While this imposes no challenge for predominating research within simulation or test track environments, real-world deployments need to correctly match a few from thousands of traffic lights to a route. In this paper, we discuss in a novel approach that MAP topologies, an international ETSI standard for turn geometries of traffic lights, can be used to perform this matching. However, routing is usually performed on public map data, which is not aligned with the MAP topologies. We explore two computational methods, specifically map-matching as preprocessing for adjacency lookup and topologic feature matching, that account for discrepancies between the MAP topologies and the route. We show that the core problem can be addressed using these algorithms to enable large-area deployments of real-world mobile GLOSA apps. In a comparative evaluation, the topologic feature matching technique achieved an F1 score of 89.5%, while the map-matched adjacency lookup method only achieved an F1 score of 48.3%. We analyze this performance gap and conclude further research directions. © 2022 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Selecting Resource-Efficient ML Models for Transport Mode Detection on Mobile Devices

Selecting Resource-Efficient ML Models for Transport Mode De...

引用

2022 IEEE International Conference on Internet of Things and Intelligence systems, IoTaIS 2022

作者： Matthes, Philipp Springer, Thomas Institute of Systems Architecture Chair of Computer Networks Tu Dresden Germany

ISBN: (数字)9798350396454

ISBN: (纸本)9798350396454

Processing data closer to the source to minimize latency and the amount of data to be transmitted is a major driver for research on the Internet of Things (IoT). Since data processing in many IoT scenarios heavily depends on machine learning (ML), designing ML models for resource constraint devices at the edge of IoT infrastructures is one of the big challenges. Which ML model performs best highly depends on the problem domain but also on the availability of resources. Thus, to find an appropriate ML model in the broad search space of options, the trade-off between accuracy and resource consumption in terms of memory, CPU, and energy needs to be considered. However, there are ML problems where most current research focuses on accuracy, and the resource consumption of applicable models is not well investigated yet. We show that transport mode detection (TMD) is such a problem and present a case study for designing an ML model running on smartphones. To transform the search for the needle in the haystack into a structured design process, we propose an engineering workflow to systematically evolve ML model candidates, considering portability and resource consumption in addition to model accuracy. At the example of the Sussex-Huawei-Locomotion (SHL) dataset, we apply this process to multiple ML architectures and find a suitable model that convinces with high accuracy and low measured resource consumption for smartphone deployment. We discuss lessons learned, enabling engineers and researchers to use our workflow as a blueprint to identify solutions for their ML problems systematically. © 2022 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Leveraging Hybrid Classical-Quantum Methods for Efficient Load Rebalancing in HPC

Leveraging Hybrid Classical-Quantum Methods for Efficient Lo...

引用

2024 Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC Workshops 2024

作者： Zawalska, Justyna Chung, Minh Rycerz, Katarzyna Schulz, Laura Schulz, Martin Kranzlmuller, Dieter AGH University of Krakow Institute of Computer Science Krakow Poland CYFRONET AGH Academic Computer Center Krakow Poland Garching bei München Germany Chair for Computer Architecture and Parallel Systems Germany MNM-Team Germany

ISBN: (纸本)9798350355543

Load imbalance is a challenge for parallel applications in High Performance Computing (HPC). It is caused by processes having different execution times or load values, leading to idle or wait times at synchronization points, where faster processes must wait for the slowest process to catch up. To mitigate this issue, applications can employ load balancing (LB) strategies, which migrate load between processes to even out load. This is often referred to as the Load Rebalancing Problem (LRP). While many approaches solving the LRP exist, they can only be heuristics and hence further optimization potential exists. In our work, we turn to a novel approach by using hybrid classical-quantum approaches and present two versions of the constrained quadratic model for solving the LRP;the two differ in how they balance the number of qubits required with the types of applied constraints. We compare the quantum-based methods with classical methods using heuristic algorithms Greedy, Karmarkar-Karp, and ProactLB. We evaluate our approaches using imbalance ratio and speedup as metrics, as well as the number of migrated tasks to indicate overhead caused by migrations. Our results show that the quantum-based methods outperform the classic methods. For example, we need only 1/4 of the number of migrated tasks in a realistic use case compared with classical methods, particularly Greedy and KK, to balance the load. © 2024 IEEE.

关键词： CQM HPC HPCQC integration Load Rebalancing Quantum Computing task migration

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Large Language Model-Based Optimization for System-Level Test Program Generation 37

Large Language Model-Based Optimization for System-Level Tes...

引用

37th IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology systems, DFT 2024

作者： Schwachhofer, Denis Domanski, Peter Becker, Steffen Wagner, Stefan Sauer, Matthias Pfluger, Dirk Polian, Ilia Institute of Computer Engineering and Computer Architecture University of Stuttgart Stuttgart Germany Institute of Software Engineering University of Stuttgart Stuttgart Germany Institute for Parallel and Distributed Systems University of Stuttgart Stuttgart Germany Technical University of Munich Heilbronn Germany Advantest Europe Boeblingen Germany

ISBN: (纸本)9798350366884

System-Level Test (SLT) is essential for testing integrated circuits, focusing on functional and non-functional properties of the Device under Test (DUT). Traditionally, test engineers manually create tests with commercial software to simulate the DUT's end-user environment. This process is both time-consuming and offers limited control over non-functional properties. This paper proposes Large Language Models (LLMs) enhanced by Structural Chain of Thought (SCoT) prompting, a temperature schedule, and a pool of previously generated snippets to generate high-quality code snippets for SLT. We repeatedly query the LLM for a better snippet using previously generated snippets as examples, thus creating an iterative optimization loop. This approach can automatically generate snippets for SLT that target specific non-functional properties, reducing time and effort. Our findings show that this approach improves the quality of the generated snippets compared to unstructured prompts containing only a task description. © 2024 IEEE.

关键词： Functional Test Large Language Models Optimization System-Level Test Test Generation

来源：评论

学校读者我要写书评

暂无评论

Exploring the Use of WebAssembly in HPC 23

Exploring the Use of WebAssembly in HPC

引用

28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023

作者： Chadha, Mohak Krueger, Nils John, Jophin Jindal, Anshul Gerndt, Michael Benedict, Shajulin Computer Architecture and Parallel Systems Technische Universität München Germany Department of Computer Science and Engg. Indian and Institute of Information Technology Kottayam Kerala India

ISBN: (纸本)9798400700156

Containerization approaches based on namespaces offered by the Linux kernel have seen an increasing popularity in the HPC community both as a means to isolate applications and as a format to package and distribute them. However, their adoption and usage in HPC systems faces several challenges. These include difficulties in unprivileged running and building of scientific application container images directly on HPC resources, increasing heterogeneity of HPC architectures, and access to specialized networking libraries available only on HPC systems. These challenges of container-based HPC application development closely align with the several advantages that a new universal intermediate binary format called WebAssembly (Wasm) has to offer. These include a lightweight userspace isolation mechanism and portability across operating systems and processor architectures. In this paper, we explore the usage of Wasm as a distribution format for MPI-based HPC applications. To this end, we present MPIWasm, a novel Wasm embedder for MPI-based HPC applications that enables high-performance execution of Wasm code, has low-overhead for MPI calls, and supports high-performance networking interconnects present on HPC systems. We evaluate the performance and overhead of MPIWasm on a production HPC system and AWS Graviton2 nodes using standardized HPC benchmarks. Results from our experiments demonstrate that MPIWasm delivers competitive native application performance across all scenarios. Moreover, we observe that Wasm binaries are 139.5x smaller on average as compared to the statically-linked binaries for the different standardized benchmarks. © 2023 ACM.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Proximity-based service discovery for distributed digital twin systems

引用

Discover Internet of Things 2025年第1期5卷 1-24页

作者： Rothermel, Kurt Herzog, Otthein Zhiqiang, Siegfried Wu Institute Of Parallel and Distributed Systems University of Stuttgart Universitaetsstr. 38 Stuttgart70569 Germany College of Architecture and Urban Planning Tongji University 1239 Siping Road Shanghai200092 China Department of Mathematics and Computer Science University of Bremen Bibliothekstrasse 5 Bremen23884 Germany

Over the past decade, there has been a significant increase in interest in digital twin (DT) technology in a variety of domains. While research on DTs of single assets was initially prevalent, there has been a notable shift towards distributed systems of DTs, which connect to each other to collaborate. Typically, collaboration is enabled by DTs providing services that can be consumed by other DTs. In service-oriented systems, a service is typically identified by type information. However, this is not sufficient in distributed DT systems, where DTs associated with different physical entities may provide the same type of service. Consequently, selecting the appropriate service depends not only on the service type, but also on the associated physical entity. However, requiring DTs to know the mapping of services to their physical environment is not feasible for large dynamic systems. This paper presents a novel proximity-based service discovery method that allows DTs to select services based on service type and their proximity to other objects. That is, service specifications are fully abstracted from the mapping of services to physical objects, relieving DTs from maintaining information about this mapping. Furthermore, service discovery is robust to changes in the physical environment and service population. The proposed service discovery method has been implemented on top of a spatial DBMS. We argue that this implementation is optimal in terms of network utilization and latency, and perform comprehensive evaluations to show the performance of discovery queries as a function of their complexity. © The Author(s) 2025.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

EVOAL: A Domain-Specific Language-Based Approach to Optimisation

EVOAL: A Domain-Specific Language-Based Approach to Optimisa...

引用

2023 IEEE Congress on Evolutionary Computation, CEC 2023

作者： Berger, Bernhard J. Plump, Christina Drechlser, Rolf Institute of Embedded Systems Hamburg University of Technology Hamburg Germany Dfki GmbH-Cyber-Physical Systems Bremen28359 Germany University Bremen - Computer Architecture Bremen28359 Germany

ISBN: (纸本)9798350314588

Adapting optimisation algorithms, such as evolutionary algorithms, to a problem is a necessity. The required collection and exchange of domain information is an important but tedious task in real-world projects involving several experts from different areas of expertise (e.g. the domain and the optimisation area). This paper presents a structured approach that allows the experts to systematically provide their knowledge using domain-specific languages. The presented approach defines a different language for the involved experts that enables them to add their knowledge and use the information provided by other experts. The languages are extensible, allowing the addition of new optimisation aspects without changing the actual language. These languages are the front-end to a versatile open-source optimisation tool, that we built, enabling the actual execution of the optimisation. It additionally provides features for surrogate models as well as data generation and different benchmarks for evaluation. Conducting a user study, we show that the language is suitable to express the domain knowledge and domain experts can use the language to describe their domain knowledge after a short introduction. This way, the approach reduces the effort for domain experts in providing their information. As a side effect, the complete configuration of the optimisation execution through these languages allows an easy and reliable reproduction. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：