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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,240 篇 会议
8 篇 期刊文献
1 册 图书

馆藏范围

1,249 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

706 篇 工学
- 633 篇 计算机科学与技术...
- 316 篇 软件工程
- 248 篇 电气工程
- 232 篇 信息与通信工程
- 159 篇 仪器科学与技术
- 33 篇 电子科学与技术（可...
- 31 篇 控制科学与工程
- 11 篇 生物工程
- 9 篇 生物医学工程（可授...
- 7 篇 动力工程及工程热...
- 6 篇 机械工程
- 6 篇 光学工程
- 6 篇 石油与天然气工程
- 6 篇 网络空间安全
- 5 篇 土木工程
- 5 篇 交通运输工程
- 4 篇 建筑学
72 篇 理学
- 45 篇 数学
- 15 篇 物理学
- 11 篇 生物学
- 9 篇 系统科学
- 6 篇 化学
- 4 篇 地球物理学
40 篇 管理学
- 33 篇 管理科学与工程(可...
- 13 篇 工商管理
- 12 篇 图书情报与档案管...
8 篇 医学
- 7 篇 临床医学
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 法学
- 2 篇 社会学
1 篇 农学

主题

147 篇 parallel process...
108 篇 computer archite...
80 篇 computational mo...
67 篇 multicore proces...
66 篇 concurrent compu...
64 篇 hardware
60 篇 application soft...
59 篇 distributed comp...
59 篇 computer network...
57 篇 graphics process...
49 篇 network topology
48 篇 instruction sets
48 篇 kernel
46 篇 routing
44 篇 graphics process...
44 篇 bandwidth
42 篇 protocols
41 篇 delay
38 篇 parallel program...
37 篇 scalability

机构

5 篇 sharif univ tech...
4 篇 department of el...
3 篇 national institu...
3 篇 school of comput...
3 篇 department of in...
3 篇 bauhaus univ wei...
3 篇 departamento de ...
3 篇 department matem...
3 篇 faculty of media...
3 篇 university of ch...
3 篇 cnr ist informat...
3 篇 college of compu...
3 篇 pontifical catho...
3 篇 russian acad sci...
3 篇 abo akad univ fa...
3 篇 pontifical catho...
3 篇 univ fed rio gra...
2 篇 national mobile ...
2 篇 univ coimbra dep...
2 篇 institute for ap...

作者

13 篇 kotenko igor
12 篇 bagherzadeh nade...
7 篇 nader bagherzade...
7 篇 griebler dalvan
6 篇 mencagli gabriel...
6 篇 schepke claudio
6 篇 mauricio marin
6 篇 gross tom
6 篇 saenko igor
6 篇 marco aldinucci
6 篇 danelutto marco
5 篇 ortega julio
5 篇 masoumeh ebrahim...
5 篇 fernandes luiz g...
5 篇 marco danelutto
5 篇 j. duato
5 篇 julio ortega
5 篇 igor kotenko
5 篇 daneshtalab maso...
5 篇 m. danelutto

语言

1,243 篇 英文
4 篇 其他
1 篇 土耳其文
1 篇 中文

检索条件"任意字段=12th Euromicro Conference on Parallel, Distributed and Network-Based Processing"

共 1249 条记录，以下是91-100 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Partition Pruning: parallelization-Aware Pruning for Dense Neural networks 28

Partition Pruning: Parallelization-Aware Pruning for Dense N...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Shahhosseini, Sina Albaqsami, Ahmad Jasemi, Masoomeh Bagherzadeh, Nader Univ Calif Irvine Elect Engn & Comp Sci Dept Irvine CA 92697 USA Sharif Univ Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781728165820

As recent neural networks are being improved to be more accurate, their model's size is exponentially growing. thus, a huge number of parameters requires to be loaded and stored from/in memory hierarchy and computed in processors to perform training or inference phase of neural network processing. Increasing the number of parameters causes a big challenge for real-time deployment since the memory bandwidth improvement's trend cannot keep up with models' complexity growing trend. Although some operations in neural networks processing are computational intensive such as convolutional layer computing, computing dense layers face with memory bandwidth bottleneck. To address the issue, the paper has proposed Partition Pruning for dense layers to reduce the required parameters while taking into consideration parallelization. We evaluated the performance and energy consumption of parallel inference of partitioned models, which showed a 7.72x speedup of performance and a 2.73x reduction in the energy used for computing pruned fully connected layers in TinyVGG16 model in comparison to running the unpruned model on a single accelerator. Besides, our method showed a limited reduction in accuracy while partitioning fully connected layers.

关键词： parallelization Deep Neural network Pruning Partitioning Hardware Accelerator

来源：评论

学校读者我要写书评

暂无评论

DSPG: Decentralized Simultaneous Perturbations Gradient Descent Scheme 28

DSPG: Decentralized Simultaneous Perturbations Gradient Desc...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Ramaswamy, Arunselvan Paderborn Univ Dept Elect & Comp Sci Engn D-33098 Paderborn Germany

ISBN: (纸本)9781728165820

distributed descent-based methods are an essential toolset to solving optimization problems in multi-agent system scenarios. Here the agents seek to optimize a global objective function through mutual cooperation. Oftentimes, cooperation is achieved over a wireless communication network that is prone to delays and errors. there are many scenarios wherein the objective function is either non-differentiable or merely observable. In this paper, we present a cross-entropy based distributed stochastic approximation algorithm (SA) that finds a minimum of the objective, using only samples. We call this algorithm Decentralized Simultaneous Perturbation Stochastic Gradient, with Constant Sensitivity Parameters (DSPG). this algorithm is a two fold improvement over the classic Simultaneous Perturbation Stochastic Approximations (SPSA) algorithm. Specifically, DSPG allows for (i) the use of old information from other agents and (ii) easy implementation through the use simple hyper-parameter choices. We analyze the biases and variances that arise due to these two allowances. We show that the biases due to communication delays can be countered by a careful choice of algorithm hyper-parameters. the variance of the gradient estimator and its effect on the rate of convergence is studied. We present numerical results supporting our theory. Finally, we discuss an application to the stochastic consensus problem.

关键词： distributed optimization distributed approximate gradient method cross-entropy based gradient approximation optimization over networks with unbounded delays

来源：评论

学校读者我要写书评

暂无评论

Adaptive Load Balancing based on Machine Learning for Iterative parallel Applications 28

Adaptive Load Balancing based on Machine Learning for Iterat...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Oikawa, Anna Victoria C. R. Freitas, Vinicius Castro, Marcio Pilla, Laercio L. Fed Univ Santa Catarina UFSC Florianopolis SC Brazil Univ Paris Saclay CNRS LRI Orsay France

ISBN: (纸本)9781728165820

the performance of irregular scientific applications can be easily affected by an uneven distribution of work among the computing resources. In this context, Load Balancing (LB) stands as one of the most important solutions to improve resource utilization. However, choosing the best-performing load balancing algorithm for a given application is not a trivial task. For instance, manually and statically choosing an LB algorithm does not work in situations where applications have a dynamic or unknown behavior. In this context, we propose a Machine Learning-based Adaptive Load Balancer (ADAPTIVELB) to automate the load balancing algorithm decision at run time. this approach monitors and collects information about the application dynamically, and according to the analyzed data, it makes a decision of invoking the most suitable LB algorithm. Our experiments show that ADAPTIVELB can select a good load balancing algorithm in most of the cases, leading to performance improvements over statically chosen LB algorithms and over the absence of a load balancer.

关键词： dynamic load balancing machine learning performance

来源：评论

学校读者我要写书评

暂无评论

TLB-based Block-Grain Classification of Private Data 28

TLB-based Block-Grain Classification of Private Data

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Upadhyay, Bhargavi R. Ros, Alberto Murty, N. S. Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Comp Sci & Engn Bengaluru India Univ Murcia Dept Ingn & Tecnol Comp Murcia Spain Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Elect & Commun Engn Bengaluru India

ISBN: (纸本)9781728165820

Sequential and parallel applications use most of the data as private in a multicore system. Recent proposals made use of this observation to reduce the area of the coherence directories or the memory access latency. the driving force of these proposals is the classification of private/shared memory data. the effectiveness of these proposals depends on the number of detected private data. the existing proposals perform the private/shared classification at page granularity, leading to a noticeable amount of miss-classified memory blocks. We propose a mechanism that works on block granularity using the translation lookaside buffer (TLB) to make accurate detection of private data, which increases the effectiveness of proposals relying on a private/shared classification. Simulation results show that the block-grain approach obtains 17.0% more accessed private miss data than the page-grain approach, which translates to an improvement in system performance by 6.02% compared to a page-grain approach.

关键词： directory-based cache coherence private/shared classification system performance

来源：评论

学校读者我要写书评

暂无评论

F2MH Cryptosystem: Preliminary analysis of an original attempt to revive Knapsack-based public-key encryption schemes 28

F2MH Cryptosystem: Preliminary analysis of an original attem...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Villas Boas, Yuri da Silva Rocha, Daniel Santana de Barros, Charles F. Martina, Jean Everson Univ Fed Santa Catarina Inst Informat & Stat Florianopolis SC Brazil Inst Pure & Appl Math Rio De Janeiro Brazil Fed Univ Sdo Jodo Del Rey Dept Comp Sci Sao Joao Del Rei Brazil

ISBN: (数字)9781728165820

ISBN: (纸本)9781728165820

Public-key cryptography is an ubiquitous building-block of modern telecommunication technology. Among the most historically important types, the knapsack-based encryption schemes, from the early years of public-key cryptography, performed particularly well in computational resources (time and memory), and mathematical and algorithmic simplicity. Although their widespread adoption was readily curtailed by effective cryptanalyses to several different attempts, the question of whether or not there is any future for actual usage of knapsack-based asymmetric encryption schemes, and all its potential advantages remains unsettled. the goal of this paper is to present a novel construction, which offer consistent security improvements on knapsack-based cryptography. We propose two improvements upon the original knapsack cryptosystem that address the most important types of attacks: the Diaphantine approximations-based attacks and the lattice problems oracle attacks. the proposed defenses demonstrably preclude the aforementioned types of attacks.

关键词： Knapsack Problem Subset Sum Problem Public-Key Cryptosystem Merkle-Hellman Cryptosystem Lattice Oracle Diophantine Approximation Shamir Cryptanalysis

来源：评论

学校读者我要写书评

暂无评论

Efficient On-Chip Multicast Routing based on Dynamic Partition Merging 28

Efficient On-Chip Multicast Routing based on Dynamic Partiti...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Tiwari, Binayak Yang, Mei Jiang, Yingtao Wang, Xiaohang Univ Nevada Dept Elect & Comp Engn Las Vegas NV 89154 USA South China Univ Technol Sch Software Engn Guangzhou Peoples R China

ISBN: (纸本)9781728165820

networks-on-chips (NoCs) have become the mainstream communication infrastructure for chip multiprocessors (CMPs) and many-core systems. the commonly used parallel applications and emerging machine learning-based applications involve a significant amount of collective communication patterns. In CMP applications, multicast is widely used in multithreaded programs and protocols for barrier/clock synchronization and cache coherence. Multicast routing plays an important role on the system performance of a CMP. Existing partition-based multicast routing algorithms all use static destination set partition strategy which lacks the global view of path optimization. In this paper, we propose an efficient Dynamic Partition Merging (DPM)-based multicast routing algorithm. the proposed algorithm divides the multicast destination set into partitions dynamically by comparing the routing cost of different partition merging options and selecting the merged partitions with lower cost. the simulation results of synthetic traffic and PARSEC benchmark applications confirm that the proposed algorithm outperforms the existing path-based routing algorithms. the proposed algorithm is able to improve up to 23% in average packet latency and 14% in power consumption against the existing multipath routing algorithm when tested in PARSEC benchmark workloads.

关键词： networks-on-Chip (NoCs) Multicast Routing Algorithm Dynamic Partition Merging

来源：评论

学校读者我要写书评

暂无评论

Mapping Method of MATLAB/Simulink Model for Embedded Many-Core Platform 28

Mapping Method of MATLAB/Simulink Model for Embedded Many-Co...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Honda, Kentaro Kojima, Sasuga Fujimoto, Hiroshi Edahiro, Masato Azumi, Takuya Saitama Univ Grad Sch Sci & Engn Saitama Japan Osaka Univ Grad Sch Engn Sci Suita Osaka Japan Technol Headquarters eSOL Co Ltd Tokyo Japan Nagoya Univ Grad Sch Informat Nagoya Aichi Japan

ISBN: (纸本)9781728165820

Multi-/many-core processors are being increasingly used to reduce power consumption and improve performance. In addition, the use of Model-based Development for embedded systems has been increasing. Relative to these trends, Model-based parallelizer (MBP) has an essential role in parallelizing applications (i e, Simulink blocks) at the model level. MBP maps Simulink blocks to cores using various types of information such as block characteristics, a C code, and the multi-/many-core hardware implementation. However, MBP does not consider many-core hardware with cluster structures. this paper proposes an algorithm that decides on core allocations by considering cluster structures. the proposed algorithm combines two other algorithms: one algorithm uses the core allocation of MBP and path analysis at the clusterlevel and considers the influence of communication contention to decide on cluster allocations, and the other algorithm uses the results of MBP and remaps cluster allocations. the proposed algorithm produces better results than its component algorithms could separately. Evaluations demonstrate that the proposed algorithm obtained the better results than the existing method in terms of execution time on random and real models.

关键词： Embedded Systems Model-based Development Multi-/Many-core

来源：评论

学校读者我要写书评

暂无评论

Accelerating Deep Learning using Multiple GPUs and FPGA-based 10GbE Switch 28

Accelerating Deep Learning using Multiple GPUs and FPGA-Base...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Itsubo, Tomoya Koibuchi, Michihiro Amano, Hideharu Matsutani, Hiroki Keio Univ Kohoku Ku 3-14-1 Hiyoshi Yokohama Kanagawa 2238522 Japan Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan

ISBN: (数字)9781728165820

ISBN: (纸本)9781728165820

A back-propagation algorithm following a gradient descent approach is used for training deep neural networks. Since it iteratively performs a large number of matrix operations to compute the gradients, GPUs (Graphics processing Units) are efficient especially for the training phase. thus, a cluster of computers each of which equips multiple GPUs can significantly accelerate the training phase. Although the gradient computation is still a major bottleneck of the training, gradient aggregation and parameter optimization impose both communication and computation overheads, which should also be reduced for further shortening the training time. To address this issue, in this paper, multiple GPUs are interconnected with a PCI Express (PCIe) over 10Gbit Ethernet (10GbE) technology. Since these remote GPUs are interconnected via network switches, gradient aggregation and optimizers (e.g., SGD, Adagrad, Adam, and SMORMS3) are offloaded to an FPGA-based network switch between a host machine and remote GPUs;thus, the gradient aggregation and optimization are completed in the network. Evaluation results using four remote GPUs connected via the FPGA-based 10GbE switch that implements the four optimizers demonstrate that these optimization algorithms are accelerated by up to 3.0x and 1.25x compared to CPU and GPU implementations, respectively. Also, the gradient aggregation throughput by the FPGA-based switch achieves 98.3% of the 10GbE line rate.

关键词： Optimization Switches Training Graphics processing units Acceleration Machine learning Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Acceleration of Radiofrequency Ablation Process for Liver Cancer Using GPU 28

Acceleration of Radiofrequency Ablation Process for Liver Ca...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Schepke, Claudio Miletto, Marcelo Cogo Fed Univ Pampa UNIPAMPA Lab Estudos Avancados LEA Campus Alegrete BR-97546550 Alegrete Brazil Fed Univ Rio Grande Sul UFRGS Grp Proc Paralelo & Distribuido GPPD Campus Vale BR-91509900 Porto Alegre RS Brazil

ISBN: (纸本)9781728165820

Computational simulation is a technique used in several research areas. In medicine, the Radiofrequency Ablation Finite Element Method (RAFEM) application was developed to simulate the RadioFrequency Ablation (RFA) process, which is a medical procedure to treat hepatic cancer. this application presents a high computational time to perform a simulation, taking up to 20 hours for simulation while the RFA procedure itself lasts from four to six minutes. Some efforts have already been carried out to obtain better performance for the application. However, none of them considered the use of GPUs, which is an architecture that can be used to accelerate finite element method applications. this work aims to propose a parallelization approach to explore ways to obtain better performance for the application through the use of GPUs to reduce the execution time under a few minutes. We adopted an iterative development process to coordinate and to generate parallel versions of the code. through this process allied to the use of GPU-accelerated code libraries, it was possible to create different versions of the application, adding improvements to each one. the results obtained with the best version showed a reduction of the computation time by up to 18 times. therefore, this improvement makes the use of RAFEM application more feasible in health treatment by reducing the waiting time for the results.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Off-Chip Congestion Management for GPU-based Non-Uniform processing-in-Memory networks 28

Off-Chip Congestion Management for GPU-based Non-Uniform Pro...

引用

28th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Punniyamurthy, Kishore Gerstlauer, Andreas Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781728165820

Advancements in packaging and 3D-stacking technology have enabled novel non-uniform processing-in-memory (NUPIM) architectures integrating a network of hybrid modules each with varying sizes and proportions of compute and memory. In such systems, network congestion can have a significant impact on performance and energy-efficiency scaling. At the same time, NUPIM systems often have strict power and thermal constraints, where traditional routing/redundancy or buffering based approaches to reduce congestion cannot be applied. In this paper, we propose a low-overhead yet scalable scheme for congestion management in off-chip networks of emerging GPU-based NUPIM systems. We note that congestion in NUPIM networks exhibits a form of tree saturation in which individually congested links form congested paths, where congestion effects due to back pressure vary across paths. Additionally, memory responses can have different performance impact due to memory divergence. Our approach exploits differences in performance impact of NUPIM traffic to mitigate congestion effects. We dynamically track congested paths and divergent data to manage priorities and accelerate performance-critical traffic. We further use critical paths knowledge to dynamically manage link widths and save I/O energy. Results show that our congestion management outperforms a configuration with double the number of virtual channels and buffers indicating its effectiveness in managing congestion under stringent constraints. It improves performance by 15% (and up to 31%) over baseline and 10% (and up to 29%) against a memory distance based approach for congestion-affected benchmarks. Our scheme reduces 78% of I/0 energy on average and up to 29% of system energy across all benchmarks.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共125页 << < 6 7 8 9 10 11 12 13 14 15 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：