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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,364 篇 工学
- 1,234 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

108 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
61 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
10 篇 bogdanov alexand...
10 篇 shen hong
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,704 篇 英文
40 篇 其他
18 篇 中文
9 篇 俄文

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

共 1770 条记录，以下是961-970 订阅

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

详细简洁

排序：

Performance evaluation of Yahoo! S4: A first look

Performance evaluation of Yahoo! S4: A first look

引用

2012 7th international conference on P2P, parallel, Grid, Cloud and Internet computing, 3PGCIC 2012

作者： Chauhan, Jagmohan Chowdhury, Shaiful Alam Makaroff, Dwight Department of Computer Science University of Saskatchewan Saskatoon SK S7N 3C9 Canada

ISBN: (纸本)9781467329910

Processing large data sets has been dominated recently by the map/reduce programming model [1], originally proposed by Google and widely adopted through the Apache Hadoop1 implementation. Over the years, developers have identified weaknesses of processing data sets in batches as in MapReduce and have proposed alternatives. One such alternative is continuous processing of data streams. this is particularly suitable for applications in online analytics, monitoring, financial data processing and fraud detection that require timely processing of data, making the delay introduced by batch processing highly undesirable. this processing paradigm has led to the development of systems such as Yahoo! S4 [2] and Twitter Storm.2 Yahoo! S4 is a general-purpose, distributed and scalable platform that allows programmers to easily develop applications for processing continuous unbounded streams of data. As these frameworks are quite young and new, there is a need to understand their performance for real time applications and find out the existing issues in terms of scalability, execution time and fault tolerance. We did an empirical evaluation of one application on Yahoo! S4 and focused on the performance in terms of scalability, lost events and fault tolerance. Findings of our analyses can be helpful towards understanding the challenges in developing stream-based data intensive computing tools and thus providing a guideline for the future development. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Garbage Collection for Service Oriented distributed Reliable Environment D-ReServE

Garbage Collection for Service Oriented Distributed Reliable...

引用

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

作者： Jerzy Brzezinski Arkadiusz Danilecki Mateusz Holenko Anna Kobusinska Piotr Zierhoffer Institute of Computing Science Poznań University of Technology Poznan Poland

ISBN: (纸本)9781467357043

D-ReServE increases reliability of SOA-based systems in case of failure occurrence. the fault-tolerant information in D-ReServE is stored in the Stable Storage, which available space depletes with time. thus, in this paper we propose a garbage collection protocol for D-ReServE that allows the periodic purging of the Stable Storage, and discuss the challenges of garbage collection due to the nature of SOA systems.

关键词： Protocols Computer integrated manufacturing Business Service-oriented architecture Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

ICA3PP 2012 Panel on Future and Challenges of parallel and distributed computing

ICA3PP 2012 Panel on Future and Challenges of Parallel and D...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted computing, UIC-ATC

Summary form only given, as follows. Today, both parallel and distributing computing have became ubiquitous in the forms of clouds and cyber physical systems. We have witnessed the fast developing technology fundamentally changing the balances and paradigms between cost of computing, communication and programming: At the hardware level, the essential aspect of quickly changing landscape is the difference in growth of network bandwidth, processor speed and memory access times. High speed networks are changing balance on the networking side, because port throughput is more limited by the processor speed than by the network bandwidth, as it was in the past. At the same time, the latency of the networks is fundamentally limited by the speed of light and the distance that the transferred data need to travel. On the other hand, the speed of a processor is growing faster than the access time to the memory (where the technological advances are used to increase the memory chip capacity rather than its speed). the resulting use of buffering to mask the speed differences has led to the multi-memory hierarchy in which registers, primary cache, secondary cache and main memory are typical layers with progressively lower speed but larger capacity. this panel will discuss the exciting and promising future of parallel and distributed computing. A record of the panel discussion was not made available for publication as part of the conference proceedings.

关键词： distributed computing Hardware Software Security Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Scalable Performance Predictions of distributed Peer-to-Peer applications

