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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

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

共 660 条记录，以下是221-230 订阅

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

详细简洁

排序：

Auction-based resource allocation protocols in grids

Auction-based resource allocation protocols in grids

引用

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

作者： Grosu, Daniel Das, Anubhav Department of Computer Science Wayne State University 5143 Cass Avenue Detroit MI 48202

In this paper, we study the auction model for resource management using the SimGrid simulation framework. We investigate three types of auction allocation protocols: (i) First-Price Auction, (ii) Vickrey Auction and (iii) Double Auction. the goal is to find which one is best suitable for the grid environment from users' perspective as well as from resources' perspective. the results showed that when we consider a mix of risk-averse and risk-neutral users First-Price Auction favors resources while Vickrey Auction favors users. On the other hand the Doubly Auction favors both users and resources.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A constant time shortest-path routing algorithm for pyramid networks

A constant time shortest-path routing algorithm for pyramid ...

引用

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

作者： Hsieh, Hsien-Jone Duh, Dyi-Rong Shiau, Jing-Shiuh Dept. of Comp. Science Engineering National Chi Nan University 1 University Rd. Puli Nantou Hsien 545 Taiwan

For interconnection networks, designing shortest path routing algorithms is in general more difficult than designing simple routing algorithms. In this paper, we derive a shortest path routing algorithm for pyramid networks. the proposed algorithm takes O(l) time to determine a shortest path between any two nodes in a pyramid network. We also design a distributed routing algorithm such that an intermediate node takes O(1) time to confirm the next node along the shortest path without any centralized controller.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A consistent coordinated checkpointing protocol for distributed systems

A consistent coordinated checkpointing protocol for distribu...

引用

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

作者： Neogy, Sarmistha Sinha, Anupam Das, Pradip K. Dept. of Comp. Sci. and Engineering Jadavpur University India

this paper describes a distributed coordinated checkpointing protocol that always ensures a consistent set of checkpoints. A checkpoint initiator initiates checkpointing activity and the protocol followed is two phase with each process maintaining a tentative checkpoint till it is made permanent or aborted. However, there is no central checkpoint initiator, but each of the processes takes turn to act as the initiator. Processes take local checkpoints only after being notified by the initiator. the guaranty that no message would be lost in the system (where processes communicate via messages only) in case of failure is maintained in this work by forcing processes to refrain from sending computation messages for a certain period of time that generally equals the time a message in a network takes to reach its destination from the sender. Processes carry out local computations only during that period that eventually gets included in the current permanent checkpoint.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed performance of self-organizing neural grove

Parallel and distributed performance of self-organizing neur...

引用

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

作者： Inoue, Hirotaka Tsuda, Michiaki Narihisa, Hiroyuki Department of Electrical Engineering Kure National College of Technology 2-2-11 Agaminami Kure-shi Hiroshima 737-8506 Japan Department of Information Okayama University of Science 1-1 Ridai-cho Okayama-shi Okayama 700-0005 Japan

In this paper, we present the improving capability of accuracy and the parallel efficiency of self-organizing neural groves (SONGs) for classification on a MIMD parallel computer. Self-generating neural networks (SGNNs) are originally proposed on adopting to classification or clustering by automatically constructing self-generating neural tree (SGNT) from given training data. the SONG is composed of plural SGNTs each of which is independently generated by shuffling the order of the given training data, and the output of the SONG is voted all outputs of the SGNTs. We allocate each of SGNTs to each of processors in the MIMD parallel computer. Experimental results show that the more the number of processors increases, the more the classification accuracy increases for all problems.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Application categories for QOS management of distributed applications

Application categories for QOS management of distributed app...

引用

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

作者： Keep, Heather Bauer, Michael Department of Computer Science University of Western Ontario London Ont. N6A 5B7 Canada

Quality of Service (QoS) management in today's distributed computing environments requires that application level resource requirements be considered from the user's perspective since user satisfaction is the ultimate goal of QoS management. the variety of applications and diversity of user requirements creates challenges for management systems to attempt to satisfy user requirements. In this paper, a policy-driven architecture for user-defined differentiated services is proposed and an overview of the implementation given. the key contribution of this paper is the use of application categories, each characterizing different sets of applications with similar QoS requirements, to determine groups of policies for use by the management system. this approach can reduce the number of policies that much be defined and provide flexibility in meeting individual user QoS requirements. Experience with the prototype is also reported.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Exercise management scheme for a distributed e-learning system

