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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

548 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

564 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

542 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 564 条记录，以下是221-230 订阅

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

详细简洁

排序：

Genetic Algorithm Based Weight Optimization for Minimizing Sidelobes in distributed Random Array Beamforming

Genetic Algorithm Based Weight Optimization for Minimizing S...

引用

19th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Jayaprakasam, S. Rahim, S. K. A. Leow, Chee Yen Ramanathan, K. R. UTM Wireless Commun Ctr Johor Baharu 81310 Malaysia Intel Microelect M Sdn Bhd BDCM Kulim 09000 Malaysia

ISBN: (纸本)9781479920815

this paper proposes solution to optimize the peak side lobes level (PSLL) in a distributed random antenna array (RAA) when locations of the nodes in the array cannot be manipulated. Using the conventional beamforming method, RAA produces a poor beam pattern with high sidelobe level, which greatly reduces the performance and the efficiency of the antenna. Existing literature focuses on finding the best position of antenna placement in RAA to lower the sidelobes. this is not feasible when the user has no autonomy over the position of the antenna elements. Our proposed solution achieves beampattern with much lower PSLL regardless of the array size and number of nodes in the array. the proposed method also enables up to 40% of energy savings when the size of array is small and 20% of savings when bigger array size is considered.

关键词： antenna radiation patterns genetic algorithms random antenna array side lobe reduction

来源：评论

学校读者我要写书评

暂无评论

An evaluation of the despot scheduling algorithm on small beowulf clusters

An evaluation of the despot scheduling algorithm on small be...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Langton, Barrett D. Andresen, Daniel A. Bowker, Ethan A. Department of Computing 234 Nichols Hall Kansas State University Manhattan KS United States

Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-based, coarse-grained parallel and distributed programming. the DESPOT project is building a sophisticated thread-level resource-monitoring system for computational, storage and network resources [2, 3, 4]. In this paper we present our enhanced scheduling algorithm within DESPOT, our architecture for low-overhead, finegrained resource-monitoring tools for per-process network and other resource usage. this algorithm takes into account network, CPU, and memory demands to go beyond simple load balancing for better performance. We present experimental results on a small Beowulf cluster showing our performance using the multi-facetted DESPOT algorithm, an older version of the algorithm, and the MOSIX default scheduler. Our performance gain over the MOSIX load-balancing implementation in many cases is significant, up to approximately 40%, and usually within 10% in other tests.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scalable Performance of ScaleGraph for Large Scale Graph Analysis

Scalable Performance of ScaleGraph for Large Scale Graph Ana...

引用

19th international conference on High Performance computing (HiPC)

作者： Dayarathna, Miyuru Houngkaew, Charuwat Ogata, Hidefumi Suzumura, Toyotaro Tokyo Inst Technol Dept Comp Sci Tokyo Japan IBM Res Tokyo Japan

ISBN: (纸本)9781467323703;9781467323727

Scalable analysis of massive graphs has become a challenging issue in high performance computing environments. ScaleGraph is an X10 library aimed for large scale graph analysis scenarios. this paper evaluates scalability of ScaleGraph library for degree distribution calculation, betweeness centrality, and spectral clustering algorithms. We make scalability evaluation by analyzing a synthetic Kronecker graph with 40.3 million edges (for all the three algorithms), and a real social network with 69 million edges (for degree distribution calculation) on Tsubame 2.0 distributed memory environment.

关键词： X10 PGAS HPCS large graph analytics reusable libraries programming techniques distributed computing

来源：评论

学校读者我要写书评

暂无评论

High Performance Peer-to-Peer distributed computing with Application to Constrained Two-dimensional Guillotine Cutting Problem

High Performance Peer-to-Peer Distributed Computing with App...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Hifi, Mhand Saadi, Toufik Haddadou, Nawel Univ Picardie JulesVerne Lab MIS Axe Optimisat Discrete & Reoptimisat F-80000 Amiens France

ISBN: (纸本)9780769543284

this paper proposes a parallel peer-to-peer (noted P2P) cooperative algorithm for approximately solving the constrained fixed-orientation two-staged two-dimensional cutting problem. the resolution process is based in three mechanisms: a beam-search search strategy, a strip generation filling procedure, and a upper bound applied for refining the selected paths. the algorithm explores, in parallel, a subset of elite nodes where each processor develops its own path according to its internal lists. the algorithms adapts to the number of processors available on the peer-to-peer platform by backuping the plateform the partial solutions. the computational investigation on the P2Pdc environment shows the good efficiency of the proposed algorithm.

