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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是131-140 订阅

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

详细简洁

排序：

An active scheduler: Autonomous concurrency control of parallel programs in a distributed environment

An active scheduler: Autonomous concurrency control of paral...

引用

8th International Conference on parallel and distributed Systems (ICPADS 2001)

作者： Fujita, S Deng, L Tagashira, S Hiroshima Univ Fac Engn Higashihiroshima 7398527 Japan

ISBN: (纸本)0769511538

In this paper, we propose a new scheduling method that can simultaneously achieve two main goals of task scheduling in distributed parallel systems;i.e., to minimize the execution time of a parallel job without disturbing the execution of other jobs. We challenge to achieve those goals by introducing a new scheduler, called active scheduler, that controls the priority of parallel programs dynamically and balances the workload of computers, depending on the current status of runtime environment. Priority of parallel programs is controlled by controlling the concurrency of the programs, We implemented a prototype system to evaluate the effectiveness of active scheduler. the results of experiments imply that the overhead of introducing active scheduler is bounded by 15 % of the original execution time, and it is in fact effective to adjust the execution of parallel programs to an actual distributed parallel processing environment in which many users execute their jobs at the same time.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Optimizing parallel Graph Connectivity Computation via Subgraph Sampling 32

Optimizing Parallel Graph Connectivity Computation via Subgr...

引用

27th International Heterogeneity in Computing Workshop in conjunction with 32nd ieee International parallel and distributed processing symposium (IPDPS)

作者： Sutton, Michael Ben-Nun, Tal Barak, Amnon Hebrew Univ Jerusalem Dept Comp Sci IL-91904 Jerusalem Israel Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781538643686

Connected component identification is a fundamental problem in graph analytics, serving as a basis for subsequent computations in a wide range of applications. To determine connectivity, several parallel algorithms, whose complexity is proportional to the number of edges or graph diameter, have been proposed. However, an optimal algorithm may extract graph components by working proportionally to the number of vertices, which can be orders of magnitude lower than the number of edges. We propose Afforest: an extension of the Shiloach-Vishkin connected components algorithm that approaches optimal work efficiency by processing subgraphs in each iteration. We prove the convergence of the algorithm, analyze its work efficiency characteristics, and provide further techniques to speed up processing graphs containing a huge component. Designed with modern parallel architectures in mind, we show that the algorithm exhibits higher memory locality than existing methods. Using both synthetic and real-world graphs, we demonstrate that Afforest achieves speedups of up to 67x over the state-of-the-art on multi-core CPUs (Broadwell, POWER8) and up to 23x on GPUs (Pascal).

关键词： Connected Components parallel Algorithms Graph Algorithms

来源：评论

学校读者我要写书评

暂无评论

Laterally connected spatially coupled code chains for transmission over unstable parallel channels 8

Laterally connected spatially coupled code chains for transm...

引用

2014 8th International symposium on Turbo Codes and Iterative Information processing, ISTC 2014

作者： Schmalen, Laurent Mahdaviani, Kaveh Bell Laboratories Alcatel-Lucent Stuttgart70435 Germany ECE Department University of Toronto Toronto Canada

ISBN: (纸本)9781479959853

We propose a new coding scheme for parallel binary erasure channels that may have time-varying characteristics. the proposed scheme consists of several spatially coupled codes, each assigned to a different channel, that are sparsely coupled between each other. this sparse coupling, denoted lateral connectivity helps the decoding waves of the different sub-codes to propagate, even if the associated channel undergoes a burst error event. the new ensemble is analyzed using density evolution and it is shown that it outperforms parallel, independent spatially coupled codes. © 2014 ieee.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Improving the Performance of Dynamical Simulations Via Multiple Right-Hand Sides

Improving the Performance of Dynamical Simulations Via Multi...

引用

26th ieee International parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Liu, Xing Chow, Edmond Vaidyanathan, Karthikeyan Smelyanskiy, Mikhail Georgia Inst Technol Coll Comp Sch Computat Sci & Engn Atlanta GA 30332 USA Intel Corp Parallel Comp Lab Santa Clara CA 95054 USA

ISBN: (纸本)9780769546759

this paper presents an algorithmic approach for improving the performance of many types of stochastic dynamical simulations. the approach is to redesign existing algorithms that use sparse matrix-vector products (SPMV) with single vectors to instead use a more efficient kernel, the generalized SPMV (GSPMV), which computes with multiple vectors simultaneously. In this paper, we show how to redesign a dynamical simulation to exploit GSPMV in way that is not initially obvious because only one vector is available at a time. We study the performance of GSPMV as a function of the number of vectors, and demonstrate the use of GSPMV in the Stokesian dynamics method for the simulation of the motion of macromolecules in the cell. Specifically, for our application, we find that with modern multicore Intel microprocessors in clusters of up to 64 nodes, we can typically multiply by 8 to 16 vectors in only twice the time required to multiply by a single vector. After redesigning the Stokesian dynamics algorithm to exploit GSPMV, we measure a 30 percent speedup in performance in single-node, data parallel simulations.

关键词： sparse matrix-vector product (SPMV) iterative methods block Krylov subspace methods SIMD (SSE/AVX) Stokesian dynamics Brownian dynamics biological macromolecular simulation

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2009 8th ieee International symposium on Network Computing and Applications, NCA 2009

Proceedings - 2009 8th IEEE International Symposium on Netwo...

引用

2009 8th ieee International symposium on Network Computing and Applications, NCA 2009

ISBN: (纸本)9780769536989

