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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

991 篇 会议
20 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

764 篇 工学
- 736 篇 计算机科学与技术...
- 526 篇 软件工程
- 195 篇 信息与通信工程
- 78 篇 控制科学与工程
- 59 篇 电子科学与技术（可...
- 58 篇 电气工程
- 21 篇 动力工程及工程热...
- 19 篇 机械工程
- 16 篇 生物医学工程（可授...
- 15 篇 生物工程
- 13 篇 建筑学
- 12 篇 环境科学与工程（可...
- 11 篇 安全科学与工程
- 8 篇 仪器科学与技术
- 7 篇 化学工程与技术
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 土木工程
256 篇 理学
- 209 篇 数学
- 34 篇 统计学（可授理学、...
- 31 篇 系统科学
- 21 篇 物理学
- 20 篇 生物学
- 12 篇 化学
221 篇 管理学
- 170 篇 管理科学与工程(可...
- 111 篇 工商管理
- 67 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
10 篇 法学
- 7 篇 社会学
6 篇 医学
- 6 篇 基础医学(可授医学...
4 篇 农学
3 篇 文学
2 篇 教育学

主题

95 篇 distributed comp...
71 篇 parallel process...
53 篇 grid computing
50 篇 peer to peer com...
48 篇 distributed comp...
33 篇 parallel process...
32 篇 servers
31 篇 fault tolerance
30 篇 computer archite...
29 篇 computational mo...
27 篇 distributed data...
24 篇 protocols
21 篇 concurrent compu...
21 篇 software enginee...
21 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
18 篇 artificial intel...
17 篇 bandwidth

机构

11 篇 institute of com...
10 篇 institute of com...
5 篇 academic center ...
5 篇 department of in...
4 篇 institute of par...
4 篇 national laborat...
4 篇 graduate univers...
4 篇 national laborat...
3 篇 school of comput...
3 篇 chinese academy ...
3 篇 institute of inf...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 computer science...
2 篇 pervasive techno...
2 篇 inria
2 篇 disca univ. poli...
2 篇 state key labora...
2 篇 west bengal univ...
2 篇 dcse college of ...

作者

7 篇 valentin cristea
5 篇 kurt rothermel
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
4 篇 dongarra jack
4 篇 tang tao
4 篇 wang guibin
4 篇 florin pop
4 篇 matsumoto masaki
4 篇 andresen daniel
3 篇 suter frédéric
3 篇 kawamura takao
3 篇 xhafa fatos
3 篇 alexandru costan
3 篇 lin yisong
3 篇 cristea valentin
3 篇 takata toyoo

语言

1,001 篇 英文
19 篇 其他

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2010"

共 1020 条记录，以下是231-240 订阅

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

详细简洁

排序：

Implementation of Cryptographic Algorithms on a Grid Infrastructure

Implementation of Cryptographic Algorithms on a Grid Infrast...

引用

IEEE international conference on Automation, Quality and Testing, Robotics (AQTR)

作者： Cebuc, E. Suciu, A. Marton, K. Dolha, S. Muresan, L. Tech Univ Cluj Napoca Cluj Napoca Romania

ISBN: (纸本)9781424467259

Cryptographic algorithms are the fundamental building blocks of information security systems and their strength generally relies on the concept of computational complexity. But the process of increasing the computational effort needed by an adversary in order to break the provided security has a dramatic impact on the performance of the cryptographic application and sets a severe limit to the proposed security level due to the computational and data intensive operations which require extensive processing power and storage resources. Our solution is to link cryptography to an architecture specially designed to satisfy these demands, namely Grid computing, which has known an increasing popularity in recent years. The wide majority of cryptographic algorithms are designed sequentially and are not ready to embrace the enhancement brought by advances in parallel and distributed computing technologies and hence can not take the plunge to a higher performance level through parallel execution without a proper adjustment process. This paper presents our results on adjusting and implementing several well known cryptographic algorithms on a Grid infrastructure focusing on the achieved performance improvements.

关键词： parallel execution cryptographic algorithms public key private key bloc cipher stream cipher hash function random number generator Grid gLite middleware

来源：评论

学校读者我要写书评

暂无评论

VirtCFT: A transparent VM-level fault-tolerant system for virtual clusters

VirtCFT: A transparent VM-level fault-tolerant system for vi...

引用

16th IEEE international conference on parallel and distributed systems, ICPADS 2010

作者： Zhang, Minjia Jin, Hai Shi, Xuanhua Wu, Song Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769543079

A virtual cluster consists of a multitude of virtual machines and software components that are doomed to fail eventually. In many environments, such failures can result in unanticipated, potentially devastating failure behavior and in service unavailability. The ability of failover is essential to the virtual cluster's availability, reliability, and manageability. Most of the existing methods have several common disadvantages: requiring modifications to the target processes or their OSes, which is usually error prone and sometimes impractical;only targeting at taking checkpoints of processes, not whole entire OS images, which limits the areas to be applied. In this paper we present VirtCFT, an innovative and practical system of fault tolerance for virtual cluster. VirtCFT is a system-level, coordinated distributed checkpointing fault tolerant system. It coordinates the distributed VMs to periodically reach the globally consistent state and take the checkpoint of the whole virtual cluster including states of CPU, memory, disk of each VM as well as the network communications. When faults occur, VirtCFT will automatically recover the entire virtual cluster to the correct state within a few seconds and keep it running. Superior to all the existing fault tolerance mechanisms, VirtCFT provides a simpler and totally transparent fault tolerant platform that allows existing, unmodified software and operating system (version unawareness) to be protected from the failure of the physical machine on which it runs. We have implemented this system based on the Xen virtualization platform. Our experiments with real-world benchmarks demonstrate the effectiveness and correctness of VirtCFT. © 2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Granularity-aware work-stealing for computationally-uniform Grids 10

Granularity-aware work-stealing for computationally-uniform ...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Janjic, Vladimir Hammond, Kevin School of Computer Science University of St Andrews United Kingdom

ISBN: (纸本)9781424469871

Good scheduling is important for ensuring effective use of Grid resources, while maximising parallel performance. In this paper, we show how a basic "Random-Stealing" load balancing algorithm for computational Grids can be improved by using information about the task granularity of parallel programs. We propose several strategies (SSL,SLL and LLL) for using granularity information to improve load balancing, presenting results both from simulations and from a real implementation (the Grid-GUM Runtime System for parallel Haskell). We assume a common model of task creation which subsumes both master/worker and data-parallel programming paradigms under a task-stealing work distribution strategy. Overall, we achieve improvement in runtime of up to 19.4% for irregular problems in the real implementation, and up to 40% for the simulations (typical improvements of more that 15% for irregular programs, and from 5-10% for regular ones). Our results show that, for computationally-uniform Grids, advanced load balancing methods that exploit granularity information generally have the greatest impact on reducing the runtimes of irregular parallel programs. Moreover, the more irregular the program is, the better the improvements that can be achieved. © 2010 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Optimizing adaptive synchronization in parallel simulators for large-scale parallel systems and applications

Optimizing adaptive synchronization in parallel simulators f...

引用

10th IEEE international conference on Computer and Information Technology, CIT-2010, 7th IEEE international conference on Embedded Software and systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Xu, Chuanfu Che, Yonggang Fang, Jianbin Wang, Zhenghua National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769541082

This paper addresses the optimization of parallel simulators for large-scale parallel systems and applications. Such simulators are often based on parallel discrete event simulation with conservative or optimistic protocols to synchronize the simulating processes. The paper considers how available future information about events and application behaviors can be efficiently extracted and further exploited to improve the performance of adaptive optimistic protocols. First, we extract information about future events and their dependencies in application traces to guide adaptive adjustments of time window in trace-driven parallel simulation. Second, we use information about application behaviors, specifically the iterative behavior found in many applications, to avoid the unnecessary adjustments of time window. These techniques are implemented in the BigSim simulator and tested by real-world and standard benchmark applications including Jacobi3D and HPL. The results show that our optimization approaches can reduce the execution times of simulation ranging from 11% up to 32%. Moreover, our methods are easy to implement and don't need to augment compilers or even modify the core codes of parallel simulators. © 2010 IEEE.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Gustav: A lightweight approach to CPU accounting in distributed systems

Gustav: A lightweight approach to CPU accounting in distribu...

引用

5th international conference on P2P, parallel, Grid, Cloud and Internet computing, 3PGCIC 2010

作者： Barbera, Roberto Giorgio, Emidio Hwang, Soonwook Ricciardi, Gianni Mario Department of Physics and Astronomy University of Catania Italy Istituto Nazionale di Fisica Nucleare Sezione di Catania Catania Italy Korea Institute of Science and Technology Information Daejeon Korea Republic of Consorzio COMETA Catania Italy

ISBN: (纸本)9780769542379

Geographically distributed computational infrastructures, based on the grid paradigm, are increasingly coming out of the research sphere where they originated, candidating themselves as a low-effort business solution for accessing and using vaste computating infrastructures, much larger than those small-medium enterprises can usually afford building 'in house'. In such scenario, accounting and billing systems play a key role, as any business model cannot opt out of instruments showing how many resources have been used in a given period of time and by whom. For this reason, several accounting systems have been developed in the last years, for various grid middleware. Although each of them has its own features, they are generally targeted for large-size infrastructures, because of the comprehensive range of results available and the vast effort to implement and deploy them. However, sometimes different needs arise, especially for smaller sites participating to large distributed infrastructures. Gustav aims to fulfill some of these requirements in a simple and reliable way, and could be considered as an alternative approach to CPU accounting for grid sites. © 2010 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

A distributed Market Framework for Large-Scale Resource Sharing

A Distributed Market Framework for Large-Scale Resource Shar...

引用

16th international Euro-Par conference on parallel Processing

作者： Mihailescu, Marian Teo, Yong Meng Natl Univ Singapore Dept Comp Sci Singapore 117417 Singapore

ISBN: (纸本)9783642152764

Current distributed computing infrastructures, such as peer-to-peer networks, grids, and more recently clouds, make sharing and trading resources ubiquitous. In these large distributed systems, rational users are both providers and consumers of resources. Currently, there is growing interest in exploiting economic models for the allocation of shared computing resources that incentivize rational users. However, when the number of resource types and users increases, computational complexity of the allocation algorithms grows rapidly and efficiency deteriorates. In this paper, we propose a scalable distributed market framework for the allocation of shared resources in large distributed systems. We use mechanism design to create a pricing scheme that allocates a request for multiple resource types, by trading economic efficiency for computational efficiency, strategy-proof and budget-balance. To address scalability, our proposed framework leverages on a peer-to-peer overlay for resource discovery and management. We prototype our framework using Free Pastry, a popular overlay network based on the Pastry protocol. We show that our scheme is efficient and scalable using both simulation experiments and results from the deployment on Plant Lab.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Identification, modelling and prediction of non-periodic bursts in workloads 10

Identification, modelling and prediction of non-periodic bur...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Lassnig, Mario Fahringer, Thomas Garonne, Vincent Molfetas, Angelos Branco, Miguel Distributed and Parallel Systems University of Innsbruck 6020 Innsbruck Austria Distributed Data Management CERN PH-ADP 1211 Geneva 23 Switzerland Electronics and Computer Science University of Southampton SO17 1BJ United Kingdom

ISBN: (纸本)9781424469871

Non-periodic bursts are prevalent in workloads of large scale applications. Existing workload models do not predict such non-periodic bursts very well because they mainly focus on repeatable base functions. We begin by showing the necessity to include bursts in workload models by investigating their detrimental effects in a petabyte-scale distributed data management system. This work then makes three contributions. First, we analyse the accuracy of five existing prediction models on workloads of data and computational grids, as well as derived synthetic workloads. Second, we introduce a novel averages-based model to predict bursts in arbitrary workloads. Third, we present a novel metric, mean absolute estimated distance, to assess the prediction accuracy of the model. Using our model and metric, we show that burst behaviour in workloads can be identified, quantified and predicted independently of the underlying base functions. Furthermore, our model and metric are applicable to arbitrary kinds of burst prediction for time series. © 2010 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Transient congestion avoidance in software distributed shared memory systems

Transient congestion avoidance in software distributed share...

引用

11th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2010

作者： Costa, J.J. Cortes, T. Martorell, X. Bueno, J. Ayguade, E. Universitat Politècnica de Catalunya Barcelona Supercomputing Center Spain

ISBN: (纸本)9780769542874

OpenMP applications executed on top of software distributed shared memory (SDSM) systems show peaks in network traffic. In these scenarios, synchronization points are used to maintain memory consistency and improve performance, and network traffic is highly increased due to data being exchanged between different nodes in the system. This behaviour generates network congestion which may limit or degrade applications performance. In this paper we present a technique to avoid these peaks by sending data producing the congestion earlier in time. Our proposal is to introduce virtual synchronization points between the real ones, and use them to automatically distribute the network traffic. This technique is evaluated with a synthetic benchmark, and with the classes A and B of two OpenMP codes from the NAS benchmarks (BT and CG), on top of NanosDSM, a page-based DSM implementing sequential consistency. The results show a 16% performance improvement on average over the traditional methods. © 2010 IEEE.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Web object prefetching: Approaches and a new algorithm

Web object prefetching: Approaches and a new algorithm

引用

11th ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing, SNPD2010

作者： Kazi, Toufiq Hossain Feng, Wenying Hu, Gongzhu Departments of Computing and Information Systems Department of Mathematics Trent University Peterborough ON K9J 7B8 Canada Department of Computer Science Central Michigan University Mount Pleasant MI 48859 United States

ISBN: (纸本)9780769540887

In Internet applications, Web object prefetching is a commonly used and quite effective algorithmic approach to reduce user perceived delays. While a separate concept, prefetching is closely related to caching and they are often blended together in Web algorithms. In this paper, we give a review of Web prefetching models and algorithms, categorize them into groups based on their design principles, and compare their functionalities and performance. We then proposed a new prefetching algorithm that is based on the Adaptive Resonance Theory (ART) of neural networks. The new model uses the bottom-up and top-down weights of the cluster-URL connections obtained from a modified ART1 algorithm to make prefecthing decisions. © 2010 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A domain-specific question answering system based on ontology and question templates

A domain-specific question answering system based on ontolog...

引用

11th ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing, SNPD2010

作者： Wang, D.S. Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China Graduate University of the Chinese Academy of Sciences Beijing China Department of Computer Science Jiangsu University of Science and Technology Zhenjiang China

ISBN: (纸本)9780769540887

The rapid growth in the development of Internet-based information systems increases the demand for natural language interfaces that are easy to set up and maintain. Unfortunately, the problem of deep understanding natural language queries is far from being solved. In this paper, an automated question answering system based on domain ontology and question template is proposed, which does not need deep understanding of user's questions. Ontology was employed to model the interesting domain, and properties of concepts are described by a collection of question templates. The system captures a user's intention by matching his questions to predefined templates, and return answers corresponding to template's query focus. The system has been applied to mobile service consulting area, and experimental results show that the system has high practicability as well as maintainability. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：