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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是901-910 订阅

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

详细简洁

排序：

Study on the efficient and adaptive load balancing algorithm using mobile agent

Study on the efficient and adaptive load balancing algorithm...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Yang, Yongjian Ju, Jiubin Coll. of Comp. Sci. and Technology Jilin University Changchun Juin Province 130012 China

In this paper, we introduce a framework for load balancing using mobile agent named EALBMA(Efficient and Adaptive Load Balancing based on Mobile Agent) firstly. The framework can resolve some problems in traditional load balancing, including structure of system, updating load information, and adjusting strategies of load balancing. Secondly, the paper analyses some traditional algorithms for updating load information and their disadvantages. Then, aiming at these disadvantages, we propose a novel algorithm for updating load information partially based on mobile agent called ULIMA. Finally, from our simulation experiment results, we draw conclusions that it is reasonable and feasible to introduce mobile agent to load balancing, and the performance of ULIMA is improved.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

A free openmp compiler and run-time library infrastructure for research on shared memory parallel computing

A free openmp compiler and run-time library infrastructure f...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Karlsson, Sven Brorsson, Mats Department of Microelectronics KTH Royal Institute of Technology Sweden

OpenMP is an informal industry standard for programming parallel computers with a shared memory and has during the last few years achieved considerable acceptance in both the academic world and the industry. OpenMP is a thread-level fork-join programming model and relies on a set of compiler directives. An OpenMP aware compiler uses these directives to generate a multi-threaded application. In practice, an OpenMP run-time library is also needed as OpenMP specifies a set of run-time library calls. In this paper we report on a free OpenMP compiler and run-time library infrastructure. We present an OpenMP compiler for C called OdinMP and briefly discuss the run-time library that the compiler targets. The source code to both the compiler and the run-time libraries are available and can be freely used for OpenMP research. The compilation system is evaluated using the EPCC micro-benchmark suite for OpenMP and a set of applications from the SPLASH-2 benchmarks suite ported to OpenMP. Comparisons are made to OpenMP aware compiler systems from SGI and Intel. The performance of code generated with the presented compilation system is shown to be very close to or exceeding that of commercial compilers for a wide range of benchmark applications.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Migration algorithms for automated load balancing

Migration algorithms for automated load balancing

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Widell, Niklas Department of Communication Systems Lund University Box 118 SE-221 00 Lund Sweden

As distributed systems continue to evolve, automatic resource management is becoming more and more important. The resource management system must be able to dynamically handle large heterogeneous systems in a way that gives good performance and resource utilization. In the performance context, allocating software modules to nodes in an efficient way is of high interest. This paper considers the problem of allocating software modules to processing nodes in an automatic dynamic manner using module migration algorithms. The module allocation problem is NP-complete and many heuristics have been proposed. However, in systems where the workload changes over time, it may be infeasible to update module allocation often enough to handle changes in workload. This paper presents the Match-maker algorithm that performs load balancing by pairing overloaded nodes with under-loaded ones, initiating module migration within the pair. The paper presents a load balancing optimization problem, and uses the benchmark problem to evaluate the algorithm. In addition, the Match-maker algorithm is compared with other previously described algorithms for module migration. The Matchmaker algorithm is found to be fast and efficient in reducing load imbalance in distributed systems, especially for large systems.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient determination of block size NB for parallel linpack test

Efficient determination of block size NB for parallel linpac...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Wenli, Zhang Jianping, Fan Mingyu, Chen Natl. Res. Ctr. Intelligent Comp. S. Institute of Computing Technology Chinese Academy of Sciences Graduate School Chinese Academy of Sciences NCIC P.O. Box 2704 Beijing China

