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

A Fine-grain and scalable set-based cache partitioning through thread classification

TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES 2019年第6期27卷 4269-4283页

作者： Guney, Isa Ahmet Kucuk, Gurhan Yeditepe Univ Fac Engn Dept Comp Engn Istanbul Turkey

As contemporary processors utilize more and more cores, cache partitioning algorithms tend to preserve cache associativity with a finer-grain of control to achieve higher throughput and fairness goals. In this study, we propose a scalable set-based cache partitioning mechanism, which welds an allocation policy and an enforcement scheme together. We also propose a set-based classifier to better allocate partitions to more deserving threads, a fast set redirection logic to map accesses to dedicated cache sets, and a double access mechanism to overcome the performance penalty due to a repartitioning phase. We compare our work to the best line-grain cache partitioning scheme that is available in the literature. Our results show that set-based partitioning improves throughput and fairness by 5.6% and 4.8% on average, respectively. The maximum achievable gains are as high as 33% in terms of throughput and 23% in terms of fairness.

关键词： Cache memory partitioning algorithms multicore processing

来源：评论

学校读者我要写书评

暂无评论

partitioning Graph Clustering With User-Specified Density

引用

IEEE ACCESS 2023年 11卷 122273-122294页

作者： Tariq, Rohi Lavangnananda, Kittichai Bouvry, Pascal Mongkolnam, Pornchai King Mongkuts Univ Technol Thonburi Sch Informat Technol Bangkok 10140 Thailand Univ Luxembourg Fac Sci Technol & Med Dept Comp Sci L-4365 Esch Sur Alzette Luxembourg

Graph clustering has attracted many interests in recent years, with numerous applications ranging from the clustering of computer networks to the detection of social communities. It presents a challenging NP-class problem, and as a result, numerous algorithms have been developed, each tailored to specific objectives and quality metrics for evaluation. This research commences by categorizing existing graph clustering algorithms based on two distinct perspectives: parameter-free algorithms and user-defined or adjustable parametric algorithms. Quality metrics are further categorized into three distinct groups: internal connectivity, external connectivity, and a combination of both. If a task can be represented by a simple undirected and unweighted graph, from a management and deployment of resources perspective, having clusters of some kind of similar density is advantageous as it allows efficient management. This research introduces a partitioning graph clustering algorithm that allows users to specify the desired density of a cluster by means of 'relative density'. Clustering process involves the determination of all triangles (i.e., smallest cliques) and selecting a clique as an initial cluster. The expansion of a cluster is done by adding adjacent cliques while the required relative density is monitored. Existing metrics are found unsuitable for evaluating the proposed method;therefore, a suitable new metric, the Mean Relative Density Deviation Coefficient (MRDDC), is introduced.

关键词： Clustering algorithms Measurement partitioning algorithms Tuning Taxonomy Task analysis Monitoring Quality assurance Graph clustering mean relative density deviation coefficient (MDRCC) NP problem partitioning graph clustering quality metric relative density

来源：评论

学校读者我要写书评

暂无评论

Decentralized spatial partitioning for multi-vehicle systems in spatiotemporal flow-field

引用

AUTOMATICA 2014年第9期50卷 2389-2396页

作者： Bakolas, Efstathios Univ Texas Austin Dept Aerosp Engn & Engn Mech Austin TX 78712 USA

We consider the problem of characterizing a generalized Voronoi diagram/partition of a convex polygon in a two-dimensional Euclidean space that encodes information about the proximity relations between a team of aerial/marine vehicles and arbitrary points in the partition space. These proximity relations are determined by the time required for each vehicle to reach an arbitrary point (time-to-go) in the partition space when driven by a locally optimal feedback control law in the presence of a spatiotemporal drift field. The main contribution of this work is the presentation of a partitioning algorithm, which is decentralized, in the sense that each vehicle can independently compute its corresponding cell from the generalized Voronoi partition without computing or receiving information about the cells of the other vehicles. Finally, we present numerical simulations using data from real drift fields to illustrate the key features of the decentralized solution to the proposed class of spatial partitioning problems. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Autonomous agents Voronoi diagrams partitioning algorithms Multi-vehicle systems Computational methods

来源：评论

学校读者我要写书评

暂无评论

Towards Optimal Matrix partitioning for Data Parallel Computing on a Hybrid Heterogeneous Server

引用

IEEE ACCESS 2021年 9卷 17229-17244页

作者： Malik, Tania Lastovetsky, Alexey Univ Coll Dublin Sch Comp Sci Dublin D04 V1W8 4 Ireland

Optimal partitioning of a square computational domain over several heterogeneous processors, balancing the load of the processors and minimizing the inter-processor communication cost, is crucial for data parallel dense linear algebra and other applications having similar communication pattern on modern hybrid servers. Although a solution has been found for two processors, the cases of three and more processors are still open. The state of-the-art solution for three processors uses an approximation communication cost function which fails to accurately account for the total amount of data moved between processors, leaving thus the question of its global optimality unanswered. In this work, we formulate and solve a mathematical problem of optimal partitioning a real-valued square over three heterogeneous processors using a new cost function, which accurately accounts for the total amount of data communicated between processors. We also develop an original method for accurate experimental evaluation of the communication time of data movement between memories of the compute devices in the hybrid platform during the execution of data parallel applications. We successfully use this method in the experimental validation of our mathematical results. Finally, we propose a communication energy model predicting the dynamic energy consumption of data movement between processors and experimentally validate its accuracy. This model predicts, and the experiments confirm, that the performance-optimal partition is not necessarily energy optimal.

