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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

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

主题

155 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
68 篇 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 篇 grid computing

机构

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 篇 shen hong
11 篇 rothermel kurt
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,724 篇 英文
30 篇 俄文
9 篇 其他
4 篇 中文
1 篇 乌克兰文

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

共 1767 条记录，以下是1091-1100 订阅

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

详细简洁

排序：

Handling recoverable temporal violations in scientific workflow systems: A workflow rescheduling based strategy 10

Handling recoverable temporal violations in scientific workf...

引用

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

作者： Liu, Xiao Chen, Jinjun Wu, Zhangjun Ni, Zhiwei Yuan, Dong Yang, Yun Faculty of Information and Communication Technologies Swinburne University of Technology Hawthorn Melbourne 3122 Australia Institute of Intelligent Management School of Management Hefei University of Technology Hefei Anhui 230009 China

ISBN: (纸本)9781424469871

Due to the complex nature of scientific workflow systems, the violations of temporal QoS constraints often take place and may severely affect the usefulness of the execution's results. therefore, to deliver satisfactory QoS, temporal violations need to be recovered effectively. However, such an issue has so far not been well addressed. In this paper, we first propose a probability based temporal consistency model to define the temporal violations which are statistically recoverable by light-weight exception handling strategies. Afterwards, a novel Ant Colony Optimisation based two-stage workflow local rescheduling strategy (ACOWR) is proposed to handle detected recoverable temporal violations in an automatic and cost-effective fashion. the simulation results demonstrate the excellent performance of our handling strategy in reducing both local and global temporal violation rates. © 2010 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Data race: tame the beast

Data race: tame the beast

引用

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

作者： Leung, K. Huang, Z. Huang, Q. Werstein, P. Univ Otago Dept Comp Sci Dunedin New Zealand

Data races hamper parallel programming and threaten the reliability of future software. this paper proposes the data race prevention scheme View-Oriented Data race Prevention (VODAP), which can prevent data races in the View-Oriented parallel Programming (VOPP) model. VOPP is a novel shared-memory data-centric parallel programming model, which uses views to bundle mutual exclusion with data access. We have implemented the data race prevention scheme with a memory protection mechanism. Experimental results show that the extra overhead of memory protection is trivial in our applications. the performance is evaluated and compared with modern programming models such as OpenMP and Cilk.

关键词： VOPP View oriented parallel programming Concurrent programming SPMD Data race free Data-centric programming Cilk Multicore Shared-memory

来源：评论

学校读者我要写书评

暂无评论

A feature-based replica consistency strategy for spatial data in distributed GIS

A feature-based replica consistency strategy for spatial dat...

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Liang, Hong Wei, Judong Xing, Yongshan Wu, Jun DongYing 257061 China Zhongyuan Oilfield Oil Production Two Zhongyuan Oilfield PuYang HeNan China

ISBN: (纸本)9780769542874

in distributed Geographic Information System (GIS), spatial data has multi-source, heterogeneous characteristics, so there are data inconsistencies between nodes. Although there were many approaches about data consistency, a single strategy can not meet the replicas of spatial data which has large volume and complex topology. For the particularity of spatial data, through data partitioning, the paper proposed a hybrid replica consistency strategy, base on the feature of spatial data. In large-scale distributed GIS, According to the different update frequency of spatial data, use different data consistency policies to manage the geometric data and attributes data separately. Using above-mentioned strategy to manage spatial data replicas, it may be helpful in reducing the network communication between data sites, reducing the unwanted update checking, increasing the performance of systems, improving the update efficiency of the spatial data. this can complete the consistency of spatial data, and providing users with real-time, rapid and stable geographic information services. © 2010 IEEE.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

引用

11th international conference on parallel and distributed computing, applications and technologies, PDCAT 2010

作者： Shorfuzzaman, Mohammad Graham, Peter Eskicioglu, Rasit Department of Computer Science University of Manitoba Winnipeg MB R3T 2N2 Canada

ISBN: (纸本)9780769542874

