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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

608 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

341 篇 工学
- 332 篇 计算机科学与技术...
- 204 篇 软件工程
- 122 篇 信息与通信工程
- 34 篇 电气工程
- 25 篇 控制科学与工程
- 24 篇 电子科学与技术（可...
- 8 篇 动力工程及工程热...
- 8 篇 测绘科学与技术
- 7 篇 机械工程
- 7 篇 建筑学
- 6 篇 生物工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 3 篇 力学（可授工学、理...
- 3 篇 土木工程
- 3 篇 生物医学工程（可授...
- 2 篇 仪器科学与技术
109 篇 理学
- 90 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 9 篇 物理学
- 9 篇 生物学
- 5 篇 化学
- 2 篇 大气科学
- 2 篇 地球物理学
76 篇 管理学
- 51 篇 管理科学与工程(可...
- 43 篇 工商管理
- 27 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 医学
- 4 篇 临床医学
2 篇 法学
1 篇 教育学
1 篇 农学

主题

174 篇 distributed comp...
111 篇 computer network...
100 篇 software enginee...
93 篇 artificial intel...
73 篇 concurrent compu...
55 篇 computer science
47 篇 grid computing
47 篇 distributed comp...
45 篇 peer to peer com...
39 篇 application soft...
31 篇 parallel process...
31 篇 wireless sensor ...
30 篇 network topology
29 篇 parallel process...
29 篇 delay
28 篇 costs
25 篇 algorithm design...
25 篇 large-scale syst...
24 篇 protocols
23 篇 resource managem...

机构

3 篇 department of co...
3 篇 department of co...
3 篇 school of inform...
3 篇 national laborat...
3 篇 institute of com...
3 篇 school of comput...
3 篇 school of comput...
2 篇 univ sci & techn...
2 篇 huazhong univ sc...
2 篇 department of co...
2 篇 univ adelaide sc...
2 篇 school of comput...
2 篇 univ technol syd...
2 篇 department of co...
2 篇 school of manage...
2 篇 sharif universit...
2 篇 school of comput...
2 篇 lab. com. phys. ...
2 篇 natl univ def te...
2 篇 school of comput...

作者

4 篇 xicheng lu
4 篇 aaron harwood
4 篇 nong xiao
3 篇 shietung peng
3 篇 hong chen
3 篇 rui chu
3 篇 wenhong wei
3 篇 yongxuan lai
3 篇 huanguo zhang
3 篇 engelmann christ...
3 篇 gerald kunzmann
3 篇 wenjun xiao
2 篇 nandi asoke k.
2 篇 xing-ming li
2 篇 choi k.
2 篇 ling zhang
2 篇 wu cheng
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...

语言

620 篇 英文

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

共 620 条记录，以下是81-90 订阅

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

详细简洁

排序：

A comparative study of peer to peer dynamic load balancing on embedded topologies

A comparative study of peer to peer dynamic load balancing o...

引用

international conference on parallel and distributed computing and networks

作者： Akhtar, Muhammad Waseem Kechadi, M-Tahar Univ Coll Dublin Sch Comp Sci & Informat Dublin 4 Ireland

ISBN: (纸本)9780889866379

In this study we evaluate and compare the performance of our load balancing technique on irregular P2P systems embedded in two regular topologies: 1) Hypercube and 2) TreeP. Hypercube is one of the most studied interconnection topologies and exhibits powerful interconnection features, while TreeP is Tree-based P2P network architecture and is based on a tessellation of a 1-D space. The load balancing technique employed is a two step strategy. In the first phase, it maps any irregular network topology to a regular one. In the second phase the load is balanced among the nodes using PSLB algorithm. In this paper we study and compare the performance of this two-step strategy on hypercube and TreeP topologies. This strategy is proven to be efficient and does not introduce a considerable overhead as shown in the experimental results.

关键词： parallel computing systems dynamic load balancing P2P systems grid systems graph embedding

来源：评论

学校读者我要写书评

暂无评论