Exercise management scheme for a distributed e-learning syst...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Kawamura, Takao Kuramochi, Kazuo Sugahara, Kazunori Department of Information and Knowledge Engineering Tottori University 4-101 Koyama-Minami Tottori Japan

ISBN: (纸本)9780889867048

We have proposed and implemented a distributed asynchronous Web-based training (WBT) system. In order to improve the scalability and robustness of this system, all exercises and functions, such as scores user's answers are realized on mobile agents. these agents are distributed to computers, and they can be constructed with a P2P network that modified Content-Addressable Network (CAN). In this paper, we present the exercise management scheme for the proposed WBT system. In a WBT system based on client/server model, management of exercises is simply achieved by manipulating data, since all contents are concentrated in one server computer. In the proposed system, however, we need to pay attention to distributed agents for management of exercises. In order to achieve operation of exercise management, i.e., adding, deleting and updating exercises on the distributed WBT system, we use steps with considering multi-agent based distributed environment: specifying an agent which provides an exercise and searching its node as pre-operation, and sending an agent to the expected node and notifying other cooperating agents as post-operation.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

A distributed software architecture for a rapid geospatial dataset generation system

A distributed software architecture for a rapid geospatial d...

引用

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

作者： Lee, Arthur H. Sekar, Arvind Claremont McKenna College Claremont CA Spatial Cognition LLC Salt Lake City UT

A wide variety of systems from many different fields use geospatial data to represent physical environments. these systems, and the data on which they operate, are not only becoming more complex, but they are increasingly being connected together. Although each system may be interested in very different aspects of the environment, the geospatial data they use must be consistent and correlated with each other. As these "systems of systems" grow and as the amount of geospatial data gathered each day increases, the collection and preparation of these data has become the most time consuming and costly processes in the use of many of these systems. the solution to this problem lies in the creation of a geospatial dataset generation system that can efficiently collect, manipulate, and correlate geospatial data to the requirements of the end user. In this paper, we use the unique requirements of building geospatial datasets to derive a distributed software architecture for such a system.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Genetic Algorithm for Server Placement in distributed Interactive Applications

An Enhanced Genetic Algorithm for Server Placement in Distri...

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Zheng, Hanying Tang, Xueyan Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)9781467345651

Recent years have witnessed the enormous popularity of distributed interactive applications (DIAs), which allow participants that are distributed in the network to interact with each other concurrently. the rapid growth of DIAs has raised stringent requirements on providing realistic sense of interaction between participants, whose quality is heavily influenced by network latencies. Although network latencies cannot be eliminated due to geographical spreads of participants, it is possible to reduce them by a smart selection of the locations where the servers of the DIAs are placed. the locations of servers affect not only the inter-server latencies but also the latencies from participants to servers, both of which are involved in the interactions among participants. thus, the placement of servers is an important factor to the interactivity performance of DIAs. We formulate the server placement problem, and propose to solve it by an enhanced genetic algorithm, whose genetic operators are specially designed based on the nature of the problem. Experimental results using various datasets show that our algorithm leads to appreciable improvement of the interaction quality in DIAs.

关键词： server placement distributed interactive application network latency optimization genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of SSDLM: A distributed lock manager with shared lock locality

Design and implementation of SSDLM: A distributed lock manag...

引用

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

作者： Kishida, Hajime Yamazaki, Haruaki Department of Computer Science Yamanashi University Yamanashi Japan

A cluster system can potentially provide features of high availability, extended scalability and fault tolerance. However, there are few cluster systems that have transactional capability with distributed lock managers to provide a single system image for transactional applications. We propose a distributed lock manager architecture called SSDLM for a cluster system, which is based on self-management of shared locks in a node to decrease lock management overhead in a cluster system. this paper describes the algorithm and the design of the lock management in SSDLM using data structures and processes. Finally, we test it through our experiments in terms of transaction response time and lock response time. the experimental results show that the overall performance improves with a small increase of nodes but becomes saturated soon, and that the locality of shared locks in SSDLM is effective for all experiments, and especially outstanding in the lock response time for read intensive transactions.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：