Data grids support distributed data-intensive applications that need to access massive datasets stored around the world. Ensuring efficient access to such datasets is hindered by the high latencies of wide-area networks. To speed up access, files can be replicated so a user can access a nearby replica. Replication also provides improved availability, decreased bandwidth use, increased fault tolerance, and improved scalability. Since a grid environment is dynamic, resource availability, network latency, and user requests may change. To address these issues a dynamic replica placement strategy that adapts to changing behaviour is needed. In this paper, we introduce a highly distributed replica placement algorithm for hierarchical data grids. Our algorithm exploits data access histories to identify popular files and determines optimal replication locations to improve access performance by minimizing replication overhead (access and update) assuming a given traffic pattern. the problem is formulated using dynamic programming. We evaluate our algorithm using the OptorSim simulator and find that it offers shorter execution time and reduced bandwidth consumption compared to other dynamic replica placement methods. © 2010 IEEE.

关键词： Wide area networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic graph traversals for concurrent rewriting using work-stealing frameworks for multicore platforms

Dynamic graph traversals for concurrent rewriting using work...

引用

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

作者： Yasugi, Masahiro Hiraishi, Tasuku Umatani, Seiji Yuasa, Taiichi Graduate School of Informatics Kyoto University Sakyo-ku Kyoto 606-8501 Japan Academic Center for Computing and Media Studies Kyoto University Sakyo-ku Kyoto 606-8501 Japan

ISBN: (纸本)9780769543079

parallel programming/execution frameworks for multicore platforms should support as many applications as possible. In general, work-stealing frameworks provide efficient load balancing even for irregular parallel applications. Unfortunately, naive parallel programs for "general computations" governed by rewriting rules over configurations (system states) cause stack overflow or unacceptable load imbalance. In this study, we develop parallel programs to perform probabilistically balanced divide-and-conquer graph traversals. We propose a programming technique for accumulating overflowed calls for the next iteration of repeated parallel stages. In an emerging backtracking-based work-stealing framework called "Tascell," which avoids excessive concurrency, we propose a programming technique for long-term use of workspaces, leading a similar technique in the Cilk framework. © 2010 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

A policy-based framework for automated SLA negotiation for Internet-based Virtual computing Environment

A policy-based framework for automated SLA negotiation for I...

引用

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

作者： Xiao, Zan Cao, Donggang School of Electronics Engineering and Computer Science Peking University Key Laboratory of High Confidence Software Technologies Beijing 100871 China

ISBN: (纸本)9780769543079

Service Level Agreements (SLAs) play an important role in guaranteeing successful collaborations among autonomous entities in Internet-based Virtual computing Environment (iVCE). However, traditional static and predefined SLAs are not suitable for the open and dynamic iVCE. this paper proposes a policy-based framework for supporting dynamic and automated SLA negotiations between autonomous entities in iVCE. Requirements or constraints on SLA attributes as well as negotiation strategies of negotiating parties are both specified in policy specifications using a simple but expressive policy language that extends the WS-Policy framework. According to these policies, a negotiation agent will be dynamically created for each negotiation party, which is responsible for SLA negotiations on behalf of its owner party. We have implemented a prototype of our framework and demonstrated our approach through a case study. © 2010 IEEE.

关键词： Internet Internet-based virtual computing environment Negotiation Policy SLA WS-Policy framework automated SLA negotiation entity collaboration groupware iVCE negotiation agent negotiation strategy policy language policy specification policy-based framewo

来源：评论

学校读者我要写书评

暂无评论

AM++: A Generalized Active Message Framework 10

AM++: A Generalized Active Message Framework

引用

19th international conference on parallel Architectures and Compilation Techniques

作者： Willcock, Jeremiah J. Hoefler, Torsten Edmonds, Nicholas G. Lumsdaine, Andrew Indiana Univ Bloomington IN 47401 USA

ISBN: (纸本)9781450301787

Active messages have proven to be an effective approach for certain communication problems in high performance computing. Many MPI implementations, as well as runtimes for Partitioned Global Address Space languages, use active messages in their low-level transport layers. However, most active message frameworks have low-level programming interfaces that require significant programming effort to use directly in applications and that also prevent optimization opportunities. In this paper we present AM++, a new user-level library for active messages based on generic programming techniques. Our library allows message handlers to be run in an explicit loop that can be optimized and vectorized by the compiler and that can also be executed in parallel on multicore architectures. Runtime optimizations, such as message combining and filtering, are also provided by the library, removing the need to implement that functionality at the application level. Evaluation of AM++ with distributed-memory graph algorithms shows the usability benefits provided by these library features, as well as their performance advantages.

关键词： Active Messages parallel Graph Algorithms parallel Programming Interfaces

来源：评论

学校读者我要写书评

暂无评论

Query Optimization over parallel Relational Data Warehouses in distributed Environments by Simultaneous Fragmentation and Allocation

