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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,500 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,573 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,571 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2573 条记录，以下是161-170 订阅

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

详细简洁

排序：

Fast Convergence to Fairness for Reduced Long Flow Tail Latency in Datacenter Networks 36

Fast Convergence to Fairness for Reduced Long Flow Tail Late...

引用

36th ieee international parallel and distributed processing symposium (ieee IPDPS)

作者： Snyder, John Lebeck, Alvin R. Duke Univ Dept Comp Sci Durham NC 27706 USA

ISBN: (纸本)9781665481069

Many data-intensive applications, such as distributed deep learning and data analytics, require moving vast amounts of data between compute servers in a distributed system. To meet the demands of these applications, datacenters are adopting Remote Direct Memory Access (RDMA), which has higher bandwidth and lower latency than traditional kernel-based networking. To ensure high performance of RDMA networks, congestion control manages queue depth on switches, and historically focused on moderating queue depth to ensure small flows complete quickly. Unfortunately, one side-effect of many common decisions is that large flows are starved of bandwidth. this negatively impacts the flow completion time (FCT) of large, bandwidth-bound flows, which are integral to the performance of data-intensive applications. the FCT is particularly impacted at the tail, which is increasingly critical for predictable application performance. We identify the root causes of the poor performance for long flows and measure the impact. We then design mechanisms that improve long flow FCT without compromising small flow performance. Our evaluations show that these improvements reduce 99.9% tail FCT of long flows by over 2x.

关键词： distributed processing Protocols Additives distributed databases Tail Bandwidth throughput

来源：评论

学校读者我要写书评

暂无评论

Intrusion detection and tolerance for transaction based applications in wireless environments

Intrusion detection and tolerance for transaction based appl...

引用

23rd ieee international parallel and distributed processing symposium

作者： Djemaiel, Yacine Boudriga, Noureddine Univ 7th November Carthage CN&S Res Lab Tunis Tunisia

ISBN: (纸本)9781424437511

Nowadays, many intrusion detection and tolerance systems have been proposed in order to detect attacks in both wired and wireless networks. Even if these solutions have shown some efficiency by detecting a set of complex attacks in wireless environments, they are unable to detect attacks using transaction bared traffic in wireless environments. In this context, we propose an intrusion detection and tolerance scheme that is able to monitor heterogeneous traffic and to detect and tolerate attacks targeting transaction based applications interoperating in wireless environments. A case study is given to illustrate the proposed system capabilities against a complex attack scenario targeting a multi-player wireless gaming service.

关键词： transaction intrusion detection intrusion tolerance wireless environment scheduler

来源：评论

学校读者我要写书评

暂无评论

On the Vulnerabilities of Landmark-based Data Location Approaches: threats, Solutions, and Challenges 15

On the Vulnerabilities of Landmark-based Data Location Appro...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Irain, Malik Jorda, Jacques Mammeri, Zoubir Univ Toulouse IRIT Toulouse France

ISBN: (纸本)9781538637906

Nowadays, many companies, administrations, and individuals are outsourcing the storage of their data to large-scale Cloud Service Providers (CSPs). Unfortunately, the modern cloud infrastructure virtualization results in the difficulty or the impossibility for data owners to know the location where their data are stored. Data location verification is required due to legal, privacy, and performance constraints. Recently "Where are my data located in the Cloud?" has become a challenge and solutions have been proposed to verify data location. Even in case of the establishment of a strong Service-Level Agreement, which includes an initial guarantee regarding data location, the CSP may then move the data in another location, like another country, in order to cut the costs or for any other reasons. this paper considers landmark-based verification approaches, which are flexible and low cost compared to other location verification approaches. the objective is the identification of vulnerabilities relating to the main proposed landmark-based location verification approaches when malicious CSPs are involved and the proposal of some countermeasures against CSP's attacks. We present, to the best of our knowledge, the most comprehensive literature survey on vulnerabilities of landmark-based data location approaches.

关键词： Cloud computing Data location verification Landmark-based approaches threats

来源：评论

学校读者我要写书评

暂无评论

parallel Subgraph Counting for Multicore Architectures 12

Parallel Subgraph Counting for Multicore Architectures

引用

12th ieee international symposium on parallel and distributed processing with applications (ISPA)

