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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,712 篇 会议
29 册 图书
24 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,296 篇 工学
- 1,195 篇 计算机科学与技术...
- 535 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
164 篇 管理学
- 116 篇 管理科学与工程(可...
- 58 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

154 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
67 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 resource managem...

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 rothermel kurt
10 篇 shen hong
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,727 篇 英文
30 篇 俄文
4 篇 其他
3 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1765 条记录，以下是351-360 订阅

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

详细简洁

排序：

Microservices vs Serverless: A Performance Comparison on a Cloud-native Web Application 10

Microservices vs Serverless: A Performance Comparison on a C...

引用

10th international conference on Cloud computing and Services Science (CLOSER)

作者： Fan, Chen-Fu Jindal, Anshul Gerndt, Michael Tech Univ Munich Chair Comp Architecture & Parallel Syst Garching Germany

ISBN: (纸本)9789897584244

A microservices architecture has gained higher popularity among enterprises due to its agility, scalability, and resiliency. However, serverless computing has become a new trendy topic when designing cloud-native applications. Compared to the monolithic and microservices, serverless architecture offloads management and server configuration from the user to the cloud provider and let the user focus only on the product development. Hence, there are debates regarding which deployment strategy to use. this research provides a performance comparison of a cloud-native web application in terms of scalability, reliability, cost, and latency when deployed using microservices and serverless deployment strategy. this research shows that neither the microservices nor serverless deployment strategy fits all the scenarios. the experimental results demonstrate that each type of deployment strategy has its advantages under different scenarios. the microservice deployment strategy has a cost advantage for long-lasting services over serverless. On the other hand, a request accompanied by the large size of the response is more suitably handled by serverless because of its scaling-agility.

关键词： Microservices Serverless Performance Comparison Cloud-native applications Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Green-Aware Online Resource Allocation for Geo-distributed Cloud Data Centers On Multi-source Energy 17

Green-Aware Online Resource Allocation for Geo-Distributed C...

引用

17th international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： He, Huaiwen Shen, Hong Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou Guangdong Peoples R China Univ Adelaide Sch Comp Sci Adelaide SA Australia Univ Elect Sci & Technol Sch Comp China Zhongshan Inst Chengdu Peoples R China

ISBN: (纸本)9781509050819

Huge energy consumption of large-scale cloud data centers damages the environment with excessive carbon emission. More and more data center operators are seeking to reduce carbon footprint via various types of renewable energy sources. However, the intermittent availability of renewable energy source makes it quite challenging to cooperate the dynamic workload arrivals. In this paper, we investigate how to coordinate multi type renewable energy (e.g. wind power and solar power) in order to reduce the long-term energy cost with spatio-temporal diversity of electricity price for geo-distributed cloud data centers under the constraints of service level agreement (SLA) and carbon footprints. To tackle the randomness of workload arrival, dynamic electricity price change and renewable energy generation, we first formulate the minimizing energy cost problem into a constrained stochastic optimization problem. then, based on Lyapunov optimization technique, we design an online control algorithm which can work without long-term future system information for solving the problem. Finally, we evaluate the effectiveness of the algorithm with extensive simulations based on real-world workload traces, electricity price and historic climate data.

关键词： Transportation Supply and demand Programming Linear programming Approximation algorithms Resource management

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Programming Model for distributed Infrastructures 24

Energy-Aware Programming Model for Distributed Infrastructur...

引用

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

作者： Lordan, Francesc Ejarque, Jorge Sirvent, Raul Badia, Rosa M. Barcelona Supercomp Ctr Barcelona Spain Univ Politecn Cataluna E-08028 Barcelona Spain CSIC Artificial Intelligence Res Inst IIIA Madrid Spain

ISBN: (纸本)9781467387767

Day after day, cloud technologies are more and more adopted by very diverse types of stakeholders, and this success creates a side-effect problem: the energy spent by this kind of infrastructures is growing bigger every day. With the objective of reducing energy consumption when programming applications for cloud infrastructures, we have implemented energy-aware mechanisms in the COMPSs Programming Model, inside the context of the ASCETiC Project. In this paper, we demonstrate that application-level scheduling can have a big impact on the energy consumed by an application when executed in a heterogeneous cloud. We have implemented an energy-aware scheduling mechanism in COMPSs, together with a versioning technique, and we have run experiments with a use case coming from the real estate sector that proves our hypotheses.

关键词： programming models distributed computing energy awareness cloud computing

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithm for Triangular Mesh Reconstruction by Deformation in Medical applications

Parallel Algorithm for Triangular Mesh Reconstruction by Def...

引用

10th international conference on parallel computing technologies

作者： Nechaeva, Olga Afanasyev, Ivan Russian Acad Sci Supercomp Software Dept ICMMG Siberian Branch Pr Lavrentieva 6 Novosibirsk 630090 Russia Novosibirsk State Univ Dept Mech & Math Novosibirsk 630090 Russia

ISBN: (纸本)9783642032745

the main goal of this paper is to develop an efficient method of triangular mesh generation for physical objects which have similar geometrical structure. the method is based on deforming a high quality mesh generated over some "ideal" object into another object of the same structure with mesh quality preservation. the approach uses the Self Organizing Maps algorithm and has been applied for constructing meshes on human femur bones using the GeomBox and GeomRandom packages. A parallel deformation algorithm is implemented using MPI. the efficiency of the parallelization is about 90%.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

A Variable Markovian based Outlier Detection Method for Multi-dimensional Sequence over Data Stream 17

A Variable Markovian based Outlier Detection Method for Mult...

引用

17th international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Yang, Dongsheng Wang, Yijie Li, Yongmou Ma, Xingkong Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781509050819

Nowadays sequence data tends to be multidimensional sequence over data stream, it has a large state space and arrives at unprecedented speed. It is a big challenge to design a multi-dimensional sequence outlier detection method to meet the accurate and high speed requirements. the traditional methods can't handle multi-dimensional sequence effectively as they have poor abilities for multi-dimensional sequence modeling, and can't detect outlier timely as they have high computational complexity. In this paper we propose a variable Markovian based outlier detection method for multi-dimensional sequence over data stream, VMOD, which consists of two algorithms: mutual information based feature selection algorithm (MIFS), variable Markovian based sequential analysis algorithm (VMSA). It uses MIFS algorithm to reduce the state space and redundant features, and uses VMSA algorithm to accelerate the outlier detection. through VMOD method, we can improve the detection rate and detection speed. the MIFS algorithm uses mutual information as similarity measures and adopt clustering based strategy to select features, it can improve the abilities for sequence modeling through reducing the state space and redundant features, consequently, to improve the detection rate. the VMSA algorithm use random sample and index structure to accelerate the variable Markovian model construction and reduce the model complexity, consequently, to quicken the outlier detection. the experiments show that VMOD can detect outlier effectively, and reduce the detection time by at least 50% compared with the traditional methods.

关键词： multi-dimensional sequence data stream outlier detection feature selection mutual information variable Markovian

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling of Task Graphs on parallel Systems

Optimal Scheduling of Task Graphs on Parallel Systems

引用

9th international conference on parallel and distributed computing, applications and technologies

作者： Shahul, Ahmed Zaki Semar Sinnen, Oliver Hewlett Packard New Zealand 22 Viaduct Harbour AveMaritime SqPOB 3860 Auckland New Zealand Univ Auckland Dept Elect & Comp Engn Auckland New Zealand

ISBN: (纸本)9780769534435

Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hard nature of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example for time critical systems or to evaluate scheduling heuristics. this paper investigates the task scheduling problem using A* search algorithm. the A* scheduling algorithm implemented can produce optimal schedules in reasonable time for small to medium sized task graphs. In comparison to a previous approach, the here presented A* scheduling algorithm has a significantly reduced search space due to a much improved cost function f (s) and additional pruning techniques. Last but not least, the experimental results show that the proposed A* scheduling algorithm significantly outperforms the previous approach.

关键词： parallel computing scheduling task graphs optimal schedules A

来源：评论

学校读者我要写书评

暂无评论

Trusted Block as a Service: Towards Sensitive applications on the Cloud

Trusted Block as a Service: Towards Sensitive Applications o...

引用

Int Joint conference of 10th IEEE Int Conf on Trust, Security and Privacy in computing and Communications (TrustCom) / 8th IEEE Int Conf on Embedded Software and Systems (ICESS) / 6th Int Conf on Frontier of Computer Science and Technology (FCST)

作者： Hao, Jianan Cai, Wentong Nanyang Technol Univ Sch Comp Engn Parallel & Distributed Comp Ctr Singapore Singapore

ISBN: (纸本)9780769546001

Cloud computing grows rapidly as today's advanced information technology. However, by allowing outsourcing computation on the Cloud, users risk of disclosing privacy and obtaining forged results. these potential threats block sensitive applications to join the Cloud. In this paper, we characterize sensitive applications on the Cloud (SAND) problem and define two critical security requirements: confidentiality and verifiability. the former refers to the protection of sensitive programs/data from disclosing to other users or even the Cloud administrators. the latter concerns with user's capability to verify whether computing results are faithfully calculated. To address SAND, we propose a new Cloud model, Trusted Block as a Service (TBaaS), to provide a confidential and verifiable environment for each sensitive application. TBaaS limits Cloud provider's access of sensitive applications while granting user the ability to verify whether the computation is faithfully carried out. Moreover, it offers high flexibility and low performance overhead.

关键词： Cloud computing Cryptography Hypervisor Information Security Trusted computing

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel scheduling algorithm of dependent task graphs

An efficient parallel scheduling algorithm of dependent task...

引用

4th international conference on parallel and distributed computing, applications and technologies (PDCAT 2003)

作者： Shang, MS Sun, SX Wang, QX Univ Elect Sci & Technol China Dept Comp Sci Chengdu 610054 Peoples R China

ISBN: (纸本)0780378407

Optimal scheduling of tasks of a directed acyclic graph (DAG) onto a set of processors is a strong NP-hard problem. Because list scheduling has shown good performance and is less difficult to design, it has been studied and used widely. In this paper we present a new list scheduling scheme to schedule tasks of a DAG onto a homogeneous multi-processors system. the primary objective of this scheme is to minimize schedule length and scheduling time itself. We analyzed three typical list scheduling algorithms-MCP algorithm, ETF algorithm and BDCP algorithm, and find that they all can not guarantee the earliest schedules of the CPNs. In this paper, we propose a better list scheduling algorithm based on critical path, and its time-complexity is O(pv(2)). this algorithm always it is the most important purpose that schedule CPN as soon as it is a ready task, which makes the nodes that have the greatest influence to the scheduling length of the task graph be scheduled first. this greatly shortens the scheduling length of the task graph. We compare the performance of this algorithm with existing scheduling scheme through analysis and the result of experiments. the scheduling length generated by this algorithm is shorter than that of other scheduling algorithm.

关键词： list scheduling critical path parallel algorithm system

来源：评论

学校读者我要写书评

暂无评论

Joint selection of providers and the new comer for optimal repair in distributed storage network with network coding 15

Joint selection of providers and the new comer for optimal r...

引用

Joint 15th IEEE international conference on Trust, Security and Privacy in computing and Communications, 10th IEEE international conference on Big Data Science and Engineering and 14th IEEE international Symposium on parallel and distributed Processing with applications, IEEE TrustCom/BigDataSE/ISPA 2016

作者： Jia, Chengjin Wang, Jin Zhu, Yanqin Wen, Zhengqing Jia, Juncheng Department of Computer Science and Technology Soochow University China Collobrative Innovation Center of Novel Software Technology and Industrialization China

ISBN: (纸本)9781509032051

In distributed storage networks (DSN), server failures occur frequently. Although network coding can provide high reliability of storage in DSN, to maintain reliability, a new server, named the new comer, should be firstly implemented to replace the failed server. then, new comer should download enough data from multiple storage servers, called provider selected from surviving servers to regenerate the lost data. therefore, the providers, new comer and data routing have a great impact on regeneration time during repair process. In this paper, we jointly consider the providers and new comer selection (JPNS) problem with two objectives of minimizing regeneration time and minimizing transmission cost under the minimum regeneration time guarantee. Specifically, for the first objective, we firstly model the JPNS problem as a mathematical programming and formulate it as an integer linear programming (ILP). We also propose a Heuristic Providers and New Comer Selection (HPNS) algorithm. For the second objective, based on the providers and a new comer selected by the HPNS algorithm, we give a linear programming (LP) to optimally obtain the routing paths and flows from these providers to the new comer with minimum transmission cost. Finally, we conduct extensive simulation experiments and the results show the effectiveness of the proposed algorithms. © 2016 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Sparse Matrix-Vector Multiplication: A Data Mapping-Based Architecture 15

Sparse Matrix-Vector Multiplication: A Data Mapping-Based Ar...

引用

15th international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Mansour, Ahmad Goetze, Juergen Hsu, Wei-Chun Ruan, Shanq-Jang TU Dortmund Informat Proc Lab Dortmund Germany Natl Taiwan Univ Sci & Technol Low Power Syst Design Grp Microsyst Lab Taipei Taiwan

ISBN: (纸本)9781479983346

the performance of the sparse matrix-vector multiplication (SMVM) on a parallel system is strongly affected by the distribution of data among its components. Two costs arise as a result of the used data mapping method: arithmetic and communication. the communication cost often dominates the arithmetic cost, and the gap between these costs tends to increase. therefore, finding a mapping method that reduces the communication cost is of high importance. On the other hand, the load distribution among the processing units must not be sacrificed. In this paper, a data mapping method is proposed for SMVM on Network-on-Chip which achieves balanced working load and reduces the communication cost. Afterwards, an FPGA-based architecture is introduced which is designed to fit with the proposed data mapping method.

关键词： data distribution parallel system Communication Research MAPPING(MAthEMATICAL) Multiplication Load distribution ARCHITECTURE Building construction arithmetic Workload

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：