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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,295 篇 工学
- 1,194 篇 计算机科学与技术...
- 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 篇 军事学

主题

154 篇 distributed comp...
84 篇 distributed comp...
78 篇 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 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 parallel algorit...
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 resource managem...

机构

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 篇 huazhong univers...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 rothermel kurt
10 篇 shen hong
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,702 篇 英文
30 篇 俄文
29 篇 其他
4 篇 中文
1 篇 乌克兰文

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

共 1765 条记录，以下是1171-1180 订阅

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

详细简洁

排序：

Barrier Optimization for OpenMP Program

Barrier Optimization for OpenMP Program

引用

3rd international Workshop on e-Activity (IWEA2009)/10th ACIS international conference on Software Engineering Artificial Intelligence, Networking and parallel/distributed computing

作者： Ma, Hongtu Zhao, Rongcai Gao, Xiang Zhang, Youwei Zhengzhou Informat Sci & Technol Inst Zhengzhou 450002 Henan Peoples R China Naval Acad Armament Beijing 102249 Peoples R China Zhengzhou Inst Surveying & Mapping Zhengzhou 450002 Peoples R China

ISBN: (纸本)9780769536422

Barrier construct in OpenMP program is a directive used to remove race code before continuing. Each thread waits until all of the other threads of a team have reached the barrier region. And data dependence is a technology to find whether two statements can be run in parallel. this paper prevents two ways to optimize the OpenMP programa barrier. the first one is to remove redundant barrier with data dependence information, that is, if all the statements across a barrier have no data dependence, then the barrier can be safe v removed. And the second one is to reduce the cost of barrier. the paper gives an implementation of another form of parallelism- DOACROSS and a new form of OpenMP barrier-region barrier, in which both are synchronized with busy-waiting. Experimental results show that the performance of the optimized OpenMP program is improved.

关键词： Yarn Costs Testing parallel programming Programming profession Software engineering Artificial intelligence Intelligent networks distributed computing Information science

来源：评论

学校读者我要写书评

暂无评论

Analyzing Metadata Performance in distributed File Systems

Analyzing Metadata Performance in Distributed File Systems

引用

10th international conference on parallel computing technologies

作者： Biardzki, Christoph Ludwig, thomas Bayer Akad Wissensch LRZ Boltzmannstr 1 D-85748 Garching Germany German Climate Comp Ctr DKRZ D-20146 Hamburg Germany

ISBN: (纸本)9783642032745

the performance of metadata processing in large distributed file systems currently presents larger challenges than scaling of data throughput. the paper presents a novel, distributed benchmark called DMetabench for measuring the performance of metadata operations (e.g. file creation). DMetabench runs in environments with potentially thousands of nodes and allows an assessment of the scalability of metadata operations. Additionally, precise run-tune performance data is preserved which allows for a better understanding of performance artifacts. Validation results from production file systems at the Leibniz Supercomputing Centre (LRZ) are provided and discussed. Possible applications of knowledge about metadata performance scaling include the choice of an optimal parallelization strategy for metadata-itensive workload in a specific runtime environment.

关键词： distributed file system metadata benchmark

来源：评论

学校读者我要写书评

暂无评论

parallel FFT with Eden Skeletons

Parallel FFT with Eden Skeletons

引用

10th international conference on parallel computing technologies

作者： Berthold, Jost Dieterle, Mischa Lobachev, Oleg Loogen, Rita Univ Marburg Fachbereich Math & Informat D-35032 Marburg Germany

ISBN: (纸本)9783642032745

the paper investigates and compares skeleton-based Eden implementations of different FFT-algorithms on workstation clusters with distributed memory. Our experiments show that the basic divide-and-conquer versions suffer from an inherent input distribution and result collection problem. Advanced approaches like calculating FFT using a parallel map-and-transpose skeleton provide more flexibility to overcome these problems. Assuming a distributed access to input data and re-organising computation to return results in a distributed way improves the parallel runtime behaviour.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Allocation of Classes in distributed object-oriented databases

Allocation of Classes in distributed object-oriented databas...

引用

3rd international Workshop on e-Activity (IWEA2009)/10th ACIS international conference on Software Engineering Artificial Intelligence, Networking and parallel/distributed computing

