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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

482 篇 会议
4 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

298 篇 工学
- 289 篇 计算机科学与技术...
- 165 篇 软件工程
- 94 篇 信息与通信工程
- 38 篇 电气工程
- 26 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 12 篇 机械工程
- 9 篇 建筑学
- 7 篇 动力工程及工程热...
- 5 篇 土木工程
- 4 篇 力学（可授工学、理...
- 4 篇 测绘科学与技术
- 3 篇 光学工程
- 3 篇 化学工程与技术
- 3 篇 航空宇航科学与技...
- 3 篇 农业工程
- 3 篇 生物工程
112 篇 理学
- 96 篇 数学
- 14 篇 统计学（可授理学、...
- 12 篇 系统科学
- 9 篇 物理学
- 7 篇 生物学
- 5 篇 化学
- 3 篇 地球物理学
62 篇 管理学
- 43 篇 管理科学与工程(可...
- 38 篇 工商管理
- 21 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 3 篇 法学
5 篇 文学
- 5 篇 新闻传播学
3 篇 农学
2 篇 教育学
1 篇 医学
1 篇 军事学

主题

111 篇 distributed comp...
69 篇 computer network...
54 篇 concurrent compu...
43 篇 grid computing
38 篇 distributed comp...
37 篇 peer to peer com...
36 篇 intelligent netw...
36 篇 artificial intel...
35 篇 software enginee...
30 篇 parallel process...
30 篇 computer archite...
27 篇 application soft...
26 篇 computer science
25 篇 parallel process...
24 篇 delay
20 篇 scalability
18 篇 routing
18 篇 bandwidth
17 篇 costs
16 篇 network servers

机构

5 篇 institute of com...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 institute of com...
2 篇 department of co...
2 篇 department of in...
2 篇 school of comput...
2 篇 the leslie and s...
2 篇 school of comput...
2 篇 univ valencia ir...
2 篇 national laborat...
2 篇 graduate univers...
2 篇 college of infor...
2 篇 department of co...
2 篇 national key lab...
2 篇 seikei universit...
2 篇 department of co...
2 篇 chinese academy ...
2 篇 univ catania dep...
2 篇 china mobile com...

作者

5 篇 mikkilineni rao
4 篇 morana giovanni
3 篇 messina fabrizio
3 篇 huaikou miao
3 篇 engelmann christ...
3 篇 sungwon kang
2 篇 choi k.
2 篇 yongquan fu
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...
2 篇 dongsheng li
2 篇 guangyu shi
2 篇 shietung peng
2 篇 satoshi fujita
2 篇 hao gong
2 篇 ming-chien yang
2 篇 pawaskar sachin
2 篇 alias norma
2 篇 yijie wang

语言

488 篇 英文

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

共 488 条记录，以下是61-70 订阅

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

详细简洁

排序：

Permuting ability of uniaxial 2D and 3D tori under dimension-order routing

Permuting ability of uniaxial 2D and 3D tori under dimension...

引用

iasted international conference on parallel and distributed computing and networks, pdcn 2009

作者： Veselovsky, Gennady Department of Computer and Network Engineering Assumption University of Thailand Ramkhamhaeng Rd. Soi 24 Bangkok 10240 Thailand

ISBN: (纸本)9780889867840

Permutations belong to communications patterns demanded frequently in massively-parallel computers especially of the SIMD type. A permutation is said "admissible" to a given interconnection network if it does not cause blockings in that network under a chosen routing algorithm. Determining the admissibility of a given permutation to various static connecting topologies is a fundamental problem. Based on congruence notion from number theory, this paper presents a simple method which solves admissibility problem for regular permutations to uniaxial 2D and 3D tori under deterministic dimension-order routing commonly used in practice. Here "uniaxial" means that in every routing step all data items participating in a permutation can move along the same axis only. It is assumed that all nodes of a system work in a synchronous fashion what is also characteristic to SIMDs. The efficiency of the method is illustrated by the examples with checking admissibility of some frequently used in parallel programming permutations which belong either to Omega or BPC (bit-permute-complement) classes.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Autovectorization-friendly program transformation in the array processing language

Autovectorization-friendly program transformation in the arr...

引用

iasted international conference on parallel and distributed computing and networks, pdcn 2009

作者： Shirota, Yusuke Segawa, Jun'ichi Matsui, Yukio Kanai, Tatsunori Corporate Research and Development Center TOSHIBA Corporation 1 Komukai-Toshiba-cho Saiwai-ku Kawasaki 212-8582 Japan

ISBN: (纸本)9780889867840

Productivity of parallel programs for evolving multicore architecture is increasingly becoming an important issue. To address this issue, we designed an architecture-independent programming system, with our new high-level language dedicated to array processing. Array processing programs are translated into parallelized C++ programs customized for each processor architecture by our translator. To enhance performance of the generated C++ programs by exploiting SIMD instructions effectively with minimal effort of supporting new architectures, it is preferable to use auto-vectorization features of C++ compilers. However, auto-vectorization is often restricted to inner-most loops in which all memory access are consecutive. Furthermore, it is at most important to optimize memory access;otherwise, the effect of vectorization is hidden in memory access latency. For optimization, our language is designed to allow the translator to easily extract adjacency properties of arrays from the array-oriented operators. To enhance compilation with auto-vectorization, we propose a high-level program transformation method using the extracted information. We confirmed that C++ programs with inner-most loops amendable to auto-vectorization can be generated.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

distributed data gathering and data multicasting for wireless sensor networks with multiple mobile sinks

Distributed data gathering and data multicasting for wireles...

引用

iasted international conference on parallel and distributed computing and networks, pdcn 2009

作者： Park, Soochang Lee, Euisin Yu, Fucai Jin, Min-Sook Kim, Sang-Ha Department of Computer Engineering Chungnam National University 220 Gung-dong Yuseong-gu Daejeon 305 764 Korea Republic of

ISBN: (纸本)9780889867840

In wireless sensor networks, groups of mobile users interested in equivalent information could be classified into two categories according to existence of direct communication channel among the users: 1) loosely coupled user group and 2) tightly coupled user group. The loosely coupled group means that a mobile user should communicate with others via a wireless sensor network for querying, gathering, and sharing of information interested from the group. Information communication mechanisms to support mobility of the loosely coupled user groups have already been proposed. However, the mechanisms may not suit in case of sensor applications with multiple data sources since those are usually construct a network structure per each source. Namely, according to the mechanisms, too many network structures for the many data sources could be constructed and it may causes excessive computing overhead and energy exhaustion of sensors. Therefore, we propose an information communication mechanism to support mobility of loosely coupled mobile users in sensor applications with multiple sources. First, we examine the problems for mobility support of the loosely coupled groups in wireless sensor networks with multiple source nodes, and then study the dynamic sink communication model for data gathering from multiple sources and data delivery to a mobile user. Finally, we present an energy-efficient solution to support mobility of loosely coupled groups based on data gathering tree establishment via distributed manner and tree-based data multicasting.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