关键词： beam search stategy branch-and-bound cooperative dynamic programming heuristics integer programming peer-to-peer optimization

来源：评论

学校读者我要写书评

暂无评论

A synchronous algorithm for checkpointing in distributed systems

A synchronous algorithm for checkpointing in distributed sys...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Goswami, D. Sahu, S. Dept. of Comp. Sci. and Engineering Indian Institute of Technology Guwahati Guwahati - 781039 India

Nodes in a distributed System are susceptible to failures for many different reasons. In case of such failures the distributed system as a whole needs to be restored to an error free state, existing prior to failure. this restoration is done by rolling back the computation at the nodes to an error free state. To minimize the amount of computation which needs to be rolled back checkpoints or snapshots of a globally consistent state are taken from time to time. We present a synchronous checkpointing algorithm which forces a minimum number of nodes to take a checkpoint. Underlying computation need not be blocked completely during the progress of the algorithm. No additional effort needs to be expended to circumvent the problem of concurrent initiations of the algorithm, since the initiator node assumes the responsibility of completing one instance before another one can be initiated. Since the consistency of the snapshots is ensured at the time the global snapshot is taken, no time needs to be spent during recovery.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

PipePrune: Pipeline parallel Based on Convolutional Layer Pruning for distributed Deep Learning 23

PipePrune: Pipeline Parallel Based on Convolutional Layer Pr...

引用

23rd IEEE international conference on High Performance computing and Communications, 7th IEEE international conference on Data Science and systems, 19th IEEE international conference on Smart City and 7th IEEE international conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Tan, Daojun Jiang, Wenbin Qin, Shang Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology Natl. Eng. Res. Ctr. for Big Data Technol. and Syst. Serv. Comp. Technol. and Syst. Lab Cluster and Grid Comp. Lab Wuhan430074 China

ISBN: (纸本)9781665494571

Benefitting from the combination of the idea of pipeline with model parallelism and data parallelism, pipeline parallelism improves the efficiency of distributed deep learning systems significantly. However, suffering from the bubbles and gaps caused by the imbalance of different stages in pipeline, it can not output ideal performance yet. To explore the potential of pipeline parallelism further, we propose a novel approach called PipePrune, which adds a convolutional layer pruning strategy to pipeline creatively to reduce the bubbles and gaps. For the convolutional layers with heavy overheads, some unimportant kernels are pruned by the measurement of the L1-norm. this approach makes the processing overheads of different pipeline stages more balanced. the experimental results show that, compared with state-of-the-art pipeline methods, PipePrune can improve the training speeds obviously (e.g. for ResNet50 on ImageNet, about 30% speed improvement is realized with only 1.1% loss of training accuracies). © 2021 IEEE.

关键词： Training Deep learning Smart cities Pipelines Neural networks distributed databases parallel processing

来源：评论

学校读者我要写书评

暂无评论

EffiView: Trigger-based Monitoring Approach with Low Cost in SDN 19

EffiView: Trigger-based Monitoring Approach with Low Cost in...

引用

19th IEEE international conference on High Performance computing and Communications (HPCC) / 15th IEEE international conference on Smart City (SmartCity) / 3rd IEEE international conference on Data Science and systems (DSS)

作者： Wang, Binfeng Su, Jinshu Li, Junnan Han, Biao Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China Sci & Technol Parallel & Distributed Lab Changsha Hunan Peoples R China

ISBN: (纸本)9781538625880

With the vigorous development of network applications, typical SDN (Software Defined Networks) such as data centers are gradually carrying more and more complex network traffic. this poses a great challenge for network monitoring - how to realize real-time, high-accuracy capture of traffic changes at low cost. In this paper, we propose a trigger-based monitoring approach called EffiView. this approach provides three ways to monitor flow statistics, including flow-stat triggering, FlowRemoved parsing and active polling. the flow-stat triggering can occur on all multiples of the presupposed flow-stat threshold for each flow entry. the latter two ways are complementary to the flow-stat triggering. FlowRemoved parsing is used to acquire flow statistics from FlowRemoved messages and active polling is conditionally carried out by the controller at the expiration of monitoring period. EffiView achieves low-cost monitoring by combining the three ways efficiently, while ensuring high accuracy and fine granularity. Based on the NetMagic platform, We implement EffiView and evaluate its monitoring performance. the experimental results show that EffiView can reach great advantages over traditional monitoring approaches.