作者： Lee, Soon-Mi Ha, Yan Park, Hea-Sook Kyungin Womens Coll Sch Comp & Informat Inchon South Korea

ISBN: (纸本)9780769536422

In distributed object-oriented data bases(DOODB), objects are distributed in different sites on a communication network. A class fragmentation that divides a class into several fragments is needed for improving performance and for reducing repetition and duplication of data transmission. It is proposed the vertical class fragmentation to reflect the characteristics of object-oriented database such as method, inheritance and composite-object. In this paper, we define the objective function for allocation considering system to save cost including storage, query processing and communication and implemented it using Genetic Algorithm.

关键词： DOODB fragmentation allocation

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithms of Numeric Integration Using Lattice Cubature Formulas

Parallel Algorithms of Numeric Integration Using Lattice Cub...

引用

10th international conference on parallel computing technologies

作者： Ramazanov, Marat D. Rakhmatullin, Dzhangir Y. RAS Inst Math 112 Chernyshevsky Str Ufa 450008 Russia

the results of theory and applications of optimal lattice cubature formulas are described. the approximate integration program based on lattice formulas is considered. It has sufficiently high precision for complicate... 详细信息

ISBN: (纸本)9783642032745

关键词： cubature formulas approximate integration calculus mathematics functional analysis

来源：评论

学校读者我要写书评

暂无评论

parallelization of Temperature Distribution Simulations for Semiconductor and Polymer Composite Material on distributed Memory Architecture

Parallelization of Temperature Distribution Simulations for ...

引用

10th international conference on parallel computing technologies

作者： Alias, Norma Darwis, Roziha Satam, Noriza Othman, Mohamed Univ Teknol Malaysia Skudai Johor Malaysia Univ Putra Malaysia Serdang Malaysia

ISBN: (纸本)9783642032745

the implementations of parallel algorithms in solving partial differential equations (PDEs) for heat transfer problems are based on the high performance computing using distributed memory architecture. In this paper, the parallel algorithms are exploited finite difference method in solving multidimensional heat transfer problem for semiconductor components and polymer composite materials. parallel Virtual Machine (PVM) and G language based on Linux operating system are the platform to run the parallel algorithms. this research focused on Red-Black Gauss Seidel (RBGS) iterative method. parallel performance evaluations in terms of speedup, efficiency, effectiveness, temporal performance and communication cost are analyzed.

关键词： parallel Virtual Machine (PVM) Red-Black Gauss Seidel (RBGS) parallel Performance evaluations

来源：评论

学校读者我要写书评

暂无评论

parallel Discrete Event Simulation with AnyLogic

Parallel Discrete Event Simulation with AnyLogic

引用

10th international conference on parallel computing technologies

作者： Kondratyev, Mikhail Garifullin, Maxim St Petersburg State Polytech Univ Distributed Comp & Networking Dept St Petersburg 194021 Russia

ISBN: (纸本)9783642032745

Nowadays simulation modeling is applied for solving a wide range of problems. there are simulations which require significant performance and time resources. To decrease overall simulation time a model can be converted to a distributed system and executed on a computer network. the goal of this project is to create a library enabling clear and rapid development parallel discrete event models in AnyLogic. the library is aimed for professionals in computer simulation and helps to reduce code amount. the project includes a research on different synchronization algorithms. In this paper we present techniques which can be used in creating distributed models. We present comparison of a single threaded model with a distributed model implementing optimistic algorithm. the comparison shows a significant improvement in wallclock time achieved by separating the model into independent submodels with minimal communications.

关键词： AnyLogic parallel discrete event simulation Java RMI agent based simulation epidemic Time Warp

来源：评论

学校读者我要写书评

暂无评论

parallel Medical Image Reconstruction: From Graphics Processors to Grids

Parallel Medical Image Reconstruction: From Graphics Process...

引用

10th international conference on parallel computing technologies

作者： Schellmann, Maraike Gorlatch, Sergei Meilaender, Dominik Koesters, thomas Schaefers, Klaus Wuebbeling, Frank Burger, Martin Univ Munster D-4400 Munster Germany

ISBN: (纸本)9783642032745

