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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,672 篇 会议
124 篇 期刊文献
22 册 图书

馆藏范围

3,818 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,673 篇 工学
- 2,548 篇 计算机科学与技术...
- 1,152 篇 软件工程
- 412 篇 电气工程
- 412 篇 信息与通信工程
- 207 篇 电子科学与技术（可...
- 136 篇 控制科学与工程
- 78 篇 网络空间安全
- 40 篇 动力工程及工程热...
- 37 篇 机械工程
- 37 篇 建筑学
- 33 篇 生物医学工程（可授...
- 29 篇 光学工程
- 29 篇 生物工程
- 28 篇 土木工程
- 22 篇 仪器科学与技术
- 20 篇 化学工程与技术
- 20 篇 安全科学与工程
- 18 篇 力学（可授工学、理...
634 篇 理学
- 493 篇 数学
- 88 篇 物理学
- 67 篇 统计学（可授理学、...
- 56 篇 系统科学
- 35 篇 生物学
- 31 篇 化学
402 篇 管理学
- 339 篇 管理科学与工程(可...
- 157 篇 工商管理
- 84 篇 图书情报与档案管...
28 篇 医学
- 25 篇 临床医学
26 篇 经济学
- 25 篇 应用经济学
18 篇 法学
- 18 篇 社会学
12 篇 农学
6 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

348 篇 parallel process...
302 篇 application soft...
239 篇 distributed comp...
208 篇 computer archite...
204 篇 concurrent compu...
197 篇 hardware
181 篇 computational mo...
177 篇 parallel process...
172 篇 computer science
172 篇 graphics process...
129 篇 runtime
120 篇 parallel program...
104 篇 processor schedu...
103 篇 distributed comp...
101 篇 grid computing
101 篇 distributed proc...
97 篇 scalability
96 篇 high performance...
96 篇 delay
94 篇 libraries

机构

12 篇 school of comput...
12 篇 ohio state univ ...
10 篇 argonne natl lab...
9 篇 univ chinese aca...
9 篇 hiroshima univ d...
9 篇 oak ridge natl l...
7 篇 ibm thomas j. wa...
7 篇 oak ridge nation...
7 篇 univ warwick dep...
7 篇 carnegie mellon ...
7 篇 department of co...
7 篇 ibm corp thomas ...
6 篇 oak ridge natl l...
6 篇 iit dept comp sc...
6 篇 lawrence berkele...
6 篇 georgia inst tec...
6 篇 department of co...
6 篇 univ coll dublin...
6 篇 department of co...
6 篇 department of co...

作者

20 篇 nakano koji
17 篇 lastovetsky alex...
16 篇 ito yasuaki
11 篇 dongarra jack
11 篇 jarvis stephen a...
11 篇 sun xian-he
11 篇 agrawal gagan
10 篇 wolf felix
9 篇 schulz martin
9 篇 guo minyi
9 篇 robert yves
8 篇 hoefler torsten
8 篇 h. casanova
8 篇 jack dongarra
8 篇 prasad sushil k.
8 篇 casanova henri
8 篇 magoules frederi...
8 篇 kale laxmikant v...
8 篇 labarta jesus
7 篇 bader david a.

语言

3,810 篇 英文
6 篇 其他
1 篇 土耳其文
1 篇 中文

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

共 3818 条记录，以下是141-150 订阅

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

详细简洁

排序：

User Allocation for Real-Time applications with State Sharing in Fog Computing Networks

User Allocation for Real-Time Applications with State Sharin...

引用

35th IEEE international parallel and distributed processing symposium (IPDPS)

作者： Sato, Ryohei Kawaguchi, Hidetoshi Nakatani, Yuichi NTT Network Serv Syst Labs Musashino Tokyo Japan

ISBN: (纸本)9781665435772

applications in which multiple users share the states in real-time over a network have been rapidly spreading, but network latency degrades their quality of service (QoS) and quality of experience (QoE). Although Fog computing effectively mitigates this problem, user allocation methods suitable for these applications with strict latency requirements have not yet been studied. therefore, this paper proposes both offline and online methods that assume state sharing for user allocation in Fog environments. these methods not only reduce the mean of delays within each group composed of users who share the same states but also guarantee fairness among the users. the simulations demonstrate that our methods complete the allocation in a realistic time and outperform the baseline methods and architectures.

关键词： distributed processing Edge computing

来源：评论

学校读者我要写书评

暂无评论

Optimization of Virtual Resources Provisioning for Cloud applications to cope with Traffic Burst 15

Optimization of Virtual Resources Provisioning for Cloud App...

引用

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

作者： Yang, Lei Feng, Ying Li, Kenli Hunan Univ Coll Informat Sci & Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781538637906

In order to ensure Web application QoS and remain low cost for the provider simultaneously in Web traffic burst scenario, workload prediction and corresponding provisioning mechanism are investigated in this paper. At first, a virtual resource provisioning architecture is designed based on workload prediction under cloud hosting environment. then, combined with the existing Moving Average (MA) model and Support Vector Regression (SVR) model, we propose an integrated workload prediction model named LOF-MASVR through using Local Outlier Factor (LOF) algorithm. With the application of this prediction model, a dynamic mechanism of resource provisioning is proposed by introducing an adaptive coefficient. Experiments using real Web workload demonstrate that LOF-MASVR model can reduce Service Level Agreement (SLA) violation number in peak periods around 70%, in comparison with existing prediction models. According to resource provisioning experiments on CloudSim platform, the proposed dynamic provisioning policy can effectively reduce the risk of SLA violation, which simultaneously ensures the virtual resource utilization.

关键词： Cloud applications QoS Traffic Burst Scenario Workload Prediction Virtual Resource Provisioning SVR MA LOF

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed algorithm for mining association rules 4th

引用

4th international symposium on parallel and distributed processing and applications

作者： Farzanyar, Zahra Kangavari, Mohammadreza Hashemi, Sattar Iran Univ Sci & Technol SECOMP Lab Dept Comp & IT Tehran Iran Iran Univ Sci & Technol Dept Comp & IT Tehran Iran

ISBN: (纸本)9783540680673

Association Rule Mining (ARM) is an active data mining research area. However, most ARM algorithms cater to a centralized environment where no external communication is required. distributed Association Rule Mining (DARM) algorithms aim to generate rules from different datasets spread over various geographical sites;hence, they require external communications throughout the entire processor. A direct application of sequential algorithms to distributed databases is not effective, because it requires a large amount of communication overhead. DARM algorithms must reduce communication costs. In this paper, a new solution is proposed to reduce the size of message exchanges. Our solution also reduces the size of average transactions and datasets that leads to reduction of scan time, which is very effective in increasing the performance of the proposed algorithm. Our performance study shows that this solution has a better performance over the direct application of a typical sequential algorithm.

关键词： distributed data mining association rules distributed databases

来源：评论

学校读者我要写书评

暂无评论

Quiet neighborhoods: Key to Protect Job Performance Predictability 29

Quiet neighborhoods: Key to Protect Job Performance Predicta...

引用

29th IEEE international parallel and distributed processing symposium (IPDPS)

作者： Jokanovic, Ana Carlos Sancho, Jose Labarta, Jesus Rodriguez, German Minkenberg, Cyriel Lucero, Alejandro Barcelona Supercomp Ctr Barcelona Spain IBM Res Zurich Zurich Switzerland Netronome Cambridge England

ISBN: (纸本)9781479986484

Interference of nearby jobs has been recently identified as the dominant reason for the high performance variability of parallel applications running on High Performance Computing (HPC) systems. Typically, HPC systems are dynamic with multiple jobs coming and leaving in an unpredictable fashion, sharing simultaneously the system interconnection network. In such environment contention for network resources is causing random stalls in the progress of application execution degrading application and system performance overall. Eliminating job interactions in their neighborhoods is key for guaranteeing performance predictability of applications. In this paper we are proposing the concept of quiet neighborhoods that significantly reduce job interactions. Quiet neighborhoods are created by the system resource manager in two phases. First, multiple virtual network blocks are defined on the top of the physical network resources based on typical workload distributions. Second, newly arriving jobs are allocated in these virtual blocks based on their size.

关键词： Performance predictability Performance reproducibility applications' interference Network contention Resource management Virtual network topologies Infiniband

来源：评论

学校读者我要写书评

暂无评论

Network resource control for data intensive applications in heterogeneous infrastructures

Network resource control for data intensive applications in ...

引用

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

作者： Zhao, Zhiming Dumitru, Cosmin Grosso, Paola de Laat, Cees Univ Amsterdam Inst Informat Syst & Network Engn Res Grp NL-1098 XH Amsterdam Netherlands

ISBN: (纸本)9780769546766

Many scientific workflow applications are data intensive. Large quantities of simulation generated data or data collected from sensors or instruments drive the process flow of the applications, and the processing of the data is commonly done at a different location from where the data is stored. Advanced networks such as hybrid networks make it feasible for high level applications to request network paths and service provisioning. However, current applications tune the execution quality rarely considering network resources, and by selecting only optimal software services and computing resources. Including network services in the resource scheduling adds an extra dimension workflow applications to optimize the runtime performance but also introduces new challenges, in particular in heterogeneous infrastructures. In this paper we continue our previous work on a system called NEtWork QoS Planner (NEWQoSPlanner) which is able to select network resources in the context of workflow composition and scheduling. We will discuss how NEWQoSPlanner invokes network services to achieve dynamic resource optimization for workflows, and how to apply such planner in heterogeneous infrastructures.

关键词： Advanced network scientific workflow QoS resource planning

来源：评论

学校读者我要写书评

暂无评论

Introduction of Improved Repairing Locality into Secret Sharing Schemes with Perfect Security 15

Introduction of Improved Repairing Locality into Secret Shar...

引用

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

作者： Fu, Yue Sun, Shuhao Li, Dagang Liu, Peng Peking Univ Sch Elect & Comp Engn Beijing Peoples R China Peking Univ Inst Big Data Technol Shenzhen Grad Sch Shenzhen Peoples R China Hangzhou Dianzi Univ Sch Comp Sci & Technol Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781538637906

Repairing locality is an appreciated feature for distributed storage, in which a damaged or lost data share can be repaired by accessing a subset of other shares much smaller than is required for decoding the complete data. However for Secret Sharing (SS) schemes, it has been proven theoretically that local repairing can not be achieved with perfect security for the majority of threshold SS schemes, where all the shares are equally regarded in both secret recovering and share repairing. In this paper we make an attempt on decoupling the two processes to make secure local repairing possible. Dedicated repairing redundancies only for the repairing process are generated, which are random numbers to the original secret through this manner a threshold SS scheme with improved repairing locality is achieved on the condition that security of repairing redundancies is ensured, or else our scheme degenerates into a perfect access structure that is equivalent to the best existing schemes can do. To maximize security of the repairing redundancies, a random placement mechanism is also proposed.

关键词： distributed storage repairable secret sharing repairing locality perfect security

来源：评论

学校读者我要写书评

暂无评论

Leveraging naturally distributed data redundancy to reduce collective I/O replication overhead 29

Leveraging naturally distributed data redundancy to reduce c...

引用

29th IEEE international parallel and distributed processing symposium (IPDPS)

作者： Nicolae, Bogdan IBM Res Dublin Ireland

ISBN: (纸本)9781479986484

Dumping large amounts of related data simultaneously to local storage devices instead of a parallel file system is a frequent I/O pattern of HPC applications running at large scale. Since local storage resources are prone to failures and have limited potential to serve multiple requests in parallel, techniques such as replication are often used to enable resilience and high availability. However, replication introduces overhead, both in terms of network traffic necessary to distribute replicas, as well as extra storage space requirements. To reduce this overhead, state-of-art techniques often apply redundancy elimination (e.g. compression or deduplication) before replication, ignoring the natural redundancy that is already present. By contrast, this paper proposes a novel scheme that treats redundancy elimination and replication as a single co-optimized phase: remotely duplicated data is detected and directly leveraged to maintain a desired replication factor by keeping only as many replicas as needed and adding more if necessary. In this context, we introduce a series of high performance algorithms specifically designed to operate under tight and controllable constrains at large scale. We present how this idea can be leveraged in practice and demonstrate its viability for two real-life HPC applications.

关键词： data resilience high availability data replication deduplication collective I/O scalability redundancy management

来源：评论

学校读者我要写书评

暂无评论

Examining the Reproducibility of Using Dynamic Loop Scheduling Techniques in Scientific applications 31

Examining the Reproducibility of Using Dynamic Loop Scheduli...

引用

31st IEEE international parallel and distributed processing symposium Workshops (IPDPS)

作者： Hoffeins, Franziska Ciorba, Florina M. Banicescu, Ioana Tech Univ Dresden Ctr Informat Serv & High Performance Comp D-01062 Dresden Germany Univ Basel Dept Math & Comp Sci CH-4051 Basel Switzerland Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS 39762 USA

ISBN: (纸本)9780769561493

Reproducibility of the execution of scientific applications on parallel and distributed systems is a growing concern, underlying the trustworthiness of the experiments and the conclusions derived from experiments. Dynamic loop scheduling (DLS) techniques are an effective approach towards performance improvement of scientific applications via load balancing. these techniques address algorithmic and systemic sources of load imbalance by dynamically assigning tasks to processing elements. the DLS techniques have demonstrated their effectiveness when applied in real applications. Complementing native experiments, simulation is a powerful tool for studying the behavior of parallel and distributed applications. In earlier work, the scalability [1], robustness [2], and resilience [3] of the DLS techniques were investigated using the MSG interface of the SimGrid simulation framework [4]. the present work complements the earlier work and concentrates on the verification via reproducibility of the implementation of the DLS techniques in SimGrid-MSG. this work describes the challenges of verifying the performance of using DLS techniques in earlier implementations of scientific applications. the verification is performed via reproducibility of simulations based on SimGrid-MSG. To simulate experiments selected from earlier literature, the reproduction process begins by extracting the information needed from the earlier literature and converting it into the input required by SimGrid- MSG. the reproducibility study is carried out by comparing the performance of SimGrid-MSG-based experiments with those reported in two selected publications in which the DLS techniques were originally proposed. While the reproduction was not successful for experiments from one of the selected publications, it was successful for experiments from the other. this successful reproduction implies the verification of the DLS implementation in SimGrid- MSG for the considered applications and systems, and th

关键词： Verification via Reproducibility Simulation Scheduling Dynamic Loop Scheduling Scientific applications SimGrid-MSG

来源：评论

学校读者我要写书评

暂无评论

parallel Protein Identification Using an FPGA-Based Solution 30

Parallel Protein Identification Using an FPGA-Based Solution

引用

30th IEEE international parallel and distributed processing symposium (IPDPS)

作者： Casasopra, Fabiola Bianchi, Gea Durelli, Gianluca C. Santambrogio, Marco D. Politecn Milan Dipartimento Elett Informaz & Bioingn Milan Italy

ISBN: (纸本)9781509036820

the ability to rapidly identify a given protein from small subsamples (i.e. peptides) is at the basis of fundamental applications in the medical field. At the basis of protein identification we have a string matching problem which is computational intensive if we consider that the complexity of the algorithm scales with the length of the string and the number of sweeps of the database that are needed. In this paper we present an improvement for the FPGA-based string matching solution available in the literature improving the amount of parallelism exploited by the solution achieving a 1.63x reduction of the energy needed for the task over the literature and a 5.75x reduction when compared with high-end workstation.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Automatic Refinement of parallel applications Structure Detection

Automatic Refinement of Parallel Applications Structure Dete...

引用

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

作者： Gonzalez, Juan Huck, Kevin Gimenez, Judit Labarta, Jesus Univ Politecn Catalunya Barcelona Tech Barcelona Supercomp Ctr Barcelona Spain ParaTools Inc Eugene OR USA

ISBN: (纸本)9780769546766

Analyzing parallel programs has become increasingly difficult due to the immense amount of information collected on large systems. In this scenario, cluster analysis has been proved to be a useful technique to reduce the amount of data to analyze. A good example is the use of the density-based cluster algorithm DBSCAN to identify similar single program multiple data (SPMD) computing phases in message-passing applications. this structure detection simplifies the analyst work as the whole information available is reduced to a small set of clusters. However, DBSCAN presents two major problems: it is very sensitive to its parametrization and is not capable of correctly detect clusters when the data set has different densities across the data space. In this paper, we introduce the Aggregative Cluster Refinement, an iterative algorithm that produces more accurate structure detections of SPMD phases than DBSCAN. In addition, it is able to detect clusters with different densities.

关键词： parallel applications performance analysis automatic analysis cluster analysis data mining

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共382页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：