关键词： Program processors Shape partitioning algorithms Computational modeling Approximation algorithms Mathematical model Data models Data partitioning communication optimization non-rectangular partitioning matrix multiplication heterogeneous computing performance model data parallelism energy model energy of communication

来源：评论

学校读者我要写书评

暂无评论

Open issues for partitioning clustering methods: an overview

引用

WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY 2014年第3期4卷 161-177页

作者： Barioni, Maria Camila N. Razente, Humberto Marcelino, Alessandra M. R. Traina, Agma J. M. Traina, Caetano, Jr. Univ Fed Uberlandia Dept Comp Sci Uberlandia MG Brazil Univ Fed Abc Santo Andre Brazil Univ Sao Paulo Dept Comp Sci Sao Carlos SP Brazil

Over the last decades, a great variety of data mining techniques have been developed to reach goals concerning Knowledge Discovery in Databases. Among them, cluster detection techniques are of major importance. Although these techniques have already been largely explored in the scientific literature, there are at least two important open issues: the existent algorithms are not scalable for large high-dimensional datasets, and the unsupervised nature of traditional data clustering makes it very difficult to generate meaningful clusters. This article presents an overview of the strategies being explored in order to deal more deeply with these issues. Moreover, it describes a new semi-supervised clustering strategy that exemplifies the integration of several approaches and that can be employed with partitioning algorithms, such as PAM and Clarans. The technique addresses an improvement to these types of algorithms, which is obtained by using must-link feedback information provided by the users in an interactive and visual environment. WIREs Data Mining Knowl Discov 2014, 4:161-177. doi: 10.1002/widm.1127 Conflict of interest: The authors have declared no conflicts of interest for this article. For further resources related to this article, please visit the .

关键词： Technology Clustering methods Interactive feedback information data mining data clustering Conflict (Psychology) partitions partitioning algorithms Conflict of Interest inspection technique Visual Environment Database

来源：评论

学校读者我要写书评

暂无评论

partitioning UNSTRUCTURED COMPUTATIONAL GRAPHS FOR NONUNIFORM AND ADAPTIVE ENVIRONMENTS

引用

IEEE PARALLEL & DISTRIBUTED TECHNOLOGY 1995年第3期3卷 63-69页

作者： KADDOURA, M OU, CW RANKA, S Syracuse University United States

The computational structure of irregular and loosely synchronous data-parallel applications can be described in terms of computational graphs. This article describes how to map computational graphs on a nonuniform and... 详细信息

关键词： Clustering algorithms partitioning algorithms High performance computing Concurrent computing Workstations Chaos Computer networks Computer architecture Virtual machining Production facilities

来源：评论

学校读者我要写书评

暂无评论

DNNSplit: Latency and Cost-Efficient Split Point Identification for Multi-Tier DNN partitioning

引用

IEEE ACCESS 2024年 12卷 80047-80061页

作者： Kayal, Paridhika Leon-Garcia, Alberto Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada

Due to the high computational demands inherent in Deep Neural Network (DNN) executions, multi-tier environments have emerged as preferred platforms for DNN inference tasks. Previous research on partitioning strategies for DNN models typically involved leveraging all layers of the DNN to identify optimal splits aimed at reducing latency or cost. However, due to their computational complexity, these approaches face scalability issues, particularly with models containing hundreds of layers. The novelty of our work lies in uniquely identifying specific split points within various DNN models that consistently lead to efficient latency or cost partitioning. Under the assumption that per unit computing cost decreases in higher tiers and that bandwidth is not free, we show that only these specific split points need to be considered to optimize latency or cost. Importantly, these split points are independent of different infrastructure configurations and bandwidth variations. The key contribution of our work is the significant reduction in the computational complexity of DNN partitioning, making our strategy applicable to models with a large number of layers. Introducing DNNSplit, an adaptive strategy, enables dynamic split decisions in varying conditions with the least complexity. Evaluated across nine DNN models varying in size and architecture, DNNSplit exhibits exceptional effectiveness in optimizing latency and cost. Even for a more substantial model containing 517 layers, it identifies only 5 points as potential split points, thereby reducing the partitioning complexity by more than 100x. This makes DNNSplit especially advantageous for managing larger models. DNNSplit also demonstrates significant improvements for multi-tier deployments compared to single-tier execution, including up to 15x latency speedup, 20x cost reduction, and 5x throughput enhancement.

关键词： Costs Computational modeling Adaptation models partitioning algorithms Complexity theory Inference algorithms Quality of service Cost-efficient multi-tier near-edge

来源：评论

学校读者我要写书评

暂无评论