We present a variety of possible parallelization approaches for a real-world case study using several modern parallel and distributed computer architectures. Our case study is a production-quality, time-intensive algorithm for medical image reconstruction used in computer tomography. We describe how this algorithm can be parallelized for the main kinds of contemporary parallel architectures: shared-memory multiprocessors, distributed-memory clusters, graphics processors, the Cell processor and, finally, how various architectures can be accessed in a distributed Grid environment. the main contribution of the paper;besides the parallelization approaches, is their systematic comparison regarding four important criteria: performance, programming comfort, accessibility, and cost-effectiveness. We report results of experiments on particular parallel machines of different architectures that confirm the findings of our systematic comparison.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A Generalized Multi-organization Scheduling on Unrelated parallel Machines

A Generalized Multi-organization Scheduling on Unrelated Par...

引用

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

作者： Ooshita, Fukuhito Izumi, Tomoko Izumi, Taisuke Osaka Univ Grad Sch Informat Sci & Technol 1-5 Yamadaoka Suita Osaka 5650871 Japan Ritsumeikan Univ Coll Informat Sci & Engn Shiga 5258577 Japan Nagoya Inst Technol Grad Sch Engn Nagoya Aichi 4668555 Japan

ISBN: (纸本)9781424452910

We consider the parallel computing environment where m organizations provide machines and several jobs to be executed. While cooperation of organizations is required to minimize the global makespan, each organization also expects the faster completion of its own jobs primarily and thus it is not necessarily cooperative. To handle the situations, we formulate the alpha-cooperative multi-organization scheduling problem (alpha-MOSP), where alpha >= 1 is a parameter representing the degree of cooperativeness. alpha-MOSP minimizes the makespan under the cooperation constraint that each organization does not allow the completion time of its own jobs to be delayed alpha times of that in the case where those jobs are executed by itself. In this paper, we aim to reveal the relation between the makespan and the degree of cooperativeness. First, we investigate the relation between alpha and the quality of the global makespan. For alpha = 1 (i.e., each organization never sacrifices its completion time), we show an instance where the cooperation constraint degrades the optimal makespan by m times. In contrast, for alpha > 1, we can construct an algorithm transforming any unconstrained schedule to one satisfying the cooperation constraint. this algorithm bounds the degradation ratio by alpha/(alpha - 1), which implies that weak cooperation improves the makespan dramatically. Second, we study the complexity of alpha-MOSP. We show its strongly NP-hardness and inapproximability for the approximation factor less than max{(alpha 1)/alpha,3/2}. We also show the hardness of transformation: Even if an optimal schedule under no cooperation constraint is given, no polynomial-time algorithm finds an optimal schedule for a-MOSP. this result is a witness for inexistence of general polynomial-time transformation algorithms that preserve the approximation ratio.

关键词： heterogeneous parallel computing environments scheduling algorithm approximation algorithm computation complexity

来源：评论

学校读者我要写书评

暂无评论

Congestion Control Algorithm based on Loss Trend Oriented to Many-to-many Reliable Multicast

Congestion Control Algorithm based on Loss Trend Oriented to...

引用

3rd international Workshop on e-Activity (IWEA2009)/10th ACIS international conference on Software Engineering Artificial Intelligence, Networking and parallel/distributed computing

作者： Liu Li Zhou Zhong Liu Dongmei Wu Wei State Key Lab Virtual Real Technol & Syst Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (纸本)9780769536422

Congestion control algorithms of existing reliable multicast protocols are mainly derived from end-to-end model, which has high resource requirements and sometimes suppresses the package sending too much. Many-to-many reliable multicast requires efficient congestion control over a one-to-many model. It's an important mechanism to use many-to-many multicast in LAN (Local Area Network) in distributed simulation. In this paper, a congestion control algorithm based on loss trend for many-to-many reliable multicast is proposed. It predicts future package loss of receivers on the analysis of historic loss and buffer variety, and then control the congestion by adjusting the sending rate in advance. this algorithm aims at the reliable multicast in LAN. the main idea of the algorithm is to lower the possibility of multicast package loss, and then the nodes can afford the cost of package recovery. It alleviates the congestion on the depression of package loss possibility by regulating the sending rate. Experiment results indicate that the algorithm can keep a high throughput of many-to-many reliable multicast with relatively real-time performance.

关键词： many-to-many reliable multicast congestion control distributed simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 114 115 116 117 118 119 120 121 122 123 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：