parallel and concurrent search for fast AND/OR tree search on multicore processors

Parallel and concurrent search for fast AND/OR tree search o...

引用

iasted international conference on parallel and distributed computing and networks, pdcn 2009

作者： Takano, Fumiyo Maekawa, Yoshitaka Kasahara, Hironori Department of Computer Science and Engineering Waseda University 3-4-1 Ohkubo Shinjuku Tokyo Japan Japan Society for the Promotion of Science Japan Department of Computer Science Chiba Institute of Technology 2-17-1 Tsudanuma Narashino Chiba Japan

ISBN: (纸本)9780889867840

This paper proposes a fast AND/OR tree search algorithm using a multiple paths parallel and concurrent search scheme for embedded multicore processors. Currently, not only PCs or supercomputers but also information appliances such as game consoles, mobile devices and car navigation systems are equipped with multicore processors for better cost performance and lower power consumption. However, the number of processor cores and the amount of memories in embedded multicore processors are limited for lowering power consumption and chip costs. Development of parallel application programs on embedded multicore processors requires exploitation of parallelism and effective utilization of small memories. The proposed algorithm allows us to search in parallel many paths including lowly evaluated nodes and paths including highly evaluated nodes. The algorithm also uses depth-first search, working on small memories. The proposed algorithm is applied for a tsume-shogi (Japanese chess problem) solver as a typical AND/OR tree search problem on an embedded multicore processor system, NEC Electronics NaviEngine with four ARM processor cores. Evaluation results for 100 problems show that the proposed algorithm executed on two processor cores is 2.36 times faster, and executed on four processor cores is 4.17 times faster than the sequential algorithm on the average.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

A cache-aware thread scheduling policy for multi-core processors

A cache-aware thread scheduling policy for multi-core proces...

引用

iasted international conference on parallel and distributed computing and networks, pdcn 2009

作者： Sato, Masayuki Kotera, Isao Egawa, Ryusuke Takizawa, Hiroyuki Kobayashi, Hiroaki Graduate School of Information Sciences Tohoku University Aramaki-Aza-Aoba Aoba-ku Sendai 980-8578 Japan Cyberscience Center Tohoku University Aramaki-Aza-Aoba Aoba-ku Sendai 980-8578 Japan

ISBN: (纸本)9780889867840

A modern high-performance multi-core processor has large shared cache memories. However, simultaneously running threads do not always require the entire capacities of the shared caches. Besides, some threads cause severe performance degradation by inter-thread cache conflicts and shortage of capacity on the shared cache. To achieve high performance processing on multi-core processors, effective usage of shared cache memories plays important role. In this paper, we propose a cache-aware thread scheduling policy for multi-core processors with multiple shared cache memories. The total processor performance becomes more sensitive to the cache capacity shortage, as larger caches are requested by the threads sharing one cache. The proposed policy can prevent multiple threads requesting a large cache capacity from sharing one cache. As a result, the policy can prevent inter-thread resource conflicts and hence severe performance degradation. Experimental results clearly demonstrate that the policy assists the cache partitioning mechanisms and avoids unfair performance degradation among threads. Thread scheduling based on the proposed policy can improve the performance by up to 10% and an average of 5% compared with thread scheduling without the proposed policy.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Cost performance analysis in parallel computing networks with divisible load scheduling

