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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,645 篇 会议
54 篇 期刊文献
12 册 图书

馆藏范围

1,711 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
85 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,636 篇 英文
71 篇 其他
4 篇 中文
1 篇 土耳其文

检索条件"任意字段=2nd International Symposium on Parallel and Distributed Processing and Applications"

共 1711 条记录，以下是891-900 订阅

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

详细简洁

排序：

Balancing parallel applications on Multi-core Processors Based on Cache Partitioning

Balancing Parallel Applications on Multi-core Processors Bas...

引用

IEEE international symposium on parallel and distributed processing with applications

作者： Suo, Guang Yang, Xue-jun Natl Univ Def Technol Sch Comp Parallel & Distribute Proc Lab Changsha Hunan Peoples R China

ISBN: (纸本)9780769537474

Load balancing is an important problem for parallel applications. Recently, many super computers are built on multi-core processors which are usually sharing the last level cache. On one hand different accesses from different cores conflict each other, on the other hand different cores have different work loads resulting in load unbalancing. In this paper, we present a novel technique for balancing parallel applications for multi-core processors based on cache partitioning which can allocate different part of shared caches to different cores exclusively. Our intuitive idea is partitioning shared cache to different cores based on their workloads. That is to say, a heavy load core will get more shared caches than a light load core, so the heavy load core runs faster. We give 2 algorithms in this paper, initial cache partitioning algorithm (ICP) and dynamical cache partitioning algorithm (DCP). ICP is used to determine the best partition when application starting while DCP is used to adjust the initial partition based on the changes of load balancing. Our experiment results show that the running time can be reduced by 7% on average when our load balancing mechanism based on cache partitioning is used.

关键词： Multi-core Processor Cache Partitioning Load Balancing Shared Cache

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2009 IEEE international symposium on parallel and distributed processing with applications, ISPA 2009

Proceedings - 2009 IEEE International Symposium on Parallel ...

引用

2009 IEEE international symposium on parallel and distributed processing with applications, ISPA 2009

ISBN: (纸本)9780769537474

The proceedings contain 106 papers. The topics discussed include: an efficient task allocation protocol for P2P multi-agent systems;bandwidth sensitive co-allocation scheme for parallel downloading in data grid;an adaptive resource monitoring method for distributed heterogeneous computing environment;a replacement algorithm designed for the web search engine and its application in storage cache;virtual machine resource management for high performance computing applications;supporting reconfigurable fault tolerance on application servers;security system for overlapping non-dedicated clusters;VoIP performance in multi-radio mobile devices;active attacks on reputable mix networks;a virtualized self-adaptive parallel programming framework for heterogeneous high productivity computers;generation of web knowledge flow for personalized services;and multi-source traffic data fusion method based on regulation and reliability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An irregular cutting based distributed mapping algorithm for DVE systems

An irregular cutting based distributed mapping algorithm for...

引用

2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial applications, PACIIA 2009

作者： Zhang, Wei Zhou, Hangjun Peng, Yuxing Li, Sikun Xi, Min National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Department of Computer Science Xi'an Jiaotong University Xi'an 710049 China

ISBN: (纸本)9781424446070

distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world integrity, the virtual environment should be divided into several parts and mapped to multiple servers, which are located in geographically different places. Many centralized algorithms based on regular cutting method are proposed to solve this problem. However, the dynamic property of clients and distributed property of the system make the existing algorithms unable to undertake it. In this paper, we propose a metric to measure the cutting quality and design a distributed mapping algorithm based on an irregular cutting. Simulation results show that our algorithm greatly decreases the costs of DVE systems for migration of clients and effectively improves the satisfaction degree of users. ©2009 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Peer-to-peer beyond file sharing: Where are P2P systems going?

Peer-to-peer beyond file sharing: Where are P2P systems goin...

引用

23rd IEEE international parallel and distributed processing symposium, IPDPS 2009