HPL is a Linpack benchmark package widely used in massive cluster system performance test. Based on indepth analysis of the blocked parallel solution algorithm of linear algebra equations and HPL implementation mechanics, the restriction factors of the HPL peak performance are probed. The influence of main parameters P×Q and NB on computing performance in LU factorization process is discussed especially. Theory analysis and experiment results indicate that, the efficiency factor, defined as the ratio of the matrix operation time and the amount of operations, is relevant to the matrix block size to a great extent, yet little correlate to the matrix size itself. According to this law, the author proposes to determine the block size NB of massively parallel test through scanning the operation efficiency of proper small-scale matrix. Thus it improves the status getting NB through trial-and-error experiment without definite aim. The author's idea has been verified by the real test results, as well as been applicable to the matrix parallel operations of other courses.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Achieving parallelism 'easily' through Pshell

Achieving parallelism 'easily' through Pshell

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Saffioti, Daniel F. Piper, Ian Fulcher, John Sch. Info. Technol. and Comp. Sci. University of Wollongong Northfields Avenue Wollongong NSW 2522 Australia

Communications and the scheduling of tasks are the two most important issues of parallel programming on clusters. Over time, various parallel computing programming models such as remote threads, transparent process migration, message passing, distributed shared memory and optimizing parallel compilers have emerged, assisting the programmer to develop applications which can work seamlessly in such environments. Considerable research has been done to optimize these models, which typically have large communications overheads, resulting in a detrimental effect on performance. In addition to this, their acceptance has varied by virtue of the fact that each has introduced new problems with reference to portability, scalability and usability. Sometimes these problems completely violate the underlying notion of such computing. To overcome these issues Pshell, which provides transparent scheduling and communication of jobs between disparate hosts, has been developed. Pshell is the 'glue' for producing high-performance parallel applications that can work securely and efficiently in heterogeneous environments. It represents a major shift in traditional parallel programming environments because it is a language using the syntax of the Bourne shell sh(l). The Bourne shell process and communications models can easily be extended to parallel computing environments using the concurrent programming model. This paper will examine the evolution of cluster computing and identify where deficiencies lie in current programming models, providing a justification for simple languages while providing the reader with an understanding of the Pshell programming environment. In addition to this, the paper illustrates how such a language can be used to ease the process of writing parallel applications and to overcome some of the limitations inherent in traditional programming models without sacrificing performance.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A fault-tolerant ring-based algorithm for achieving mutual exclusion in distributed systems

A fault-tolerant ring-based algorithm for achieving mutual e...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Masum, Salahuddin Mohammad Al-Mamun, Mohammad Abdullah Islam, Khandoker Tarik-Ul Mostafa, Syed Md. Sazzad Akbar, Mohammad Mostofa Fac. of Sci. and Info. Technology Daffodil International University Dhaka 1207 Bangladesh Dept. of Comp. Sci. and Engineering IBAIS University Dhaka 1209 Bangladesh Department of Computer Science Amer. Intl. University - Bangladesh Dhaka 1213 Bangladesh Department of CSE Bangladesh Univ. Eng. and Technol. Dhaka 1000 Bangladesh

systems involving multiple processes are often most easily programmed using critical regions. Mutual exclusion is the dilemma of assurance that certain portions of program code are executed within the critical regions, where no two programs are permitted to be in critical regions at the same time. So, arranging mutual exclusion plays a significant role in the domain of both centralized and distributed systems. Unfortunately, all the three basic approaches - centralized, distributed and token ring proposed for achieving mutual exclusion in distributed systems are said to be good for distributed systems in some abstract way only. In this paper, we have presented a ring-based algorithm for arranging mutual exclusion in distributed systems. We have compared the conventional algorithms with the algorithm presented in this paper and shown that our algorithm is more fault-tolerant than all the traditional algorithms and requires less number of message-passing with reduced amount of load on coordinator.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

SMG: Shared memory for grids

SMG: Shared memory for grids

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Ryan, John P. Coghlan, Brian A. Computer Architecture Group Dept. of Computer Science Trinity College Dublin Dublin 2 Ireland