Query Optimization over Parallel Relational Data Warehouses ...

引用

10th international conference on Algorithms and Architectures for parallel Processing

作者： Bellatreche, Ladjel Cuzzocrea, Alfredo Benkrid, Soumia Univ Poitiers LISI ENSMA Futuroscope France Univ Calabria ICAR CNR Cosenza Italy ESI Natl High Sch Comp Sci Algiers Algeria

ISBN: (纸本)9783642131189

parallel database technology has already shown its efficiency in supporting high-performance Online Analytical Processing (OLAP) applications. this scenario implies achieving query optimization over relational Data Warehouses (RDW) on top of which typical OLAP functionalities, such as roll-up, drill-down and aggregate query answering, can be implemented. As a result, it follows the emerging need for a comprehensive methodology able to support the design of RDW over parallel and distributed environments in all the phases, including data partitioning, fragment allocation, and data replication. Existing design approaches have an important limitation: fragmentation and allocation phases are performed in an isolated manner. In order to overcome this limitation, in this paper we propose a new methodology for designing parallel RDW over distributed environments, for query optimization purposes. the methodology is illustrated on database clusters, as a noticeable case of distributed environments. Contrary to state-of-the-art approaches where allocation is performed after fragmentation, in our approach we propose allocating fragments just during the partitioning phase. Also, a naive replication algorithm that takes into account the heterogeneous characteristics of our reference architecture is proposed.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

Automating reusable-procedure discovery through developer's action analysis

Automating reusable-procedure discovery through developer's ...

引用

international conference on Quality Software

作者： Zhang, Nuyun Huang, Gang Zhang, Ying Ning, Jiang Mei, Hong Key Laboratory of High Confidence Software Technologies School of Electronics Engineering and Computer Science Peking University Beijing China

ISBN: (纸本)9780769541310

Reusable procedures can improve the efficiency of software development since they describe necessary steps for completing programming tasks. However, these procedures are often not fully provided in manuals, and discovering such procedures requires a lot of experience. In this paper, we propose an approach to automatically discover reusable procedures from developer actions. First, our approach collects developers' action sequences for a similar task. Second, our approach divides sequences into sub-sequences. third, by comparing steps of sub-sequences, our approach eliminates task-unrelated steps and mine the reusable steps. Finally, by combining the reusable steps together in a reasonable way, our approach generates a reusable procedure with more than one path. Based on our approach, we implemented a tool (Eclipse plugin). We conduct an experiment to evaluate the correctness of our approach. We also conduct an empirical study to evaluate the usefulness of generated procedure. © 2010 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

InterCloud: Utility-Oriented Federation of Cloud computing Environments for Scaling of Application Services

InterCloud: Utility-Oriented Federation of Cloud Computing E...

引用

10th international conference on Algorithms and Architectures for parallel Processing

作者： Buyya, Rajkumar Ranjan, Rajiv Calheiros, Rodrigo N. Univ Melbourne Dept Comp Sci & Software Engn Cloud Comp & Distributed Syst CLOUDS Lab Melbourne Vic 3010 Australia Manjrasoft Pty Ltd Melbourne Vic Australia Univ New South Wales Sch Comp Sci & Engn Sydney NSW Australia

ISBN: (纸本)9783642131189

Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers around the world. However, existing systems do not support mechanisms and policies for dynamically coordinating load distribution among different Cloud-based data centers in order to determine optimal location for hosting application services to achieve reasonable QoS levels. Further, the Cloud computing providers are unable to predict geographic distribution of users consuming their services, hence the load coordination must happen automatically, and distribution of services must change in response to changes in the load. To counter this problem, we advocate creation of federated Cloud computing environment (Inter Cloud) that facilitates just-in-time, opportunistic, and scalable provisioning of application services, consistently achieving QoS targets under variable workload, resource and network conditions. the overall goal is to create a computing environment that supports dynamic expansion or contraction of capabilities (VMs, services, storage, and database) for handling sudden variations in service demands. this paper presents vision, challenges, and architectural elements of InterCloud for utility-oriented federation of Cloud computing environments. the proposed Inter Cloud environment supports scaling of applications across multiple vendor clouds. We have validated our approach by conducting a set of rigorous performance evaluation study using the CloudSim toolkit. the results demonstrate that federated Cloud computing model has immense potential as it offers significant performance gains as regards to response time and cost saving under dynamic workload scenarios.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 106 107 108 109 110 111 112 113 114 115 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：