作者： Cigno, Renato Lo Pecorella, Tommaso Sereno, Matteo Veltri, Luca DISI Univ. of Trento Trento Italy DET Univ. of Firenze Firenze Italy DI Univ. of Torino Torino Italy DII Univ. of Parma Parma Italy

ISBN: (纸本)9781424437504

Are P2P systems and applications here to stay? Or are they a bright meteor whose destiny is to disappear soon? In this paper we try to give a positive answer to the first question, highlighting reasons why the P2P paradigm should become an integral part of computing and communication services and not only oddities for Cyber-geeks. © 2009 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Balancing TCP buffer vs parallel streams in application level throughput optimization

Balancing TCP buffer vs parallel streams in application leve...

引用

2nd international Workshop on Data-Aware distributed Computing, DADC 2009, Co-located with the ACM/IEEE international Conference on High Performance distributed Computing, HPDC 2009

作者： Yildirim, Esma Yin, Dengpan Kosar, Tevfik Department of Computer Science and CCT Louisiana State University Baton Rouge LA 70803 United States

ISBN: (纸本)9781605585895

The end-to-end performance of TCP over wide-area may be a major bottleneck for large-scale network-based applications. Two practical ways of increasing the TCP performance at the application layer is using multiple parallel streams and tuning the buffer size. Tuning the buffer size can lead to significant increase in the throughput of the application. However using multiple parallel streams generally gives better results than optimized buffer size with a single stream. parallel streams tend to recover from failures quicker and are more likely to steal bandwidth from the other streams sharing the network. Moreover our experiments show that proper usage of tuned buffer size with parallel streams can even increase the throughput more than the cases where only tuned buffers and only parallel streams are used. In that sense, balancing a tuned buffer size and the number of parallel streams and defining the optimal values for those parameters are very important. In this paper, we analyze the results of different techniques to balance TCP buffer and parallel streams at the same time and present the initial steps to a balanced modeling of throughput based on these optimized parameters. Copyright 2009 ACM.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

MUFIN: A Multi-Feature Indexing Network 09

MUFIN: A Multi-Feature Indexing Network

引用

2nd international Workshop on Similarity Search and applications

作者： Batko, Michal Dohnal, Vlastislav Novak, David Sedmidubsky, Jan Masaryk Univ Fac Informat Brno Czech Republic

ISBN: (纸本)9780769537658

It has become customary that practically any information can be in a digital form. However, searching for relevant information can be complicated because of: (1) the diversity of ways in which specific data can be sorted, compared, related, or classified, and (2) the exponentially increasing amount of digital data. Accordingly, a successful search engine should address problems of extensibility and scalability. The Multi-Feature Indexing Network (MUFIN) is a general purpose search engine that satisfies these requirements. The extensibility is ensured by adopting the metric space to model the similarity, so MUFIN can evaluate queries over a wide variety of data domains compared by metric distance functions. The scalability is achieved by utilizing the paradigm of structured peer-to-peer networks, where the computational workload of query execution is distributed over multiple independent peers which can work in parallel. We demonstrate these unique capabilities of MUFIN on a database of 100 million images indexed according to a combination of five MPEG-7 descriptors.

关键词： Indexing Shape Informatics Hardware Histograms Scalability Java Measurement standards Databases Data processing

来源：评论

学校读者我要写书评

暂无评论

Hierarchical clustering with CUDA/GPU 22

Hierarchical clustering with CUDA/GPU

引用

22nd international Conference on parallel and distributed Computing and Communication Systems, PDCCS 2009

作者： Chang, Dar-Jen Kantardzic, Mehmed Ouyang, Ming Computer Engineering & Computer Science Department University of Louisville LouisvilleKY40292 United States

ISBN: (纸本)9781615675777

Graphics processing units (GPUs) are powerful computational devices tailored towards the needs of the 3-D gaming industry for high-performance, real-time graphics engines. Nvidia Corporation provides a programming language called CUDA for general-purpose GPU programming. Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces;if there are n data points, it can be computed in O(n2) to O(n2 log n) sequential time, depending on the distance metrics employed. The present work explores parallel computation of hierarchical clustering with CUDA/GPU, and obtains an overall speed-up of up to 48 times over sequential computation with an Intel Pentium CPU. Copyright © (2009) by the international Society for Computers and Their applications. All rights reserved.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

