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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

548 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

564 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

542 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 564 条记录，以下是321-330 订阅

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

详细简洁

排序：

Transactional data sharing in grids

Transactional data sharing in grids

引用

20th iasted international conference on parallel and distributed computing and systems, PDCS 2008

作者： Müller, Marc-Florian Möller, Kim-thomas Sonnenfroh, Michael Schöttner, Michael Institut für Informatik Heinrich-Heine-Universität Düsseldorf 40225 Düsseldorf Germany

ISBN: (纸本)9780889867741

the EU-funded XtreemOS project implements a Linux-based grid operating system (OS), exploiting resources of virtual organizations through the standard POSIX interface. the Object Sharing Service (OSS) of XtreemOS addresses the challenges of transparent data sharing for distributed applications running in grids. We focus on the problem of handling consistency of replicated data in wide area networks in the presence of failures. the software architecture we propose interweaves concepts from transactional memory and peer-to-peer systems. Speculative transactions relieve programmers from complicated lock management. Super-peer-based overlay networks improve scalability and distributed hash tables speed up data search. OSS replicates objects to improve reliability and performance. In case of severe faults, the XtreemOS grid checkpointing service will support OSS. In this paper we describe the software architecture of OSS, design decisions, and evaluation results of preliminary experiments with a multi-user 3D virtual world.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

the impact of multi-core architectures on task retrieval policies for volunteer computing

The impact of multi-core architectures on task retrieval pol...

引用

20th iasted international conference on parallel and distributed computing and systems, PDCS 2008

作者： Toth, David Department of Computer Science Merrimack College North Andover MA 01845 United States

ISBN: (纸本)9780889867741

Volunteer computing projects use donated CPU time to solve problems that would otherwise be too computationally intensive to solve. the donated CPU time comes from computers whose owners install a volunteer computing client program on their computer, allowing a project to use the computer's idle time. the low participation rate in volunteer computing and the increasing number of volunteer computing projects make improvements that more effectively use the donated CPU cycles very important. Past work showed that using certain task retrieval policies could increase the number of tasks volunteer computing clients complete. However, the past work assumed that the volunteered computers had a single CPU and the task retrieval methods that resulted in more completed tasks required the client to be connected to the Internet more often than the other policies. We simulated the task retrieval policies for computers with multi-core CPUs and found that in most cases, the multi-core architecture can lead to a slightly greater than linear increase in the number of tasks that the clients complete, relative to the number of cores the computer running the client has. Additionally, the multi-core architecture can reduce the performance gap between the best and worst performing policies significantly, affecting which policies are used.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Simulation of level-2 cache locking in multicore parallel computing systems

Simulation of level-2 cache locking in multicore parallel co...

引用

20th iasted international conference on parallel and distributed computing and systems, PDCS 2008

作者： Rani, Manira Asaduzzaman, Abu Koivisto, Darryl Department of Computer Science and Engineering Florida Atlantic University 777 Glades Road SE43-409 Boca Raton FL 33431 United States Architecture Modeling Group Mirabilis Design Inc. 3000 Scott Blvd Santa Clara CA 95054 United States

ISBN: (纸本)9780889867741

In order to fulfill the demands for increased performance / power ratio, most chip-vendors are deploying multicore processors to their product lines. Multicore processors are frequently deployed with multilevel cache memories. parallel thread execution in such a multicore system is difficult as it relates to cache sharing to achieve the best performance. Due to the increased execution time unpredictability, it becomes a challenge to support realtime applications on multicore systems with multilevel caches. Studies show that predictability can be improved using cache locking techniques. However, entire locking at level-1 cache may be inefficient for smaller data size (when compared with the cache size). Also, way locking at level-1 cache is not permitted on some processors (like PowerPC 750GX), but way locking at level-2 cache is possible. By locking at level-2 cache, Xenon processor achieves the effect of using local storage by Cell SPEs. In this work, we simulate a multicore parallel computing system with two levels of caches to explore the impact of level-2 cache locking on the performance, power consumption, and predictability. Experimental results show that performance and predictability can be increased and power consumption can be decreased by adding a level-2 cache locking mechanism to an efficient cache sharing structure.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for disjoint paths in star networks