Cost performance analysis in parallel computing networks wit...

引用

21st iasted international conference on parallel and distributed computing and Systems, PDCS 2009

作者： Choi, K. Robertazzi, T.G. Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY 11794 United States

ISBN: (纸本)9780889868113

A monetary network cost issue in a parallel computing network with a homogeneous single-level tree topology is discussed. The monetary network cost, which is linearly dependent on the amount of divisible workload, is composed of a communication cost and a computing cost. Through mathematical analysis for the monetary network cost in two different load distribution strategies (sequential distribution and simultaneous distribution), the issue of the relationship between the monetary network cost and ratio of network speed parameters is studied comprehensively. By introducing a new parameter, cost efficiency, a numerical network model suited for cost efficient parallel processing is examined. Simulation results yield insights for trends of network performance against network cost. The numerical analysis and simulation works here are worth being highlighted for high performance parallel computing networks under limited network cost.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for computing alternate paths avoiding failed nodes and links

Distributed algorithms for computing alternate paths avoidin...

引用

21st iasted international conference on parallel and distributed computing and Systems, PDCS 2009

作者： Bhosle, Amit M. Gonzalez, Teofilo F. Department of Computer Science University of California Santa Barbara CA 93106 United States

ISBN: (纸本)9780889868113

A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally recomputed on a failure does not pay off since the failed element recovers fairly quickly, and the recomputed routing paths need to be discarded. In this paper, we present the first distributed algorithm that computes the alternate paths required by some proactive recovery schemes for handling transient failures. Our algorithm computes paths that avoid a failed node, and provides an alternate path to a particular destination from an upstream neighbor of the failed node. With minor modifications, we can have the algorithm compute alternate paths that avoid a failed link as well. To the best of our knowledge all previous algorithms proposed for computing alternate paths are centralized, and need complete information of the network graph as input to the algorithm.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 20th iasted international conference on parallel and distributed computing and Systems, PDCS 2008

Proceedings of the 20th IASTED International Conference on P...

引用

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

ISBN: (纸本)9780889867741

The proceedings contain 57 papers. The topics discussed include: logical topology design with traffic grooming for scheduled demands;the impact of multi-core architectures on task retrieval policies for volunteer computing;evaluation of CPU power control and scheduling technique on parallel computing environment;clustered assignment of CCQS in information monitoring system supporting conjunctive queries;dense skip graphs as an overlay for P2P networks;multi-connection and multi-core aware all-gather on infiniband clusters;an improved prioritization method for task scheduling in heterogeneous computing systems;thread pipelining with clustered data communication on commodity CMPS;a distributed algorithm for disjoint paths in star networks;parallel algorithms for a visual text mining platform;and a cache miss analysis for multithreaded architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive grid computing for MPI applications

Adaptive grid computing for MPI applications

引用

21st iasted international conference on parallel and distributed computing and Systems, PDCS 2009

作者： Zhang, Juemin Meleis, Waleed Department of Electrical and Computer Engineering Northeastern University Boston MA 02115 United States

ISBN: (纸本)9780889868113

Our objective is to provide location-, topology-, and administrative- transparent grid computing forMPI applications, while hiding the physical details of computing platforms and heterogeneous networks fromthe application elopers and users. To achieve this objective, we introduced a new resource allocation model, workflow structures to specify MPI applications involving multiple tasks, and message relay to enable communication across different networks. We eloped the SGR framework, which integrates workflow scheduling, task grouping, and message relay services, while hiding resource allocation, heterogeneous networks, and decentralized resource management systems from application elopers and users. The SGR system has been implemented on a Globus-enabled computing grid. We created a simulation environment to investigate our model and various schedulers. Using the findings from simulation, we implemented the SGR framework and tested the model's implementation on a two-cluster grid. We observed that duplication can improve performance by more than 15%, which matches our simulation results. Moreover, we evaluated our new message relay service for cross-site message passing. The test results indicate that although the SGR's message relay service has some communication overhead, the system is scalable with respect to the number of processes and the message size.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

An Opportunistic Routing Protocol for Underground Wireless Sensor networks

An Opportunistic Routing Protocol for Underground Wireless S...

引用

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

作者： Joe, Inwhee Kim, Dongik Hanyang Univ Dept Elect & Comp Engn Seoul 133791 South Korea

ISBN: (纸本)9780769536422

Recently, most researches in the area of wireless sensor networks are limited to the ground environment, so the demand for underground wireless sensor networks is increasing. However the underground environment is different from the ground environment in that there are some critical problems in reliability due to the large path loss of the underground. Therefore, in this paper we propose an opportunistic routing protocol for improving the reliability in the underground environment. Through the test-bed experiments the proposed routing protocol is compared with other routing protocols.

关键词： Routing protocols Wireless sensor networks distributed computing Hardware Relays Computer networks Concurrent computing Media Access Protocol Software engineering Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：