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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,317 篇 会议
49 篇 期刊文献
30 册 图书

馆藏范围

2,396 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,395 篇 工学
- 1,181 篇 计算机科学与技术...
- 599 篇 软件工程
- 297 篇 信息与通信工程
- 176 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 42 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
238 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
121 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
89 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
79 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,389 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2396 条记录，以下是51-60 订阅

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

详细简洁

排序：

Efficient data service design for a SOA approach to scientific computing

Efficient data service design for a SOA approach to scientif...

引用

10th IASTED international conference on parallel and distributed computing and networks, pdcn 2011

作者： Mulerikkal, Jaison Paul Strazdins, Peter School of Computer Science Australian National University Canberra Australia

ISBN: (纸本)9780889868649

In recent years, the Service Oriented Architecture (SOA) has evolved itself into emerging technologies like cloud computing to give it more relevance. ANU-SOAM - a service oriented middleware - aims to provide convenient API, a unique data service extension and proper load-balancing techniques for high performance scientific computing. The data service extension offers both Common Data Service (CDS) and Local Data Service (LDS). CDS helps set data common to all service instances and to manipulate it using add, get, put, sync, etc. functions. The LDS allows consumer to partially replicate data among service instances to improve memory scalability. Comparable paradigms like MPI are mostly agnostic and non-responsive to heterogeneous conditions. The SOA approach enables ANU-SOAM to have load balancing techniques implemented with the help of a Resource Manager. Experiments using N Body Solver and Heat Transfer applications have shown that ANU-SOAM performs as good as most of its MPI counterparts, especially under heterogeneous conditions.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Permuting ability of uniaxial 2D and 3D tori under dimension-order routing

Permuting ability of uniaxial 2D and 3D tori under dimension...

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2009

作者： Veselovsky, Gennady Department of Computer and Network Engineering Assumption University of Thailand Ramkhamhaeng Rd. Soi 24 Bangkok 10240 Thailand

ISBN: (纸本)9780889867840

Permutations belong to communications patterns demanded frequently in massively-parallel computers especially of the SIMD type. A permutation is said "admissible" to a given interconnection network if it does not cause blockings in that network under a chosen routing algorithm. Determining the admissibility of a given permutation to various static connecting topologies is a fundamental problem. Based on congruence notion from number theory, this paper presents a simple method which solves admissibility problem for regular permutations to uniaxial 2D and 3D tori under deterministic dimension-order routing commonly used in practice. Here "uniaxial" means that in every routing step all data items participating in a permutation can move along the same axis only. It is assumed that all nodes of a system work in a synchronous fashion what is also characteristic to SIMDs. The efficiency of the method is illustrated by the examples with checking admissibility of some frequently used in parallel programming permutations which belong either to Omega or BPC (bit-permute-complement) classes.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

The case for modular redundancy in large-scale high performance computing systems

The case for modular redundancy in large-scale high performa...

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2009

作者： Engelmann, Christian Ong, Hong Scott, Stephen L. Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN United States

ISBN: (纸本)9780889867840

Recent investigations into resilience of large-scale high-performance computing (HPC) systems showed a continuous trend of decreasing reliability and availability. Newly installed systems have a lower mean-time to failure (MTTF) and a higher mean-time to recover (MTTR) than their predecessors. Modular redundancy is being used in many mission critical systems today to provide for resilience, such as for aerospace and command & control systems. The primary argument against modular redundancy for resilience in HPC has always been that the capability of a HPC system, and respective return on investment, would be significantly reduced. We argue that modular redundancy can significantly increase compute node availability as it removes the impact of scale from single compute node MTTR. We further argue that single compute nodes can be much less reliable, and therefore less expensive, and still be highly available, if their MTTR/MTTF ratio is maintained.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Reexamining the parallelization schemes for standard full tableau simplex method on distributed memory environments

Reexamining the parallelization schemes for standard full ta...

引用

10th IASTED international conference on parallel and distributed computing and networks, pdcn 2011

作者： Mamalis, Basilis Pantziou, Grammati Dimitropoulos, Georgios Kremmydas, Dimitrios Technological Educational Institute of Athens Ag. Spyridonos 12210 Egaleo Greece Agricultural University of Athens Iera Odos 75 11855 Athens Greece