作者： Aparicio, David Ribeiro, Pedro Silva, Fernando Univ Porto CRACS P-4169007 Oporto Portugal Univ Porto INESC TEC LA Fac Ciencias P-4169007 Oporto Portugal

ISBN: (纸本)9781479942930

Computing the frequency of small subgraphs on a large network is a computationally hard task. this is, however, an important graph mining primitive, with several applications, and here we present a novel multicore parallel algorithm for this task. At the core of our methodology lies a state-of-the-art data structure, the g-trie, which represents a collection of subgraphs and allows for a very efficient sequential search. Our implementation was done using Pthreads and can run on any multicore personal computer. We employ a diagonal work sharing strategy to dynamically and effectively divide work among threads during the execution. We assess the performance of our Pthreads implementation on a set of representative networks from various domains and with diverse topological features. For most networks, we obtain a speedup of over 50 for 64 cores and an almost linear speedup up to 32 cores, showcasing the flexibility and scalability of our algorithm. this paves the way for the usage of such counting algorithms on larger subgraph and network sizes without the obligatory access to a cluster.

关键词： parallel Algorithms Adaptive Load Balancing Complex Networks Graph Mining G-Tries

来源：评论

学校读者我要写书评

暂无评论

Dynamic Frequency Scaling for Energy Consumption Reduction in Synchronous distributed applications 12

Dynamic Frequency Scaling for Energy Consumption Reduction i...

引用

12th ieee international symposium on parallel and distributed processing with applications (ISPA)

作者： Charr, Jean-Claude Couturier, Raphael Fanfakh, Ahmed Giersch, Arnaud Univ Franche Comte FEMTO ST Inst IUT Belfort Montbeliard F-90016 Belfort France

ISBN: (纸本)9781479942930

Dynamic Voltage Frequency Scaling (DVFS) can be applied to modern CPUs. this technique is usually used to reduce the energy consumed by a CPU while computing. thus, decreasing the frequency reduces the power consumed by the CPU. However, it can also significantly affect the performance of the executed program if it is compute bound and if a low CPU frequency is selected. therefore, the chosen scaling factor must give the best possible trade-off between energy reduction and performance. In this paper we present an algorithm that predicts the energy consumed with each frequency gear and selects the one that gives the best ratio between energy consumption reduction and performance. this algorithm works online without training or profiling and has a very small overhead. It also takes into account synchronous communications between the nodes that are executing the distributed algorithm. the algorithm has been evaluated over the SimGrid simulator while being applied to the NAS parallel benchmark programs. the results of the experiments show that it outperforms other existing scaling factor selection algorithms.

关键词： Benchmarktesting Degradation Energyconsumption Predictionalgorithms Programprocessors Time-frequencyanalysis Dynamicvoltagefrequencyscaling homogeneouscluster messagepassingprograms central processing units energy consumption Energy sources dynamic frequency deterioration Scale factor Energy conservation

来源：评论

学校读者我要写书评

暂无评论

OPTZ: a Hardware Isolation Architecture of Multi-tasks Based on TrustZone Support 15

OPTZ: a Hardware Isolation Architecture of Multi-tasks Based...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Chen, Kang Dai, Hongjun Shandong Univ Dept Comp Sci & Technol Jinan Shandong Peoples R China

ISBN: (纸本)9781538637906

In order to improve the safety of existing embedded system, make user data more secure, we propose an implementation of multitasking hardware isolation based on TrustZone named OPTZ (Open TrustZone). ARM TrustZone technology can implement the hardware isolation to improve the security of the software without additional hardware chips outside. In this paper we designed a complete trusted execution environment (TEE) and implemented the multitasking hardware isolation between normal world and secure world. Moreover, the multitasks in the secure memory are also separated from each other. Our architecture includes a secure operating system running in secure world, an normal operating system from normal world, secure services and communication mechanism. At last, we have done some experiments of physical memory access to test and verify the correctness of our architecture. Client application(CA) runs in normal world cannot access the secure world's physical address. the trusted application(TA) can communicate with each other but not access. the experiment results show that multitasking hardware isolation worked well, and the memory isolation can reach the hardware level.

关键词： TrustZone trust security multitasking physical isolation