Scalable Performance Predictions of Distributed Peer-to-Peer...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Bogdan Florin Cornea Julien Bourgeois the Tung Nguyen Didier El-Baz DISC FEMTO-ST Institute University of Franche-Comté Montbeliard France CNRS LAAS Université de Toulouse Toulouse France

Recently, a new environment for high performance peer-to-peer distributed computing was proposed. this environment, named P2PDC, addresses stable or volatile systems communicating in a decentralized manner using the self-adaptive protocol P2PSAP. P2PDC is devoted to task parallel applications like numerical simulation problems or optimization problems solved via parallel or distributed iterative algorithms. For distributed applications meant to run with P2PDC, a performance prediction tool named dPerf was proposed. dPerf combines static and dynamic analysis with trace-based simulation to provide scientist with information about the execution of their large scale numerical simulation applications. dPerf addresses real parallel and distributed numerical simulation and optimisation applications written in C, C++ or Fortran for P2PDC. this paper introduces an enhancement of the dPerf tool which provides scalable performance prediction results. Scaling is done with respect to (i) network configuration and (ii) number of peers. Scaling predictions based on network configuration is achieved through trace-based simulation, where various architectures can be studied. Scaling predictions based on the number of peers implies analyzing the communication topology and modifying trace files prior to simulation. We present experimental results obtained for the obstacle problem, a C/P2PDC implementation of the code used in mechanics and finance. Prediction for this application is computed under real conditions, with a reduced slowdown and by providing user with scalable results.

关键词： Peer to peer computing Topology Computer architecture Predictive models Scalability Computational modeling Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

threadLocalMRG32k3a: A statistically sound substitute to pseudorandom number generation in parallel Java applications

ThreadLocalMRG32k3a: A statistically sound substitute to pse...

引用

2012 10th Annual international conference on High Performance computing and Simulation, HPCS 2012

作者： Passerat-Palmbach, Jonathan Mazel, Claude Hill, David R. C. Clermont Université BP 10448 F-63000 Clermont-Ferrand France CNRS UMR 6158 Université Blaise Pascal F-63173 France ISIMA Institut Supérieur d'Informatique de Modélisation et de Leurs Applications BP 10125 F-63177 France

ISBN: (纸本)9781467323598

parallel And distributed Simulations (PADS) become more and more spread since scientists always want more accurate results in the shortest time. PADS are often sensitive to several parameters, and when they own a stochastic component, one has to ensure he knows how to correctly deal with randomness in a parallel application. this point can appear to be very tricky for non-experts, who might be tempted to move this part of the simulation aside. Several software efforts have been produced in various programming languages to help developers handle pseudorandom streams partitioning in PADS. However, these tools remain third-party libraries that need to be integrated in already existing applications, and that might be hardly swappable. the latest release of the Java Development Kit (JDK 7) tries to tackle this problem with a new class called threadLocalRandom. the latter is in charge of safe pseudorandom number generation across Java threads. the present work studies the pros and cons of this approach, and introduces threadLocalMRG32k3a, an alternative to threadLocalRandom that shows better results in terms of generation speed and statistical quality. threadLocalMRG32k3a respects the same Application Programming Interface (API) as threadLocalRandom, thus enabling clients to use it in place of its JDK counterpart at no cost. © 2012 IEEE.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Mechanised Verification of distributed State-Space Algorithms for Security Protocols

Mechanised Verification of Distributed State-Space Algorithm...

引用

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

作者： Frédéric Gava Arthur Hidalgo Jean Fortin University of Paris-East France

ISBN: (纸本)9781467357043

Explicit model-checking (MC) is a classical solution to find flaws in a security protocol. But it is well-known that for non trivial protocols, MC may enumerate state-spaces of astronomical sizes - the famous state-space explosion problem. distributed model checking is a solution but complex and subject to bugs: a MC can validate a model but miss an invalid state. In this paper, we focus on using a verification condition generator that takes annotated distributed algorithms and ensures their termination and correctness. We study five algorithms (one sequential and four distributed where three of them are dedicated and optimised for security protocol) of state-space construction as a first step towards mechanised verification of distributed model-checkers.