Automated dynamic redistribution of virtual operating systems under the xen virtual machine monitor

Automated dynamic redistribution of virtual operating system...

引用

international conference on parallel and distributed computing and networks

作者： Vachon, Travis F. Teresco, James D. Williams Coll Dept Comp Sci Williamstown MA 01267 USA

ISBN: (纸本)9780889866379

Operating system virtualization has recently become a popular technique to achieve better resource utilization in so-called '' server farm '' environments. This technique provides a virtual hardware interface on top of which one can run multiple instances of popular operating systems. The Xen Virtual Machine Monitor is an implementation of operating system virtualization that supports live migration, the transfer of a virtual operating system from one physical machine to another with minimal down time. We have utilized this capability to implement a monitoring and dynamic reconfiguration daemon that attempts to equalize the load on all host nodes in a group of machines running Xen. We have also implemented a simulator for testing balancing algorithms. Experiments using these tools have provided insight into the redistribution of virtualized operating systems and how this differs from the more thoroughly-studied problem of process-level load balancing.

关键词： parallel computing systems virtual operating systems dynamic load balancing

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of task graphs on parallel systems

Optimal scheduling of task graphs on parallel systems

引用

international conference on parallel and distributed computing and networks

作者： Sinnen, Oliver Kozlov, Alexci Vladimirovich Shahul, Ahmed Zaki Semar Univ Auckland Dept Elect & Comp Engn Private Bag 92019 Auckland New Zealand

ISBN: (纸本)9780889866379

Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hardness of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example for time critical systems or to evaluate scheduling heuristics. This paper proposes a scheduling algorithm based on A* that can produce optimal schedules in reasonable time for small task graphs. A* is a best-first state space search algorithm. In comparison to a previous approach, the here presented scheduling algorithm has a significantly reduced search space due to a much improved cost function f (s) and additional pruning techniques. Experimental results reveal the relation between the runtime of the algorithm and the structure of the task graphs. Further, it is shown that the proposed algorithm significantly outperforms the previous approach.

关键词： scheduling task graphs optimal schedules A

来源：评论

学校读者我要写书评

暂无评论

Optimising data movement rates for parallel processing applications on graphics processors

Optimising data movement rates for parallel processing appli...

引用

international conference on parallel and distributed computing and networks

作者： Harrison, Owen Waldron, John Trinity Coll Dublin Comp Architecture Grp Dublin 2 Ireland

ISBN: (纸本)9780889866379

Graphics processing units(GPUs) are starting to play an increasingly important role in non-graphical applications which are highly parallelisable. With the latest graphics cards boasting a theoretical 165GFlops and 54GB/s memory bandwidth spread across 48 ALUs it is easy to see why. The GPU architecture is particularly suited to the parallel stream processing paradigm of low levels of data dependency, high data to instruction ratio and predictable memory access patterns. One largely ignored, yet key, bottleneck for this type of processing on GPUs is both download and readback transfer performance to and from the graphics card. Existing tools provide great developer assistance in many areas of GPU application development, though provide very limited assistance in gaining the best bi-directional data transfer performance. In this paper, we discuss these limitations and present new investigative tools which allow general purpose processing GPU developers to explore the complex array of configuration states which affect both the download and readback performance.

关键词： parallel processing high performance computing graphics processors transfer rates

来源：评论

学校读者我要写书评

暂无评论

A high collusion-resistant approach to distributed privacy-preserving data mining

A high collusion-resistant approach to distributed privacy-p...

引用

international conference on parallel and distributed computing and networks

作者： Urabe, Shintaro Wang, Jiahong Kodama, Eiichiro Takata, Toyoo Iwate Prefectural Univ Fac Software & Informat Sci 152-52 Sugo Takizawa Iwate 0200193 Japan

ISBN: (纸本)9780889866379