Geometric partitioning Mode in Versatile Video Coding: Algorithm Review and Analysis

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2021年第9期31卷 3603-3617页

作者： Gao, Han Esenlik, Semih Alshina, Elena Steinbach, Eckehard Huawei Technol D-80992 Munich Germany Tech Univ Munich Dept Elect & Comp Engn D-80333 Munich Germany

This paper presents an overview of the geometric partitioning mode (GPM) algorithm that is a part of the most recent Versatile Video Coding (VVC) standard. The GPM algorithm aims to increase the partitioning precision of moving objects using non-rectangular and asymmetric rectangular partitions on top of the conventional rectangular block partitioning structure of VVC. Novel features of GPM contributing to the increase in coding efficiency and the reduction in encoder and decoder complexity are detailed and analyzed in this paper. Evaluated with VVC test model version 8.0 under the joint video experts team common test conditions, experimental results show that the presented GPM algorithm provides luma Bjontegaard Delta rate reduction of 0.70% for random access and of 1.55% for low delay with B slices configurations, with roughly 3% to 5% additional encoding time and negligible decoder runtime change. Furthermore, as GPM provides more precise partitions for the boundaries of the moving objects, an improvement of visual quality is seen in GPM coded sequences.

关键词： Encoding Decoding partitioning algorithms Complexity theory Video coding Standards Motion segmentation Geometric partitioning mode (GPM) interpicture prediction joint video experts team (JVET) partitioning versatile video coding (VVC) video compression

来源：评论

学校读者我要写书评

暂无评论

A Streaming Graph partitioning Method to Achieve High Cohesion and Equilibrium via Multiplayer Repeated Game

引用

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2024年第1期11卷 803-814页

作者： Sun, Zhipeng Zeng, Guosun Ding, Chunling Cheng, Tengteng Tongji Univ Dept Comp Sci & Technol Key Lab Embedded Syst & Serv Comp Minist Educ Shanghai 201804 Peoples R China Tongji Univ Coll Chem Sci & Engn Shanghai 201804 Peoples R China

With the advent of 5G era, Internet-of-Things will become possible, and a large amount of correlative data, namely the streaming graph (SG), is continuously generated in various application fields, which poses a great challenge to analyze and make good use of such graph data. The balanced partition of a big graph, especially a dynamic SG, has always been basic research in graph theory, and there are many classical methods. However, this article explores a novel method, that is, an SG k-way partitioning via a multiplayer repeated game so as to realize the equilibrium of the total number of nodes in different partitions and achieve high cohesion or low edge-cut in each partition. We regard the SG partitioning process during each time window as a multiplayer game process, treat k target partitions as game players, and use all possible actions that players select new nodes as the strategy set. Some effective constraints are given to reduce the strategy space and accelerate the game process. Moreover, we define equilibrium degree (ED) and modularity degree (MD), which are used to design the utility function of game players. All game players finally reach the Nash equilibrium via multiplayer repeated games. At this time, each player corresponds to a strategy. Under the guidance of these strategies, the new nodes are added to each target partition, and then the goal of optimal partitioning is achieved. The above operations are carried out in each time window. The subsequent time windows can reuse the partitioning results of the previous time window in order to realize dynamic incremental partitioning for an SG. Extensive experiments indicate that while ensuring the partition quality of an SG, our proposed algorithm also greatly improves the speed of online partitioning. Even compared with the state-of-the-art SG partitioning algorithm PLDG, our algorithm still obtains better performance.

关键词： Games partitioning algorithms Game theory Sun Heuristic algorithms Computational modeling Cloud computing modularity degree (MD) of a graph multiplayer repeated game k-way equilibrium partitioning Nash equilibrium streaming graph (SG)

来源：评论

学校读者我要写书评

暂无评论

Rectangular Pyramid partitioning Using Integrated Depth Sensors (RAPPIDS): A Fast Planner for Multicopter Navigation

引用

IEEE ROBOTICS AND AUTOMATION LETTERS 2020年第3期5卷 4626-4633页

作者： Bucki, Nathan Lee, Junseok Mueller, Mark W. Univ Calif Berkeley High Performance Robot Lab Berkeley CA 94709 USA

We present RAPPIDS: a novel collision checking and planning algorithm for multicopters that is capable of quickly finding local collision-free trajectories given a single depth image from an onboard camera. The primary contribution of this work is a new pyramid-based spatial partitioning method that enables rapid collision detection between candidate trajectories and the environment. By leveraging the efficiency of our collision checking method, we shown how a local planning algorithm can be run at high rates on computationally constrained hardware, evaluating thousands of candidate trajectories in milliseconds. The performance of the algorithm is compared to existing collision checking methods in simulation, showing our method to be capable of evaluating orders of magnitude more trajectories per second. Experimental results are presented showing a quadcopter quickly navigating a previously unseen cluttered environment by running the algorithm on an ODROID-XU4 at 30 Hz.

关键词： Trajectory Planning Sensors partitioning algorithms Cameras Space vehicles Navigation Reactive and sensor-based planning collision avoidance aerial systems perception and autonomy motion and path planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：