关键词： Protocols Security Partitioning algorithms Computational modeling distributed algorithms parallel algorithms Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Network Load Analysis and Provisioning of MapReduce applications

Network Load Analysis and Provisioning of MapReduce Applicat...

引用

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

作者： Nikzad Babaii Rizvandi Javid Taheri Reza Moraveji Albert Y. Zomaya The University of Sydney Sydney NSW AU Center for Distributed and High Performance Computing School of Information Technologies University of Sydney Sydney Australia

ISBN: (纸本)9781467357043

In this paper, we study the dependency between MapReduce configuration parameters and network load of fixed-size MapReduce jobs during the shuffle phase, then we propose an analytical method to model this dependency. Our approach consists of three key phases: profiling, modeling, and prediction. In the first stage, an application is run several times with different sets of MapReduce configuration parameters (here number of map tasks and number of reduce tasks) to profile the network load of an application in the shuffle phase on a given cluster. then, the relation between these parameters and the network load is modeled by multivariate linear regression. For evaluation, three applications (Word Count, Exim Main log parsing, and TeraSort) are utilized to evaluate our technique on a 5-node MapReduce private cluster.

关键词： Load modeling Predictive models Accuracy Computational modeling Mathematical model distributed computing Data models

来源：评论

学校读者我要写书评

暂无评论

Study on Quantum parallel Processing by Adiabatic Quantum Computation in Bernstein-Vazirani Problem

Study on Quantum Parallel Processing by Adiabatic Quantum Co...

引用

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

作者： Shigeru Nakayama Peng Gang Ichiro Iimura Department of Information Science and Biological Engineering Kagoshima University Kagoshima Japan Department of Computer Science Huizhou University Huizhou China Department of Administration Prefectural University of Kumamoto Kumamoto Japan

ISBN: (纸本)9781467357043

Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Bernstein-Vazirani problem more efficiently by a method with higher observation probability.

关键词： Quantum computing Vectors Transforms Hafnium Energy states Optimization parallel processing

来源：评论

学校读者我要写书评

暂无评论

Revisiting Snapshot Algorithms by Refinement-Based Techniques

Revisiting Snapshot Algorithms by Refinement-Based Technique...

引用

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

作者： Manamiary Bruno Andriamiarina Dominique Méry Neeraj Kumar Singh LORIA Université de Lorraine Vandoeuvre-les-Nancy France University of York York UK

ISBN: (纸本)9781467357043

the snapshot problem addresses a collection of important algorithmic issues related to the distributed computations, which are used for debugging or recovering the distributed programs. Among the existing solutions, Chandy and Lamport propose a simple distributed algorithm. In this paper, we explore the correct-by-construction process to formalize the snapshot algorithms in distributed system. the formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform. these refinement-based techniques help to derive a correct distributed algorithm. Moreover, we demonstrate how this class of other distributed algorithms can be revisited. A consequence is to provide a fully mechanized proof of the distributed algorithms.

关键词： distributed algorithms Computational modeling Abstracts Concrete System recovery Electronic mail Context

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Load Balancing Approach for parallel Search-Tree Optimization

A Decentralized Load Balancing Approach for Parallel Search-...

引用

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

作者： F.N. Abu-Khzam A.E. Mouawad Lebanese American University Beirut Beirut LB University of Waterloo Waterloo ON CA

ISBN: (纸本)9781467357043

Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from such processing capabilities is naturally that of exact algorithms for NP-hard problems. We propose a general implementation framework that targets highly scalable parallel exact algorithms for NP-hard graph problems. We tackle the problems of efficiency and scalability by combining a fully decentralized dynamic load balancing strategy with special implementation techniques for exact graph algorithms. As a case-study, we use our framework to implement parallel algorithms for the VERTEX COVER and DOMINATING SET problems. We present experimental results that show notable improved running times on all types of input instances.

关键词： Heuristic algorithms Load management Network topology Supercomputers Optimization Topology Scalability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 93 94 95 96 97 98 99 100 101 102 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：