the proceedings contain 54 papers. the topics discussed include: an experimental study of diversity with off-the-shelf antivirus engines;simulating fixed virtual nodes for adapting wireline protocols to MANET;seed scheduling for peer-to-peer networks;proximity-aware distributed mutual exclusion for effective peer-to-peer replica management;towards improved overlay simulation using realistic topologies;analysis of round-robin implementations of processor sharing, including overhead;comparison of price-based static and dynamic job allocation schemes for grid computing systems;a rule based co-operative approach for cell selection in high speed cellular networks;sharing private information across distributed databases;energy-aware prefetching for parallel disk systems;attribute-based prevention of phishing attacks;TTM based security enhancement for inter-domain routing protocol;and introducing probability in RFID reader-to-reader anti-collision.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed identification of all maximal incomplete subcubes in a faulty hypercube

Distributed identification of all maximal incomplete subcube...

引用

Proceedings of the 8th International parallel processing symposium

作者： Chen, Hsing-Lung Tzeng, Nian-Feng National Taiwan Inst of Technology Taipei Taiwan

ISBN: (纸本)0818656026

Reconfiguring a faulty hypercube into a maximal incomplete cube tends to lower potential performance degradation, because a hypercube so reconfigured often results in a much larger system that what is attained by any conventional reconfiguration scheme which identifies only complete subcubes. this paper proposes an efficient strategy for identifying all the maximal incomplete subcubes present in a faulty hypercube. the proposed strategy is distributed in that every healthy node executes the same identification algorithm independently at the same time.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A parallel implementation of the Finite-Domain Time-Difference algorithm using MPJ express

A parallel implementation of the Finite-Domain Time-Differen...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Shafi, Aamir Hussain, Aftab Raza, Jamil NUST Institute of Information Technology Pakistan

ISBN: (纸本)9781424416936

this paper presents and evaluates a parallel Java implementation of the Finite-Difference Time-Domain (FDTD) method, which is a widely used numerical technique in computational electrodynamics. the Java version is parallelized using MPJ Express-a thread-safe messaging library. MPJ Express provides a full implementation of the mpiJava 1.2 API specification. this specification defines a MPI-like binding for the Java language. this paper describes our experiences of implementing the Java version of the FDTD method. Towards the end of this paper, we evaluate and compare the performance of the Java version against its C counterpart on a 32 processing core Linux cluster of eight compute nodes.

关键词： Finite difference time domain method

来源：评论

学校读者我要写书评

暂无评论

A revised taxonomy for time warp based distributed synchronization protocols 04

A revised taxonomy for time warp based distributed synchroni...

引用

8th ieee International symposium on distributed Simulation and Real-Time Applications (DS-RT 2004)

作者： Lobato, RS Ulson, RS Santana, MJ Santana, RHC Univ Estadual Paulista IBILCE DCCE BR-15054000 SJR Preto SP Brazil

this paper presents an improved and updated taxonomy for Time Warp based distributed synchronization protocols. this taxonomy aims to allow the grouping of several optmistic distributed simulation synchronization prot... 详细信息

ISBN: (纸本)0769522327

关键词： Taxonomy Protocols Programmable control Adaptive control Proposals Discrete event simulation Time warp simulation Electronic mail Bonding

来源：评论

学校读者我要写书评

暂无评论

Foundation for designing deadlock-free routing algorithms in wormhole networks

Foundation for designing deadlock-free routing algorithms in...

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Jayasimha, D.N. Manivannan, D. May, Jeff A. Schwiebert, Loren Hary, Stephen L. Intel Corp Santa Clara United States

this paper provides necessary and sufficient conditions for deadlock-free unicast and multicast routing with the path-based routing model in interconnection networks which use the wormhole switching technique. the theory is developed around three central concepts: channel waiting, False Resource Cycles, and valid destination sets. the first two concepts are suitable extensions to those developed for unicast routing by two authors of this paper;the third concept has been developed by Lin and Ni. the necessary and sufficient conditions can be applied in a straightforward manner to prove deadlock freedom and to find more adaptive routing algorithms for collective communication. the latter point is illustrated by developing two routing algorithms for multicast communication in 2-D mesh architectures. the first algorithm uses fewer resources (channels) than an algorithm proposed in the literature but achieves the same adaptivity. the second achieves full adaptivity for multicast routing.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An algebraic parallel treecode in arbitrary dimensions 29

An algebraic parallel treecode in arbitrary dimensions

引用

29th ieee International parallel and distributed processing symposium (IPDPS)

作者： March, William B. Xiao, Bo Yu, Chenhan D. Biros, George Univ Texas Austin Inst Computat Engn & Sci Austin TX 78712 USA

ISBN: (纸本)9781479986484

We present a parallel treecode for fast kernel summation in high dimensions-a common problem in data analysis and computational statistics. Fast kernel summations can be viewed as approximation schemes for dense kernel matrices. Treecode algorithms (or simply treecodes) construct low-rank approximations of certain off-diagonal blocks of the kernel matrix. these blocks are identified with the help of spatial data structures, typically trees. there is extensive work on treecodes and their parallelization for kernel summations in three dimensions, but there is little work on high-dimensional problems. Recently, we introduced a novel treecode, ASKIT, which resolves most of the shortcomings of existing methods. We introduce novel parallel algorithms for ASKIT, derive complexity estimates, and demonstrate scalability on synthetic, scientific, and image datasets. In particular, we introduce a local essential tree construction that extends to arbitrary dimensions in a scalable manner. We introduce data transformations for memory locality and use GPU acceleration. We report results on the "Maverick" and "Stampede" systems at the Texas Advanced Computing Center. Our largest computations involve two billion points in 64 dimensions on 32,768 x86 cores and 8 million points in 784 dimensions on 16,384 x86 cores.

关键词： GPUs Kernel summation randomized linear algebra treecodes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：