Data mining across different companies, organizations, online shops, or the likes is necessary so as to discover valuable shared patterns, associations, trends, or dependencies in their shared data. Privacy, however, is a concern. In many situations it is required that data mining should be conducted without any privacy being violated. In response to this requirement, this paper proposes an effective distributed privacy-preserving data mining approach called CRDM (Collusion-Resistant Data Mining). CRDM is characterized by its ability to resist the collusion. Let the number of sites participating in data mining be M. Unless the number of colluding sites is not less than M - 1, privacy cannot be violated. Results of both analytical and experimental performance study demonstrated the effectiveness of CRDM.

关键词： data mining preserving privacy distributed processing collusion-resistance

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parallelism of double Divide and Conquer algorithm for singular value decomposition

Parallelism of double Divide and Conquer algorithm for singu...

引用

international conference on parallel and distributed computing and networks

作者： Konda, Taro Tsuboi, Hiroaki Takata, Masami IIwasaki, Masashi Nakamura, Yoshimasa Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Sakyo Ku Yoshida Honmachi Kyoto Japan Nara Womens Univ Grad Sch Humanity & Sci Nara Japan JST SORST Osaka Japan

ISBN: (纸本)9780889866379

This paper presents some numerical evaluations of parallel double Divide and Conquer for singular value decomposition. For eigenvalue decomposition and singular value decomposition, double Divide and Conquer was recently proposed. It rst computes eigen/singular values by a compact version of Divide and Conquer. The corresponding eigen/singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer are as good or even better than standard algorithms such as QR and the original Divide and Conquer. In addition, it is expected that double Divide and Conquer has great parallelism because each step is theoretically parallel and heavy communication is not required. This paper numerically evaluates a parallel implementation of dDC with MPI on some large scale problems using a distributed memory architecture and a massively parallel super computer, especially in terms of parallelism. It shows high scalability and super linear speed-up is observed in some cases.

关键词： parallel computing singular value decomposition eigenvalue decomposition numerical algorithm linear algebra

来源：评论

学校读者我要写书评

暂无评论

A distributed and multithreaded neural event driven simulation framework

A distributed and multithreaded neural event driven simulati...

引用

iasted international conference on parallel and distributed computing and networks

作者： Mouraud, A Paugam-Moisy, H Puzenat, D Inst Cognit Sci CNRS UMR 5015 67 Blvd Pinel F-69675 Lyon France Univ Antilles Guyane Lab GRIMAAG Guadeloupe France

ISBN: (纸本)088986568X

In a Spiking Neural networks (SNN), spike emissions are sparsely and irregularly distributed both in time and in the network architecture. Since a current feature of SNNs is a low average activity, efficient implementations of SNNs are usually based on an Event-Driven Simulation (EDS). On the other hand, simulations of large scale neural networks can take advantage of distributing the neurons on a set of processors (either workstation cluster or parallel computer). This article presents a large scale SNN simulation framework able to gather the benefits of EDS and parallel computing. Two levels of parallelism are combined: distributed mapping of the neural topology, at the network level, and local multithreaded allocation of resources for simultaneous processing of events, at the neuron level. Based on the causality of events, a distributed solution is proposed for solving the complex problem of scheduling without synchronization barrier.

关键词： Spiking Neural networks Event-Driven Simulations parallel computing multi-threading scheduling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Grid based neural network execution service

A Grid based neural network execution service

引用

iasted international conference on parallel and distributed computing and networks

作者： Krammer, L Schikuta, E Wanek, H Univ Vienna Dept Knowledge & Business Engn Rathausstr 19-4 A-1010 Vienna Austria

ISBN: (纸本)088986568X

Grid computing needs some application scenarios proved by operative implementations that should lead towards profitable real business applications. NeuroGrid represents the first step of a long way to connect the immense area of neural networks and its high potential applications to the fast emerging infrastructure possibilities of Grid computing. Based on the de-facto standard Grid middleware "Globus Toolkit" and the platform independent Java technology NeuroGrid demonstrates a proof-of-concept implementation for training and evaluating neural networks within a Grid environment.

关键词： Grid computing neural network simulator services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共62页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：