ISBN: (纸本)9780889868649

The simplex method has been successfully used in solving linear programming problems for many years. parallel approaches have also extensively been studied due to the intensive computatios required (especially for the solution of large in size linear problems). In this paper we present a highly scaleable parallel implementation framework of the standard full tableau simplex method on a highly parallel (distributed memory) environment. Specifically, we have designed and implemented a column distribution scheme (similar to the one presented in [24]) as well as a row distribution scheme (similar to the one presented in [3]) and we have entirely tested our implementations over a considerably powerful parallel environment (a linux-cluster of eight powerful Xeon processors connected via a high speed Myrinet network interface). We then compare our approaches (a) among each other for variable number of problem size (number of rows and columns) and (b) to the corresponding ones of [3] and [24] which are two of the most recent and valuable corresponding efforts. In most cases the column distribution scheme performs quite/much better than the row distribution scheme. Moreover, both schemes (even the row distribution scheme over large scale problems) lead to particularly high speed-up and efficiency values, that are considerably better in all cases than the ones achieved by the corresponding implementations of [3] and [24].

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

parallelization strategy for Hierarchical Run Length Encoded data structures

Parallelization strategy for Hierarchical Run Length Encoded...

引用

10th IASTED international conference on parallel and distributed computing and networks, pdcn 2011

作者： Filipović, Lado Ertl, Otmar Selberherr, Siegfried Institute for Microelectronics TU Wien Gußhausstraße 27-29/E360 A-1040 Wien Austria

ISBN: (纸本)9780889868649

An efficient parallelization strategy is presented for a Hierarchical Run Length Encoded (HRLE) data structure, implemented for the Sparse Field Level Set method. In order to achieve high parallel efficiency, computational work must be distributed evenly over all available CPU threads. Since the Level Set surface must be allowed to deform and evolve, thereby increasing the simulation area, there must exist a way to increase the surface domain while keeping an efficient parallelization strategy in place. This is achieved by processing the same number of calculations across each available CPU. The addition of data to HRLE data structures is only permitted in a sequential or lexicographical order, making parallelization more complex. The presented solution uses as many HRLE data structures as there are CPUs available. Approximately 90% of operations can be performed in parallel when using the presented strategy, leading to an efficiency of up to 96% or 78.5% when using two or sixteen CPU cores of an AMD Opteron 8435 processor, clocked at 2.6GHz, respectively. Topographies with one and two moving interfaces were simulated using multi-threading, showing the speedup and efficiency for the presented strategy.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Interpolation-based object decomposition and parallel computation method for large-scale Computer-Generated Hologram

Interpolation-based object decomposition and parallel comput...

引用

12th IASTED international conference on parallel and distributed computing and networks, pdcn 2014

作者： Baba, Takanobu Miyata, Hiroaki Jackin, Boaz Jessie Ohkawa, Takeshi Ootsu, Kanemitsu Yokota, Takashi Hayasaki, Yoshio Yatagai, Toyohiko Center for Optical Research and Education Utsunomiya University 7-1-2 Yoto Tochigi 321-8585 Japan Department of Information Systems Science Utsunomiya University 7-1-2 Yoto Tochigi 321-8585 Japan

Computer Generated Holography (CGH) is considered a promising candidate for realizing 3D display with complete depth features. However, the realization of a largescale CGH requires a huge computation time. This paper proposes a method for decomposing an input object into sub-objects and generating sub-holograms from them utilizing interpolation. The major advantage of this method is that the generation processes become mutually independent and can be executed in parallel without communication and synchronization. After presenting the theory of interpolation method, we will show how we can implement the method on GPU using data-parallel operations. We will also show the simulation and optical reconstruction results that verify the correctness of the method. Finally, we will present the preliminary results of our experiment by using GPU.

关键词： Computer generated holography

来源：评论

学校读者我要写书评

暂无评论

Power-efficient load distribution in heterogeneous computing environments

Power-efficient load distribution in heterogeneous computing...

引用

12th IASTED international conference on parallel and distributed computing and networks, pdcn 2014