CSA 2009 Welcome Message from IDCS 2009 Organization

CSA 2009 Welcome Message from IDCS 2009 Organization

引用

international symposium on Computer Science and its applications, CSA

Presents the welcome message from the conference proceedings.

关键词： Internet distributed computing IP networks Wireless sensor networks Grid computing parallel processing Personnel Discussion forums Conference proceedings Software libraries

来源：评论

学校读者我要写书评

暂无评论

Network awareness of P2P live streaming applications

Network awareness of P2P live streaming applications

引用

23rd IEEE international parallel and distributed processing symposium, IPDPS 2009

作者： Ciullo, Delia Garcia, Maria Antonieta Mellia, Marco Leonardi, Emilio Telek, Miklós Horváth, Ákos Veglia, Paolo Rossi, Dario Politecnico di Torino Italy Budapest University of Technology and Economics Hungary TELECOM-ParisTech France

ISBN: (纸本)9781424437504

Early P2P-TV systems have already attracted millions of users, and many new commercial solutions are entering this market. Little information is however available about how these systems work. In this paper we present large scale sets of experiments to compare three of the most successful P2P-TV systems, namely PPLive, SopCast and TVAnts. Our goal is to assess what level of "network awareness" has been embedded in the applications, i.e., what parameters mainly drive the peer selection and data exchange. By using a general framework that can be extended to other systems and metrics, we show that all applications largely base their choices on the peer bandwidth, i.e., they prefer high-bandwidth users, which is rather ***, TVAnts and PPLive exhibits also a preference to exchange data among peers in the same Autonomous System the peer belongs to. However, no evidence about preference versus peers in the same subnet or that are closer to the considered peer emerges. We believe that next-generation P2P live streaming applications definitively need to improve the level of network-awareness, so to better localize the traffic in the network and thus increase their network-friendliness as well. © 2009 IEEE.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

An Efficient Task Allocation Protocol for P2P Multi-Agent Systems

An Efficient Task Allocation Protocol for P2P Multi-Agent Sy...

引用

IEEE international symposium on parallel and distributed processing with applications

作者： Ye, Dayong Bai, Quan Zhang, Minjie Win, Khin Than Shen, Zhiqi Univ Wollongong Sch Comp Sci & Software Engn Wollongong NSW 2522 Australia Univ Wollongong Sch Informat Syst & Technol Wollongong NSW 2522 Australia Nanyang Technol Univ Coll Engn Sch Comp Engn Div Informat Syst Singapore 639798 Singapore

ISBN: (纸本)9780769537474

Recently, task allocation in multi-agent systems has been investigated by many researchers. Some researchers suggested to have a central controller which has a global view about the environment to allocate tasks. Although centralized control brings convenience during task allocation processes, it also has some obvious weaknesses. Firstly, a central controller plays an important role in a multi-agent system, but task allocation procedures will break down if the central controller of a system cannot work properly. Secondly, centralized multi-agent architecture is not suitable for distributed working environments. In order to overcome some limitations caused by centralized control, some researchers proposed distributed task allocation protocols. They supposed that each agent has a limited local view about its direct linked neighbors, and can allocate tasks to its neighbors. However, only involving direct linked neighbors could limit resource origins, so that the task allocation efficiency will be greatly reduced. In this paper, we propose an efficient task allocation protocol for P2P multi-agent systems. This protocol allows not only neighboring agents but also indirect linked agents in the system to help with a task if needed. Through this way, agents can achieve more efficient and robust task allocations in loosely coupled distributed environments (e.g. P2P multi-agent systems). A set of experiments are presented in this paper to evaluate the efficiency and adaptability of the protocol. The experiment result shows that the protocol can work efficiently in different situations.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 86 87 88 89 90 91 92 93 94 95 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：