This paper discusses some of the salient issues involved in implementing the illusion of a shared-memory programming model across a group of distributed memory processors from a cluster through to an entire Grid. This illusion can be provided by a distributed shared memory (DSM) runtime system. Mechanisms that have the potential to increase the performance by minimizing high-latency intra site messages & data transfers are highlighted. Relaxed consistency models are investigated, as well as the use of a grid information system to ascertain topology information. The latter allows for hierarchy-aware management of shared data and synchronization variables. The process of incremental hybridization is also explored, where more efficient message-passing mechanisms can incrementally replace DSM actions when circumstances dictate that performance improvements can be obtained. In this paper we describe the overall design/architecture of a prototype system, SMG, which integrates DSM and message passing paradigms and may be the target of an OpenMP compiler. Our initial findings based on some trivial examples indicate some of the potential benefits that can be obtained for grid Applications.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling in distributed heterogeneous systems with dependent tasks & imprecise execution time estimates

Dynamic scheduling in distributed heterogeneous systems with...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Boyer, Wayne F. Hura, Gurdeep S. Idaho Natl. Eng. and Environ. Lab. 2525 N. Freemont Idaho Falls ID 83415-5224 Comp. Sci. and Computer Engineering University of Idaho Idaho Falls ID 83402

Two new algorithms are proposed for scheduling tasks in heterogeneous distributed systems where tasks may have arbitrary dependencies and estimates of execution time are imperfect. A new Dynamic Adaptive Random Scheduler (DARS) algorithm is proposed. DARS uses a randomized ordering technique to search for a near optimum schedule while monitoring the status of each previously dispatched task such that tasks are migrated according to the current estimates of task execution time. A proposed new Load Balancing (LB) algorithm distributes tasks initially by a heuristic that accounts for heterogeneity and dependencies, and while tasks are executing it migrates tasks to rebalance the load whenever a host becomes idle such that the number of migrations is minimized and each migration accounts for dependencies. The algorithms were evaluated by simulation of various scenarios and for various levels of uncertainty in execution time estimated values. The best algorithm is highly dependent on the nature of the load and the level of uncertainty in the execution time estimates.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable parallel prefix computation on FPGAs

Reconfigurable parallel prefix computation on FPGAs

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Park, Jin H. Or, Mei S. Department of Computer Science State Univ. of New York at New Paltz New Paltz NY 12561-2440 United States

This paper presents a design of a reconfigurable parallel prefix computation hardware on FPGAs. The design is based on a pipelined dataflow algorithm, and control logics are added to reconfigure the system for the arbitrary parallelism degree. The design receives multiple input streams of elements in parallel, and produces output streams in parallel. The design has the great advantage of controlling the degree of parallelism explicitly at run time. Time complexity of the design is O(d + (N-d) / d), where d and N are parallelism degree and stream size, respectively. When the stream size is very big, the initial trigger time d in the time complexity can be ignored and we get O(N/d). Unlike the software parallel prefix algorithms, the design works for both known and unknown sized data. The design is implemented and tested for target devices Xilinx Spartan2S XC2S300EFT256-6Q and XC2S600EFG676-6.

关键词： Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Providing service level agreements for idle CPU cycles from an internet PC Grid

Providing service level agreements for idle CPU cycles from ...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Stephens, Mark Nair, Suku High Assur. Comp./Networking Lab. Dept. of Comp. Sci. and Engineering Southern Methodist University Dallas TX 75275 High Assur. Comp./Networking Lab. Dept. of Comp. Sci. and Engineering Southern Methodist University Dallas TX 75275 United States

Using distributed computing to harness idle CPU cycles from PCs across the Internet is an economically attractive solution for solving many problems. Research estimates that the average wasted idle time for Internet connected PCs is over 90%. If a fraction of these wasted cycles could be harnessed and presented in a reliable and consistent manner, they could be traded as a commodity. Consumers in this market would expect Service Level Agreements (SLA) with guarantees on Quality of Service. Providers in this market would need to bring consistency and stability to this highly volatile environment. In this paper we explore this topic by presenting SLA contracts for purchasing idle CPU units from a PC Grid, describing the required QoS parameters, and demonstrating how the use of fault-tolerant probabilistic task scheduling with statistical inference could be used to bring stability and consistency to an Internet PC Grid.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 87 88 89 90 91 92 93 94 95 96 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：