作者： Lenhardt, Joerg Schiffmann, Wolfram Eitschberger, Patrick Keller, Joerg Computer Architecture Group FernUniversität in Hagen Germany Parallelism and VLSI Group FernUniversität in Hagen Germany

High performance servers of heterogeneous computing environments, as can be found in data centers for cloud computing, consume immense amounts of energy even though they are usually underutilized. In times when not all computing capabilities are needed the task to be solved is how to distribute the computational load in a power-efficient manner. The question to be answered is, what load partitions should be assigned to each physical server so that all work is done with minimal energy consumption. This problem is closely related to the selection of physical servers that can be switched off completely to further reduce the power consumption. In this work, we present algorithms which calculate a power-efficient distribution of a divisible workload among multiple, heterogeneous physical servers. We assume a fully divisible load to calculate an optimized utilization of each server. Based on this distribution, an iterative process is carried out to identify servers, which can be switched off in order to further reduce the power consumption. With that information, workload (re)distribution can take place to partition appropriate subloads to the remaining servers. As before, the calculated partitioning minimizes the power consumption.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

Versatile Stack Management for Multitasking Sensor networks

Versatile Stack Management for Multitasking Sensor Networks

引用

international conference on distributed computing Systems (ICDCS 2010)

作者： Chu, Rui Gu, Lin Liu, Yunhao Li, Mo Lu, Xicheng Natl Univ Def Technol Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Beijing Peoples R China

ISBN: (纸本)9780769540597

The networked application environment has motivated the development of multitasking operating systems for sensor networks and other low-power electronic devices, but their multitasking capability is severely limited because traditional stack management techniques perform poorly on small-memory systems. In this paper, we show that combining binary translation and a new kernel runtime can lead to efficient OS designs on resource-constrained platforms. We introduce SenSmart, a multitasking OS for sensor networks, and present new OS design techniques for supporting preemptive multi-task scheduling, memory isolation, and versatile stack management. We have implemented SenSmart on MICA2/MICAz motes. Evaluation shows that SenSmart performs efficient binary translation and demonstrates a significantly better capability in managing concurrent tasks than other sensornet operating systems.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Regulate my appetite according to dishes: A distributed on-line optimal stopping web service selection scheme

Regulate my appetite according to dishes: A distributed on-l...

引用

11th IASTED international conference on parallel and distributed computing and networks, pdcn 2013

作者： Liu, Siping Zhang, Yaoxue Zhou, Yuezhi Liu, Hao Zhang, Di Hu, Wei Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9780889869431

This paper demonstrates a distributed on-line service selection( probe/access) scheme: optimal stopping web service selection scheme based on the rate of return problem from optimal stopping theory. There are three differences between our scheme and the conventional schemes. Firstly, it does not need to probe all web services, and only probe a few web services. Secondly, our scheme focuses on maximizing the average QoS(Quality of Service) return per unit of cost over all stages of probe and access for a long period rather than maximizing QoS return per single stage of probe and access in usual schemes. Thirdly, our scheme develops a return function based on three factors: QoS return, user's requirement and probe cost which are seldom considered simultaneously before. Through theory analysis and computation, we demonstrate that compared with the conventional schemes our scheme has additional advantages while achieving same good performances.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Reactive grid scheduling of DAG applications

Reactive grid scheduling of DAG applications

引用

IASTED international conference on parallel and distributed computing and networks, pdcn 2007

作者： Hernandez, Israel Cole, Murray Institute for Computing Systems Architecture School of Informatics University of Edinburgh

ISBN: (纸本)9780889866379

We consider the problem of scheduling parallel applications, represented by directed acyclic graphs (DAGs), onto Grid style resource pools. The core issues are that the availability and performance of grid resources, which are already by their nature heterogeneous, can be expected to vary dynamically, even during the course of an execution. Typical scheduling methods in the literature partially address this issue because they consider static heterogenous computing environments (i.e. heterogeneous resources are dedicated and unchanging over time). This paper presents the Grid Task Positioning GTP scheduling method, which addresses the problem by allowing rescheduling of an executing application in response to significant variations in resource characteristics. GTP considers the impact of partial completion of tasks and task migration. We compare the performance of GTP with that of the well-known, and static, Heterogeneous Earliest Finish Time (HEFT) algorithm.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：