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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,695 篇 会议
114 册 图书
74 篇 期刊文献

馆藏范围

6,883 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,556 篇 工学
- 3,363 篇 计算机科学与技术...
- 1,731 篇 软件工程
- 1,052 篇 信息与通信工程
- 672 篇 电气工程
- 228 篇 控制科学与工程
- 177 篇 电子科学与技术（可...
- 143 篇 机械工程
- 97 篇 动力工程及工程热...
- 97 篇 生物工程
- 94 篇 测绘科学与技术
- 42 篇 生物医学工程（可授...
- 40 篇 仪器科学与技术
- 39 篇 光学工程
- 34 篇 建筑学
- 29 篇 土木工程
- 28 篇 网络空间安全
- 27 篇 安全科学与工程
770 篇 理学
- 567 篇 数学
- 112 篇 生物学
- 102 篇 统计学（可授理学、...
- 100 篇 物理学
- 75 篇 系统科学
- 37 篇 化学
510 篇 管理学
- 382 篇 管理科学与工程(可...
- 196 篇 工商管理
- 155 篇 图书情报与档案管...
82 篇 医学
- 80 篇 临床医学
- 25 篇 基础医学(可授医学...
42 篇 经济学
- 42 篇 应用经济学
35 篇 法学
- 25 篇 社会学
12 篇 农学
10 篇 文学
8 篇 教育学
8 篇 军事学
1 篇 艺术学

主题

900 篇 distributed comp...
802 篇 computer network...
513 篇 concurrent compu...
450 篇 wireless sensor ...
376 篇 parallel process...
353 篇 computer science
352 篇 routing
344 篇 neural networks
340 篇 computational mo...
304 篇 computer archite...
260 篇 application soft...
255 篇 network topology
253 篇 peer to peer com...
253 篇 protocols
244 篇 bandwidth
236 篇 grid computing
232 篇 software enginee...
190 篇 costs
177 篇 intelligent netw...
177 篇 artificial intel...

机构

28 篇 institute of com...
24 篇 shandong provinc...
20 篇 key laboratory o...
15 篇 shandong fundame...
14 篇 department of co...
13 篇 university of ch...
12 篇 department of co...
11 篇 department of co...
11 篇 department of co...
11 篇 institute of com...
11 篇 national laborat...
11 篇 beijing universi...
10 篇 college of compu...
10 篇 institute of inf...
10 篇 school of cyber ...
10 篇 department of co...
10 篇 school of comput...
9 篇 shandong enginee...
9 篇 department of co...
9 篇 school of comput...

作者

16 篇 shen hong
16 篇 jiannong cao
15 篇 m. takizawa
15 篇 li dongsheng
15 篇 hong shen
14 篇 shietung peng
14 篇 eyas el-qawasmeh
13 篇 lemin li
13 篇 rothermel kurt
12 篇 hai jin
11 篇 dongsheng li
11 篇 jack dongarra
11 篇 wei zhang
10 篇 koibuchi michihi...
10 篇 t. enokido
10 篇 wang yang
10 篇 stephen l. scott
10 篇 j. duato
10 篇 m. ould-khaoua
9 篇 duerr frank

语言

6,820 篇 英文
51 篇 其他
16 篇 中文

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

共 6883 条记录，以下是121-130 订阅

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

详细简洁

排序：

Full-speed scalability of the pdomus platform for dhts

Full-speed scalability of the pdomus platform for dhts

引用

international conference on parallel and distributed computing and networks

作者： Rufino, Jose Pina, Antonio Alves, Albano Exposto, Jose Lopes, Rui Polytech Inst BR-5300854 Braganca Paulista SP Brazil Univ Minho P-4719 Braga Portugal

ISBN: (纸本)9780889866379

Domus is an architecture for distributed Hash Tables (DHTs) tailored to a shared-all cluster environment. Domus DHTs build on a (dynamic) set of cluster nodes;each node may perform routing and/or storage tasks, for one or more DHTs, as a function of the node base (static) resources and of its (dynamic) state. Domus DHTs also benefit from a rich set of user-level attributes and operations. pDomus is a prototype of Domus that creates an environment where to evaluate the architecture concepts and features. In this paper, we present a set of experiments conduced to obtain figures of merit on the scalability of a specific DHT operation, with several lookup methods and storage technologies. The evaluation also involves a comparison with a database and a P2P-oriented DHT platform. The results are promising, and a motivation for further work.

关键词： cluster computing distributed hash tables evaluation

来源：评论

学校读者我要写书评

暂无评论

O(1) runtime Contour-Based Priority (CBP) scheduling in optical burst switched networks

O(1) runtime Contour-Based Priority (CBP) scheduling in opti...

引用

18th iasted international conference on parallel and distributed computing and Systems

作者： Chen, Yuhua Turner, Jonathan S. Zhai, Zhi Univ Houston Dept Elect & Comp Engn Houston TX 77204 USA Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

ISBN: (纸本)9780889866386

Optical burst switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over DWDM links. Although several QoS schemes have been proposed for OBS networks, how to provide QoS at the high speed required by the OBS network is still an open question. In this paper, we propose a novel O(1) runtime Contour-Based Priority (CBP) algorithm which provides complete priority isolation among different priorities. This is the first practical O(1) runtime priority algorithm proposed and it is well-suited to high speed hardware implementation.

关键词： Algorithm Optical burst switching (OBS) Priority scheduling Wavelength division multiplexing (WDM)

来源：评论

学校读者我要写书评

暂无评论

MAT6: A hybrid address autoconfiguration in IPv6 networks

MAT6: A hybrid address autoconfiguration in IPv6 networks

引用

18th iasted international conference on parallel and distributed computing and Systems

作者： Tang, Su-Kit Yeting, Kai-Hau Wong, Kin-Yeung Macao Polytech Inst Rua Luis Gonzaga Gomes Macau Peoples R China City Univ Hong Kong Kowloon Hong Kong Peoples R China Macao Polytech Inst Macau Peoples R China

ISBN: (纸本)9780889866386

The automatic address configuration simplifies the IP configuration task in IPv6 networks. Two protocols have been developed for automatic address configuration: Neighbor Discovery Protocol (NDP) and Dynamic Host Configuration Protocol for IPv6 (DHCPv6). However, these protocols create security holes in a network that expose network nodes to various attacks such as redirect and DoS attacks. In this paper, we propose a new hybrid address autoconfiguration to automate address generation and assignment in IPv6 networks. This autoconfiguration will protect network nodes from address misconfiguration and the mentioned attacks, by managing the flow of NDP and DHCPv6 messages.

关键词： IPv6 address autoconfiguration NDP DHCPv6 infrastructural security MAC address translation

来源：评论

学校读者我要写书评

暂无评论

Service-aware virtual machine placement mechanism for utility computing

Service-aware virtual machine placement mechanism for utilit...

引用

18th iasted international conference on parallel and distributed computing and Systems

作者： Kawato, Masahiro Machida, Fumio Maeno, Yoshiharu NEC Corp Ltd Internet Syst Res Labs Nakahara Ku 1753 Shimonumabe Kawasaki Kanagawa 2118666 Japan

ISBN: (纸本)9780889866386

Dynamic server resource allocation to services on networks, or utility computing, is a powerful technology to provide required computer resources for multiple service providers at low cost. Virtual machine (VM) technology can be combined with utility computing to further improve server resource utilization. An important technical issue about VM-based utility computing is optimal placement of VMs on physical server nodes, because performance of services may be seriously affected by VM placement. We address this issue by introducing an on-line placement algorithm on the basis of performance influence among services. We have implemented this algorithm and evaluated on a simulated environment. The results have shown that the proposed mechanism can get roughly 25% better score calculated by the placement rules compared with a random placement algorithm.

关键词： virtual machine utility computing resource allocation

来源：评论

学校读者我要写书评

暂无评论

I/O node placement for performance and reliability in torus networks

I/O node placement for performance and reliability in torus ...

引用

18th iasted international conference on parallel and distributed computing and Systems

作者： Azeez, Babatunde Kim, Hogil Jin, Yuho Kim, Eun Jung Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA

ISBN: (纸本)9780889866386

When a cluster system interconnects processor and I/O nodes through a network, an optimal placement of I/O nodes is critical to improve the overall system performance by reducing its communication latency. In this paper, we propose an efficient and scalable I/O node placement scheme, called a relaxed quasi-perfect, for torusbased interconnection networks using Lee distance errorcorrecting code. It provides a more general placement than the previous quasi-perfect placement [I]. We also suggest " fault-tolerant scheme using our I/O placement model for " guaranteed performance. Simulation results show that our scheme provides 53% speed-up over the quasi-perfect. Also the fault tolerant scheme provides a graceful slowdown especially until the number of faulty I/O nodes becomes less than half of the initial I/O nodes.

关键词： resource allocation torus interconnection networks fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Indexing of spatio-temporal telemetric data based on distributed mobile bucket index

Indexing of spatio-temporal telemetric data based on distrib...

引用

iasted international conference on parallel and distributed computing and networks

作者： Gorawski, M Dyga, A Silesian Tech Univ Inst Comp Sci Akad 16 PL-44100 Gliwice Poland

ISBN: (纸本)088986568X

This paper describes the idea of a multi-dimensional bucket index designed for efficient indexing of telemetric readings. This data structure answers spatio-temporal range queries concerning utility usage within user selected region and time. It has a capability of adjusting to incoming data and therefore is suitable to process data of highly dynamic nature. A stochastic prediction method is used to estimate utility usage in the near future. The real world implementation employs mobile agent system network which facilitates effective workload balancing of network hosts.

关键词： telemetric readings bucket index exponential smoothing mobile agents workload balancing

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of a number of reliable and fault-tolerant Hierarchical Interconnection networks

Performance comparison of a number of reliable and fault-tol...

引用

18th iasted international conference on parallel and distributed computing and Systems

作者： Abd-El-Barr, Mostafa Kuwait Univ CFW Dept Informat Sci Safat 13060 Kuwait

ISBN: (纸本)9780889866386

Hierarchical Interconnection networks (HINs) provide a framework for designing networks with reduced cost, minimized message delay, improved network reliability and fault tolerance. In this paper, we present the main characteristics of a number of fault tolerant HINs. These include Block Shift networks (BSNs), Hierarchical Cubic networks (HCNs), and the Hyper-Torus Hierarchical Network (HTHN) using fault tolerant building block (FTBB). We provide an overall performance comparison among these networks. The metrics used for comparison are node degree, network diameter, cost, reliability, and fault tolerance. Our analysis shows that as the number of faults exceeds six, the FTBB has a higher probability to recover from those faults as compared to the HCN and HTHN architectures. The fault diameter of the FTBB is also larger than that of each of the other two architectures, particularly if the number of faults is seven or more. The improvement in the fault tolerance and reliability performance of the FTBB is achieved at the expense of a reasonable increase in the number of nodes and links. The paper provides designers of HIM with the insight needed while evaluating the performance of HINs for possible adoption to their application requirements.

关键词： Hierarchical Interconnection networks fault tolerance reliability performance analysis fault tolerant building block Hyper-Torus Network Hierarchical Cubic Network

来源：评论

学校读者我要写书评

暂无评论

RHT: Supporting range queries in DHT-based P2P systems

RHT: Supporting range queries in DHT-based P2P systems

引用

18th iasted international conference on parallel and distributed computing and Systems

作者： Liu, Lintao Ryu, Kyung Dong Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA IBM Corp TJ Watson Res Ctr Hawthorne NY 10532 USA

ISBN: (纸本)9780889866386

An efficient range query processing support is required for distributed Hash Table (DHT)-based P2P networks as consistent hashing destroys the inherent order of numeric keys. In this paper, we present a lightweight and efficient mechanism, called Range Hash Tree (RHT), to support range queries on DHTs. In RHT, key space is partitioned into small ranges such that data items within one range can be stored on one node. To quickly resolve a range query, we introduce a scalable encoding algorithm that can represent the key space partitioning status with a small RHT Signature. Compared to other approaches, RHT provides a bounded query delay, which is independent of the size of range query and the number of matching data items. Our experiments show that RHT works efficiently on both uniform and much skewed data distributions.

关键词： range queries distributed Hash Table signature Peer-to-Peer distributed computing

来源：评论

学校读者我要写书评

暂无评论

Cross-layer design based data aggregation for maximizing network lifetime

Cross-layer design based data aggregation for maximizing net...

引用

international conference on parallel and distributed computing and networks

作者： Lee, Sangbin Han, Kyuho Lim, Kyungsoo An, Sunshin Korea Univ Dept Elect & Elect Engn Seoul 136701 South Korea

ISBN: (纸本)9780889866379

A wireless sensor network consists of many energy-autonomous micro-sensors distributed throughout an area of interest. Each node has a limited energy supply and generates information that needs to be communicated to a sink node. The basic operation in such a network is the systematic gathering and transmission of sensed data to a base station for further processing. During data gathering, sensors have the ability to perform in-network aggregation (fusion) of data packets route to the base station. The lifetime of such a sensor system is the time during which we can gather information from all the sensors to the base station. Given the location of sensors and the base station and the available energy at each sensor, we are interested in finding an efficient manner in which the data should be collected from all the sensors and transmitted to the base station at a given rate, such that system lifetime is maximized. We present an adaptive data aggregation node selection scheme to solve this problem. Our experimental results demonstrate that the proposed protocols significantly outperform previous methods, in terms of energy saving and system lifetime.

关键词： cross-layer design data aggregation maximum network lifetime wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic energy aware task scheduling using run-queue peek

Dynamic energy aware task scheduling using run-queue peek

引用

international conference on parallel and distributed computing and networks

作者： Pawaskar, Sachin Ali, Hesham H. Univ Nebraska Dept Comp Sci Omaha NE 68182 USA

ISBN: (纸本)9780889866379

Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy consideration. A number of heuristics have been developed for this consideration. In this paper, we study the scheduling problem for a particular battery model. In the proposed work, we show how to enhance a well know approach of accounting for the slack generated at runtime due to the difference between WCET (Worst Case Execution Time) and AET (Actual Execution Time). Our solution exploits the fact that even though some tasks become available based on the actual periodicity of a task they are not executed because the run queue is determined by the schedule generated in the offline phase I of the algorithm using the conservative EDF (Earliest Deadline First) algorithm. We peek at the task run-queue to find such tasks to eliminate wastage of the slack generated. Based on the outcome of the conducted experiments, the proposed algorithm outperformed or matched the performance of the 2-Phase dynamic task scheduling algorithm all the time.

关键词： scheduling energy awareness heuristics parallel processing optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：