A distributed algorithm for disjoint paths in star networks

引用

20th iasted international conference on parallel and distributed computing and systems, PDCS 2008

作者： Hamad, Ahmad Karaata, Mehmet Hakan Department of Computer Engineering Kuwait University P.O. Box 5969 Safat 13060 Kuwait

ISBN: (纸本)9780889867741

A stabilizing system guarantees that, regardless of the current configuration, the system reaches a legal configuration in a bounded number of steps and the system configuration remains legal thereafter. Whereas, a stabilizing system that maintains no explicit variables in the processes of the system is referred to as an inherently stabilizing system, and hence all system states are legal by construction. Due to this attribute, inherently stabilizing systems are immune to transient faults and do not experience any delay due arbitrary system initialization. We view a fault that perturbs the system configuration but not the program as transient fault. Due to these features, inherently stabilizing distributed protocols for peer-to-peer, sensor and mobile networks are desirable. Hypercube, star networks and their variations that provide an increased degree of scalability have been initially design for parallel networks. However, their scalability and the presence of multiple disjoint paths in these topologies make them viable alternatives to existing peer-to-peer and sensor networks topologies. In this paper, we proposed an inherently stabilizing algorithm for delivering messages over all node-disjoint paths from a process to another in star networks. the proposed algorithm has numerous applications including VLSI layout, reliable networks routing, secure message transmission, and network survivability. the proposed routing algorithm is optimal with respect to its state space and lengths of the node-disjoint paths.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

parallel computation for luc cryptosystems on distributed memory multiprocessor machine

Parallel computation for luc cryptosystems on distributed me...

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： Ali, Zulkarnain Md Othman, Mohamed Said, Mohd Rushdan Muhd Sulaiman, Mohammad Nasir Department of Computer Science Universiti Kebangsaan Malaysia 43600 Bangi Selangor Malaysia

ISBN: (纸本)9780889867307

Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing computation technique will suffer a huge computations time and spaces when calculating a very large size of public-key and private-key. Recently, a method for fast LUC Cryptosystems computation on single processor has been proposed. In this paper, we extend the method in parallel on distributed memory multiprocessor machine using message-passing interface. We are generating a special sequence from a given value of public-key and private-key. this special sequence will be used to direct the computation of LUC. We examine the parallelism efficiency of the algorithm by analyze the simulation time and speedup.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

A capacity planning tool for batch parallel processing systems

A capacity planning tool for batch parallel processing syste...

引用

19th iasted international conference on Modelling and Simulation, MS 2008

作者： Neto, Angelo Ferecini De Oliveira, José Raimundo Mendes, Rafael Santos FEEC - Unicamp Campinas - SP Brazil

ISBN: (纸本)9780889867420

System capacity planning is a very useful method to predict which hardware will be necessary to run an IT system with high performance. the proposed tool in this paper is developed to ease this hard and important job, automating the analysis of the software in different ways. It uses the discrete-event type simulation based on a queue theory model to represent the hardware and software interaction. the model presented in this paper represents a simplification of any batch IT systems. In this type of system, commonly we have a lot of transactions that need to be processed by the system without human interaction and frequently use the benefits of parallel processing for better performance. We can apply these ideas to represent the workload in the simulation model as simple tasks that enter the system to be processed. Results show that it is possible to use this model to represent the real system with good fidelity.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Communication-Space efficient parallel bitonic sorting on symmetric multiprocessors

Communication-Space efficient parallel bitonic sorting on sy...

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： thanakulwarapas, Tipraporn Werapun, Jeeraporn Ladkrabang Bangkok 10520 Thailand

ISBN: (纸本)9780889867307

