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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
3 册 图书

馆藏范围

1,014 篇 电子文献
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 篇 cloud computing
19 篇 parallel program...
18 篇 graphics process...
18 篇 algorithm design...
17 篇 bandwidth
17 篇 middleware
17 篇 artificial intel...

机构

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

语言

995 篇 英文
19 篇 其他

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

共 1014 条记录，以下是181-190 订阅

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

详细简洁

排序：

Dynamic load balancing in parallel KD-Tree k-Means

Dynamic load balancing in parallel KD-Tree k-Means

引用

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

作者： Di Fatta, Giuseppe Pettinger, David School of Systems Engineering University of Reading Whiteknights Reading Berkshire RG6 6AY United Kingdom

ISBN: (纸本)9780769541082

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multi-dimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy. © 2010 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

License management in grid and cloud computing

License management in grid and cloud computing

引用

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

作者： Raekow, Yona Simmendinger, Christian Grabowski, Piotr Jenz, Domenic Fraunhofer SCAI St. Augustin Germany T-Systems Solutions for Research Stuttgart Germany Poznan Supercomputing and Networking Center Poznan Poland Stuttgart Germany

ISBN: (纸本)9780769542379

The lack of license management schemes in distributed environments is becoming a major obstacle for the commercial adoption of Grid or Cloud infrastructures. In this paper, we present a complete license management architecture that enables a pay-per-use license management which can be deployed together with an on-demand computing scenario. Our architecture enables authenticated access to a remote license server. The license management architecture can be deployed in any distributed environment. It supports existing client/server based software license management tools (for example FlexNet Publisher). This allows an easy transition from current software license business models which support only a local license management towards business models which support license management in distributed environments. © 2010 IEEE.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

distributed, parallel and biologically inspired systems: 7th IFIPTC 10working conference, DIPES 2010 and 3rd IFIP TC 10 international conference, BICC 2010 held as part of WCC 2010 Brisbane, Australia, september 20-23, 2010 proceedings 7th

Distributed, parallel and biologically inspired systems: 7th...

引用

7th IFIP TC 10 Working conference on distributed and parallel Embedded systems, DIPES 2010 and 3rd IFIP TC 10 international conference on Biologically-Inspired Collaborative computing, BICC 2010 Held as Part of 21st IFIP World Computer Congress, WCC 2010

作者： Hinchey, Mike Kleinjohann, Bernd Kleinjohann, Lisa Lindsay, Peter Rammig, Franz J. Timmis, Jon Wolf, Marilyn Lero University of Limerick Limerick Ireland University of Paderborn/C-Lab Germany University of Queensland St.Lucia Australia University of Paderborn Heinz Nixdorf Institute Germany University ofYork Heslington United Kingdom Georgia Institute of Technology Atlanta United States

来源：评论

学校读者我要写书评

暂无评论

A methodology for the use of the teleo-reactive programming technique in autonomic computing

A methodology for the use of the teleo-reactive programming ...

引用

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

作者： Hawthorne, James Anthony, Richard School of Computing and Mathematical Sciences University of Greenwich London United Kingdom

ISBN: (纸本)9780769540887

Previous work on the use of the Teleo-Reactive technique in high level software development has shown it to be a viable approach for autonomic systems. A T-R program can recover from unexpected events without knowing the underlying source or cause of the problem and thus reduces the maintenance costs of software projects where unexpected events are a likely and frequent occurrence. Previous work has also highlighted the difficult nature of designing and structuring the high level logic in a T-R program and so this work aims to reduce the problem by providing a software engineering strategy that will both drive the program development and reduce the occurrence of logic problems. © 2010 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Aggregation of real-time system monitoring data for analyzing large-scale parallel and distributed computing environments

Aggregation of real-time system monitoring data for analyzin...

引用

IEEE international conference on High Performance computing and Communication

作者： Böhm, S. Engelmann, C. Scott, S.L. Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN 37831 United States Department of Computer Science University of Reading Reading RG6 6AH United Kingdom

ISBN: (纸本)9780769542140

We present a monitoring system for large-scale parallel and distributed computing environments that allows to trade-off accuracy in a tunable fashion to gain scalability without compromising fidelity. The approach relies on classifying each gathered monitoring metric based on individual needs and on aggregating messages containing classes of individual monitoring metrics using a tree-based overlay network. The MRNet-based prototype is able to significantly reduce the amount of gathered and stored monitoring data, e.g., by a factor of ≈56 in comparison to the Ganglia distributed monitoring system. A simple scaling study reveals, however, that further efforts are needed in reducing the amount of data to monitor future-generation extreme-scale systems with up to 1,000,000 nodes. The implemented solution did not had a measurable performance impact as the 32-node test system did not produce enough monitoring data to interfere with running applications. © 2010 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Transfer data optimization in parallel computing

Transfer data optimization in parallel computing

引用

2010 2nd IEEE international conference on Network Infrastructure and Digital Content, IC-NIDC 2010

作者： Hong, Joonmo Yoo, Sung Hoon Yang, Jisu Kang, BooJoong Im, Eul Gyu ECE Division Hanyang University Seoul Korea Republic of Dept. of Computer Science and Engineering Hanyang University Seoul Korea Republic of

ISBN: (纸本)9781424468546

parallel computing is still evolving. Although there are great improvements in the field, still remains to be improved. The major research trend of parallel computing is now shifting to software technology from hardware architecture. We proposed a parallel technique to reduce network latency based on data's behavior of change, implemented it to real application GEOS-Chem, and made it faster. ©2010 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Grids-Based Data parallel computing for Learning Optimization in a Networked Learning Control systems