关键词： SDN Network Monitoring Flow-stat triggering Low Cost

来源：评论

学校读者我要写书评

暂无评论

Research on SCKM Algorithm Based on the parallel Clustering 19

Research on SCKM Algorithm Based on the Parallel Clustering

引用

19th Annual IEEE international conference on e-Health Networking, Applications and Services (Healthcom)

作者： Zhang, Min Zang, ZhaoJie Niu, YuJun Shi, Longxiang Dalian Univ Coll Informat & Engn Dalian 116622 Peoples R China Tamkang Univ Coll Sci New Taipei 25137 Taiwan

ISBN: (纸本)9781509067046

As an effective method in dealing with the massive data, the serial processing, aiming to obtain the useful information quickly, cannot satisfy our calculation requirements with high-performance. However, both distributed computing and parallel computing are good choices in calculating high-volume data with high-performance. As a parallel computing framework based on memory computing large data, Spark was of great concern as soon as it was proposed. this paper, based on the limitations of k-medoids algorithm which is sensitive to the center point and requires a large number of iterations in the process of calculating the new center point, puts forward a parallel algorithm named Canopy-Kmedoids within the platform of Spark. the algorithm obtains the K center points by the Canopy algorithm. By analyzing the performance of parallel operators and the advantage of using Spark to have good performance for iterative computation. In addition, this method reduces the frequency of reading or writing the shuffle and disk, which effectively overcomes the shortcomings of k-medoids. the experimental results show that the parallel algorithm achieves a relative ideal speedup ratio and can handle the massive data efficiently as well.

关键词： spark cluster parallel

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of matrix techniques

Parallel implementation of matrix techniques

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Salmerón, Moisés Puntonet, Carlos G. Ortega, Julio Górriz, J.M. Department of Computer Architecture University of Granada Daniel Saucedo s/n Granada Spain Department Electronics University of Cádiz Ramón Puyol s/n Algeciras Spain

We analyze the parallel processing in clusters of computers of a prediction method based on the improvement of Radial Basis Function (RBF) neural networks using matrix decomposition techniques such as the Singular Value Decomposition (SVD) and the QR-cp factorization. parallel processing is required because of the extensive computation found in those techniques, but the reward is obtained in form of better prediction performance and less network complexity. this general prediction procedure (in the sequential version) was published in the technical literature previously, with a high degree of experimental success. parallelism is a convenient way to make this prediction module available for inexpensive operation within decision-making contexts. We discuss two alternatives of concurrency: parallel implementation of the prediction procedure over the ScaLAPACK suite, and the formulation of another parallel routine customized to a higher degree for better performance.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Simulation of level-2 cache locking in multicore parallel computing systems

Simulation of level-2 cache locking in multicore parallel co...

引用

20th iasted international conference on parallel and distributed computing and systems, PDCS 2008

作者： Rani, Manira Asaduzzaman, Abu Koivisto, Darryl Department of Computer Science and Engineering Florida Atlantic University 777 Glades Road SE43-409 Boca Raton FL 33431 United States Architecture Modeling Group Mirabilis Design Inc. 3000 Scott Blvd Santa Clara CA 95054 United States

ISBN: (纸本)9780889867741

In order to fulfill the demands for increased performance / power ratio, most chip-vendors are deploying multicore processors to their product lines. Multicore processors are frequently deployed with multilevel cache memories. parallel thread execution in such a multicore system is difficult as it relates to cache sharing to achieve the best performance. Due to the increased execution time unpredictability, it becomes a challenge to support realtime applications on multicore systems with multilevel caches. Studies show that predictability can be improved using cache locking techniques. However, entire locking at level-1 cache may be inefficient for smaller data size (when compared with the cache size). Also, way locking at level-1 cache is not permitted on some processors (like PowerPC 750GX), but way locking at level-2 cache is possible. By locking at level-2 cache, Xenon processor achieves the effect of using local storage by Cell SPEs. In this work, we simulate a multicore parallel computing system with two levels of caches to explore the impact of level-2 cache locking on the performance, power consumption, and predictability. Experimental results show that performance and predictability can be increased and power consumption can be decreased by adding a level-2 cache locking mechanism to an efficient cache sharing structure.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：