this paper presents a new efficient data-exchange process in parallel sorting, which improves both communication time and memory space. In this communication-space efficient strategy, we proposed two new parallel sorting algorithms: 1) CSEBS (Communication-Space Efficient Bitonic Sort) algorithm and 2) CSEOE (Communication-Space Efficient Odd-Even MergeSort) algorithm. In addition, to evaluate the performance, we have implemented the CSEBS and the CSEOE algorithms on the SGI Origin2000. Investigated experimental results have been compared to those of the best of existing algorithm (CEBS: Communication Efficient Bitonic Sort). In the experiments, the proposed CSEBS algorithm yielded the improved results over those of the best of existing algorithm (CEBS) at least 11% on the system of size P = 4 and at least 31% on the system of size P = 8. Moreover our approach can save memory space up to 50%.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

ChiARTS - Safe subset-regression test selection for C#

ChiARTS - Safe subset-regression test selection for C#

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： Channakeshava, Vijaykumar Lakshmanan, Sala Panigrahi, Avinash Shanbhag, Vivek Philips Research Asia Bangalore India International Institute of Information Technology Banglore India

ISBN: (纸本)9780889867307

Regression testing is essential in ensuring continuous improvement of the quality and confidence of every subsequent release of software-products (or long-running projects). However, the (time and man-power) cost of using the entire regression test suite for minor modifications or bug-fixes is often prohibitively high, whereas, the risk associated with releasing a regressed (new) version of the product is not acceptable, either. In this paper we present a technique to identify a small safe subset regression-test-suite for object-oriented managedcode that selects the set of all relevant tests, given the previous and the current versions of the implementation binaries. We have developed ChiARTS, a prototype implementation of our technique for the C# Language, and also overseen its smooth introduction into the test process for a large (internal) software product-line under Philips Medical systems. the design of ChiARTS caters to the needs of our industry-strength test-harness for multi-threaded tests.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

A process model for managing requirement change

A process model for managing requirement change

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： Imtiaz, Saima Ikram, Naveed Imtiaz, Salma Mohammad Ali Jinnah University Islamabad Pakistan International Islamic University Islamabad Pakistan

ISBN: (纸本)9780889867307

Managing continuously changing requirements is adifficult and time consuming task in large projects. Change management if not done properly often leads toproject failure. Requirement Change Management (RCM) process models are surveyed and evaluated on the criteria of roles, activities, artifacts and representation which are fundamental and necessary for a good process model. this evaluation is extended to update the work already done in literature. the deficiencies present in current RCM literature are highlighted. the ontology for process model has already been proposed elsewhere. Using that ontology we propose an RCM process model in this paper. this RCM process model improves upon the deficiencies identified, and it also introduces some new concepts. the process is modeled using UML activity diagram. the purpose of the process model is to provide a more complete and detailed guideline than already present. It will help the practitioners to effectively manage requirement change in large projects.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Greedy distributed tree routing algorithm for wireless ad hoc networks

Greedy distributed tree routing algorithm for wireless ad ho...

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： Kumar, Munish Jaffery, Z.A. Moinuddin CDAC Noida India JMI Delhi India NIT Jalandher India

ISBN: (纸本)9780889867307

As ad hoc networks are continuously growing in size, we are facing the prospect of emerging wireless networks with millions of nodes. Geographic routing algorithms are a better alternative to traditional ad hoc routing algorithms in this new domain for point-to-point routing. But deployments of such algorithms are currently very uncommon because of some practical difficulties. this paper explores techniques that address two major issues in the deployment of geographic routing algorithms: (i) the costs associated with distributed planarization and (ii) the non availability of location information of a node. We present and evaluate a new algorithm for geographic routing: Greedy distributed Tree Routing (GDTR).the previous geographic routing algorithms require the planarization of the network connectivity graph where as GDTR switches to routing on a spanning tree instead of a planar graph when packets end up at dead ends during greedy forwarding. To opt a direction on the tree that is most likely to make progress towards the destination, each GDTR node maintains a summary of the area covered by the subtree below each of its tree neighbors using convex hulls. this distributed data structure is called a hull tree. GDTR not only requires an order of magnitude less resource to maintain these hull trees than the Cross- Link Detection Protocol CLDP, the only distributed planarization algorithm that is known to work with practical radio networks, it often achieves better routing performance than previous planarization-based geographic routing algorithms.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：