Grids-Based Data Parallel Computing for Learning Optimizatio...

引用

international conference on Life System Modeling and Simulation / international conference on Intelligent computing for Sustainable Energy and Environment (LSMS-ICSEE)

作者： Xu, Lijun Fei, Minrui Yang, T. C. Yu, Wei Shanghai Univ Shanghai Key Lab Power Stn Automat Technol Shanghai 200072 Peoples R China Univ Sussex Brighton E Sussex England CSK Syst Shanghai Co LTD Shanghai 200002 Peoples R China

ISBN: (纸本)9783642156205

This paper investigates a fast parallel computing scheme for the leaning control of a class of two-layered Networked Learning Control systems (NLCSs). This class of systems is subject to imperfect Quality of Service (QoS) in signal transmission, and requires a real-time fast learning. A parallel computational model for this task is established in the paper. Based on some of grid computing technologies and optimal scheduling, an effective scheme is developed to make full use of distributed computing resources, and thus to achieve a fast multi-objective optimization for the learning task under study. Experiments of the scheme show that it indeed provides a required fast on-line learning for NLCSs.

关键词： Grids parallel computing Optimization Real-time

来源：评论

学校读者我要写书评

暂无评论

Cost-effective congestion management for Interconnection networks using distributed deterministic routing

Cost-effective congestion management for Interconnection net...

引用

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

作者： Escudero-Sahuquillo, J. Garcia, P.J. Quiles, F.J. Flich, J. Duato, J. Computer Systems Department University of Castilla-La Mancha Albacete Spain Computer Engineering Department Technical University of Valencia Valencia Spain

ISBN: (纸本)9780769543079

The Interconnection networks are essential elements in current computing systems. For this reason, achieving the best network performance, even in congestion situations, has been a primary goal in recent years. In that sense, there exist several techniques focused on eliminating the main negative effect of congestion: the Head of Line (HOL) blocking. One of the most successful HOL blocking elimination techniques is RECN, which can be applied in source routing networks. FBICM follows the same approach as RECN, but it has been developed for distributed deterministic routing networks. Although FBICM effectively eliminates HOL blocking, it requires too much resources to be implemented. In this paper we present a new FBICM version, based on a new organization of switch memory resources, that significantly reduces the required silicon area, complexity and cost. Moreover, we present new results about FBICM, in network topologies not yet analyzed. From the experiment results we can conclude that a far less complex and feasible FBICM implementation can be achieved by using the proposed improvements, while not losing efficiency. © 2010 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

An Asymmetric distributed Shared Memory Model for Heterogeneous parallel systems

An Asymmetric Distributed Shared Memory Model for Heterogene...

引用

15th international conference on Architectural Support for Programming Languages and Operating systems

作者： Gelado, Isaac Cabezas, Javier Navarro, Nacho Stone, John E. Patel, Sanjay Hwu, Wen-mei W. Univ Politecn Cataluna E-08028 Barcelona Spain

ISBN: (纸本)9781605588391

Heterogeneous computing combines general purpose CPUs with accelerators to efficiently execute both sequential control-intensive and data-parallel phases of applications. Existing programming models for heterogeneous computing rely on programmers to explicitly manage data transfers between the CPU system memory and accelerator memory. This paper presents a new programming model for heterogeneous computing, called Asymmetric distributed Shared Memory (ADSM), that maintains a shared logical memory space for CPUs to access objects in the accelerator physical memory but not vice versa. The asymmetry allows light-weight implementations that avoid common pitfalls of symmetrical distributed shared memory systems. ADSM allows programmers to assign data objects to performance critical methods. When a method is selected for accelerator execution, its associated data objects are allocated within the shared logical memory space, which is hosted in the accelerator physical memory and transparently accessible by the methods executed on CPUs. We argue that ADSM reduces programming efforts for heterogeneous computing systems and enhances application portability. We present a software implementation of ADSM, called GMAC, on top of CUDA in a GNU/Linux environment. We show that applications written in ADSM and running on top of GMAC achieve performance comparable to their counterparts using programmer-managed data transfers. This paper presents the GMAC system and evaluates different design choices. We further suggest additional architectural support that will likely allow GMAC to achieve higher application performance than the current CUDA model.

关键词： Heterogeneous systems Data-centric Programming Models Asymmetric distributed Shared Memory

来源：评论

学校读者我要写书评

暂无评论

Job Scheduling in a distributed System Using Backfilling with Inaccurate Runtime Computations

Job Scheduling in a Distributed System Using Backfilling wit...

引用

4th international conference on Complex, Intelligent and Software Intensive systems (CICIS)

作者： Dimitriadou, Sofia K. Karatza, Helen D. Aristotle Univ Thessaloniki Dept Informat Thessaloniki 54124 Greece

ISBN: (纸本)9780769539676

In grid and parallel systems, backfilling has proven to be a very efficient method when parallel jobs are considered. However, it requires a job's runtime to be known in advance, which is not realistic with current technology. Various prediction methods do exist, but none is very accurate. In this study, we examine a grid system where both parallel and sequential jobs require service. Backfilling is used, but an error margin is added to a job's runtime prediction. The impact on system performance is examined and the results are compared with the optimal case of runtimes being known. Two different scheduling techniques are considered and a simulation model is used to evaluate system performance.

关键词： grid computing gang scheduling backfilling job allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：