来源：评论

学校读者我要写书评

暂无评论

Scalable distributed Consensus to Support MPI Fault Tolerance

Scalable Distributed Consensus to Support MPI Fault Toleranc...

引用

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

作者： Buntinas, Darius Argonne Natl Lab Argonne IL 60439 USA

ISBN: (纸本)9780769546759

As system sizes increase, the amount of time in which an application can run without experiencing a failure decreases. Exascale applications will need to address fault tolerance. In order to support algorithm-based fault tolerance, communication libraries will need to provide fault-tolerance features to the application. One important fault-tolerance operation is distributed consensus. this is used, for example, to collectively decide on a set of failed processes. this paper describes a scalable, distributed consensus algorithm that is used to support new MPI fault-tolerance features proposed by the MPI 3 Forum's fault-tolerance working group. the algorithm was implemented and evaluated on a 4,096-core Blue Gene/P. the implementation was able to perform a full-scale distributed consensus in 222 mu s and scaled logarithmically.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Dynamic detection of academic team communities based on temporal coauthor network 15

Dynamic detection of academic team communities based on temp...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Wan, Wencong Huang, Fang Wang, Xiangqian Zhang, Yuchen Zhang, Chengyuan Cent South Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China

ISBN: (纸本)9781538637906

As the status of team members and relationships between them change over time, the importance of membership nodes in the academic team also change, so that the academic team organizational structure evolves. the changes caused by the core members of the team led to the evolution of the team structure. therefore, this paper presents a dynamic community discovery algorithm based on temporal coauthor network. By detecting the importance of nodes, the strength of relative edges, and its variation of persistence with time, the proposed algorithm implements creation, extension, shrink, division and disappearance operations on the communities in order to achieve the purpose of dynamic community discovery. In addition, for assessing the quality of community division, the paper proposes a method based on the interest similarity of Chinese key characters feature of academic teams. In experiment, a public document record dataset and several synthetic dataset are used to verify the effectiveness our algorithm.

关键词： evolution of academic team temporal coauthor network importance of node similarity of character feature

来源：评论

学校读者我要写书评

暂无评论

Flow Migrations in Software Defined Networks: Consistency, Feasibility, and Optimality 15

Flow Migrations in Software Defined Networks: Consistency, F...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Chen, Yang Zheng, Huanyang Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9781538637906

Software defined networks always need to migrate flows to update the network configuration for a better system performance. However, the existing literature does not take flow path overlapping information into consideration when flows' routes are re-allocated. Consequently, congestion happens, resulting in deadlocks among flows and link resources, which will block the update process and cause severe packet loss. this paper resolves deadlocks with the help of spare resources during the network update. An algorithm is proposed to determine the feasibility of the consistent flow migration. We demonstrate that even if there are multiple consistent migration plans, finding the optimal one that occupies the fewest leisure bandwidth resources is NP-hard. An approximation algorithm is proposed to sequentially migrate flows in a consistent way. Extensive simulations show that our solution achieves a much smaller traffic loss rate at the cost of an affordable spare link resource usage compared to prior methods.

关键词： Software Defined Networks (SDNs) spare links consistent flow migration feasibility and optimality

来源：评论

学校读者我要写书评

暂无评论

A Service-reliability-based Resource Mapping Method in Smart Grid Virtual Networks 15

A Service-reliability-based Resource Mapping Method in Smart...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Sun, Li-Qian Chen, Xing-Yu Feng, Qi Guo, Shao-Yong Xu, Si-Ya Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9781538637906

In order to guarantee the reliability of services and reduce the waste of resources in traditional dual-path protection method, a service-reliability-based resources mapping method is proposed in this paper. the virtualization technology is adopted in our method for smart grid Fiber-Wireless access networks. Firstly, a priority-and fault-probability based primary link mapping model is set up. It classifies the service priorities level and provides high-priority services with high-reliability links to improve service reliability of the whole network. then, a resource-saving aimed backup link mapping model is established to allocate the multiple services as many as possible for one backup link to save resources. At last, the genetic algorithm is used to solve the mapping model. the evaluation results show that our proposed method increases service reliability, and improves resource utilization.

关键词： SDN communication networks resource mapping failure probability resource saving ubiquitous network

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：