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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是321-330 订阅

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

详细简洁

排序：

Two-Level Result Caching for Web Search Queries on Structured P2P Networks

Two-Level Result Caching for Web Search Queries on Structure...

引用

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

作者： Rosas, Erika Hidalgo, Nicolas Marin, Mauricio Yahoo Labs Santiago Santiago Chile

ISBN: (纸本)9781467345651;9780769549033

this paper proposes a two-level caching strategy for Web search queries which is devised to operate on P2P networks. the aim is to significantly reduce query traffic going from a large community of users to commercial search engines by placing between them a P2P caching service capable of storing and efficiently distributing frequent queries among users. the proposed design takes into consideration the highly dynamic nature of user queries both in traffic intensity and drastic shifts in user interest which are both usually driven by unpredictable world-wide events. Each peer maintains a LRU result cache (RCache) used to keep the answers for queries originated in the peer itself and queries for which the peer is responsible for by contacting on-demand a Web search engine to get the query answers. When query traffic is predominantly routed to a few responsible peers our strategy replicates the role of "being responsible for" to neighboring peers so that they can absorb part of the traffic to restore load balance. this is a fairly slow and adaptive process that we call mid-term load balancing. To achieve a short-term fair distribution of queries we introduce in each peer a location cache (LCache) which keeps pointers to peers that have already requested the same queries in the very recent past. this lets these peers share their query answers with newly requesting peers. this process is fast as these popular queries are usually cached in the first DHT hop of a requesting peer which quickly tends to redistribute load among more and more peers. A comparative study shows that the proposed strategy achieves better load balance, significantly smaller communication volume among peers, and larger cache hit ratios than previous strategies.

关键词： Web Search Engines Caching Services Load Balancing P2P networks distributed Hash Tables

来源：评论

学校读者我要写书评

暂无评论

From Serial Loops to parallel Execution on distributed systems

引用

18th international conference on Euro-Par parallel Processing

作者： Bosilca, George Bouteiller, Aurelien Danalis, Anthony Herault, thomas Dongarra, Jack Univ Tennessee Knoxville TN 37996 USA

ISBN: (纸本)9783642328206

Programmability and performance portability are two major challenges in today's dynamic environment. Algorithm designers targeting efficient algorithms should focus on designing high-level algorithms exhibiting maximum parallelism, while relying on compilers and run-time systems to discover and exploit this parallelism, delivering sustainable performance on a variety of hardware. the compiler tool presented in this paper can analyze the data flow of serial codes with imperfectly nested, affine loop-nests and if statements, commonly found in scientific applications. this tool operates as the front-end compiler for the DAGuE run-time system by automatically converting serial codes into the symbolic representation of their data flow. We show how the compiler analyzes the data flow, and demonstrate that scientifically important, dense linear algebra operations can benefit from this analysis, and deliver high performance on large scale platforms.

关键词： compiler analysis symbolic data flow distributed computing task scheduling

来源：评论

学校读者我要写书评

暂无评论

An Implementation of parallel 1-D FFT on the K computer

An Implementation of Parallel 1-D FFT on the K computer

引用

14th IEEE international conference on High Performance computing and Communications (HPCC) / IEEE 9th international conference on Embedded Software and systems (ICESS)

作者： Takahashi, Daisuke Uno, Atsuya Yokokawa, Mitsuo Univ Tsukuba Fac Engn Tsukuba Ibaraki 3058573 Japan Next Generat Supercomp R&D Ctr Dev Grp Kobe Hyogo 6500047 Japan

ISBN: (纸本)9780769547497

In this paper, we propose an implementation of a parallel one-dimensional fast Fourier transform (FFT) on the K computer. the proposed algorithm is based on the six-step FFT algorithm, which can be altered into the recursive six-step FFT algorithm to reduce the number of cache misses. the recursive six-step FFT algorithm improves performance by utilizing the cache memory effectively. We use the recursive six-step FFT algorithm to implement the parallel one-dimensional FFT algorithm. the performance results of one-dimensional FFTs on the K computer are reported. We successfully achieved a performance of over 18 TFlops on 8192 nodes of the K computer (82944 nodes, 128 GFlops/node, 10.6 PFlops peak performance) for a 2(41)-point FFT.

关键词： Fast Fourier transform distributed-memory parallel computer all-to-all communication

来源：评论

学校读者我要写书评

暂无评论

distributed Subspace Projection in Wireless Sensor Networks using Computational Codes

Distributed Subspace Projection in Wireless Sensor Networks ...

引用

8th IEEE international conference on distributed computing in Sensor systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Insausti, Xabier Crespo, Pedro M. Beferull-Lozano, Baltasar Univ Navarra CEIT Paseo Manuel Lardizabal 13 Donostia San Sebastian 20018 Spain Univ Valencia IRTIC Valencia Spain

ISBN: (纸本)9780769547077

In this paper, we develop a new power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the Projection of an observed sampled spatial field on a subspace of lower dimension. this is an important problem that is motivated in various applications where there are well defined subspaces of interest (e. g. spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection assuming separation of channel coding and computation, our algorithm combines Computational Coding and a modification of existing Gossip Algorithms, achieving important savings in convergence time and yielding an exponential decrease in energy consumption as the size of the network increases.

关键词： Subspace energy consumption Cognitive radio Channel coding Gossip algorithms Distribute Codes

来源：评论

学校读者我要写书评

暂无评论

Simulation of a distributed flood control system using a parallel asynchronous solver for systems of ODEs

Simulation of a distributed flood control system using a par...

引用

20th iasted international conference on Applied Simulation and Modelling, ASM 2012

作者： Mantilla, Ricardo Cunha, Luciana K. Krajewski, Witold F. Small, Scott J. Jay, Laurent O. Fonley, Morgan Curtu, Rodica IIHR Hydroscience and Engineering University of Iowa Iowa City IA United States Department of Mathematics University of Iowa Iowa City IA United States

ISBN: (纸本)9780889869257

A recently developed parallel asynchronous solver for systems of ordinary differential equations (ODEs) is used to simulate flows along the channels in a river network. In our model, precipitation is applied over the hillslopes adjacent to the river network links and water movement from hillsope to link and along the river network is represented as a system of ODEs. the numerical solver is based on dense output Runge-Kutta methods that allow for asynchronous integration. A static partition method is used to distribute the workload among different processes, enabling a parallel implementation that capitalizes on a distributed memory system. Communication between processes is performed asynchronously. We illustrate the solver capabilities by integrating flow transport equations for a ∼32,000 km2 river basin subdivided into 574,000 sub-watersheds that are interconnected by the river network. We show that the runtime for an eight month-long simulation forced by 1-km resolution NEXRAD rainfall is completed in under 4 minutes using 64 computing nodes. In addition, we include equations to simulate small reservoirs spread throughout the river network and estimate changes in hydrographs at multiple locations. Our results provide a firm theoretical basis for the concept of distributed flood control systems.

关键词： Floods

来源：评论

学校读者我要写书评

暂无评论

DS-Means: distributed Data Stream Clustering

引用

18th international conference on Euro-Par parallel Processing

作者： Guerrieri, Alessio Montresor, Alberto Univ Trento Trento Italy

ISBN: (纸本)9783642328206

this paper proposes DS-means, a novel algorithm for clustering distributed data streams. Given a network of computing nodes, each of them receiving its share of a distributed data stream, our goal is to obtain a common clustering under the following restrictions (i) the number of clusters is not known in advance and (ii) nodes are not allowed to share single points of their datasets, but only aggregate information. A motivating example for DS-means is the decentralized detection of botnets, where a collection of independent ISPs may want to detect common threats, but are unwilling to share their precious users' data. In DS-means, nodes execute a distributed version of K-means on each chunk of data they receive to provide a compact representation of the data of the entire network. Later, X-means is executed on this representation to obtain an estimate of the number of clusters. A number of experiments on both synthetic and real-life datasets show that our algorithm is precise, efficient and robust.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

An O(log n) distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks

An <i>O</i>(<i>log n</i>) Distributed Approximation Algorith...

引用

8th IEEE international conference on distributed computing in Sensor systems (DCOSS)/IWSN/WiSARN/PWSN

作者： Yu, Dongxiao Hua, Qiang-Sheng Wang, Yuexuan Lau, Francis C. M. Univ Hong Kong Dept Comp Sci Pokfulam Rd Hong Kong Hong Kong Peoples R China Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing Peoples R China

ISBN: (纸本)9780769547077

the unstructured multi-hop radio network model, with asynchronous wake-up, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh characteristics of initially deployed wireless ad hoc and sensor networks. In this paper, assuming such a practical model, we study a fundamental problem of both theoretical and practical interests-the local broadcasting problem. Given a set of nodes V where each node wants to broadcast a message to all its neighbors that are within a certain local broadcasting range R, the problem is to schedule all these requests in the fewest timeslots. By adopting the physical interference model and without any knowledge on neighborhood, we give a new randomized distributed approximation algorithm for the local broadcasting problem with approximation ratio O(log n) where n is the number of nodes. this distributed approximation algorithm improves the state-of-the-art result in [22] by a logarithmic factor.

关键词： Approximation algorithms Wireless networks Network topology Distribute

来源：评论

学校读者我要写书评

暂无评论

DCOSS 2012 Foreword

DCOSS 2012 Foreword

引用

8th IEEE international conference on distributed computing in Sensor systems, DCOSS 2012

作者： Lu, Dongming Xu, Wenyuan Wang, Zhi Rabbat, Michael Zhejiang University China University of South Carolina United States McGill University Canada

ISBN: (纸本)9780769547077

the 8th IEEE international conference on distributed computing in Sensor systems (DCOSS 2012) is taking place in Hangzhou, China, from Wednesday, May 16, to Friday, May 18, 2012. Previous editions have taken place in Barcelona, Spain (2011), Santa Barbara, USA (2010), Los Angeles, USA (2009), Santorini Island, Greece (2008), Santa Fe, USA (2007), San Francisco, USA (2006), and Marina del Rey, USA (2005). We are pleased to present the conference program to you. this year, the DCOSS program features high-quality research presentations, two keynotes, and a poster and work-inprogress session. the conference program covers several aspects of distributed computing in sensor systems aligned with the three main tracks: algorithms and analysis, signal processing and information theory, and systems and applications. this year we received 100 submissions. Each submitted paper was reviewed by at least three Technical Program Committee experts, and ultimately a total of 34 papers were accepted. We will also feature three interesting workshops and one poster/demonstration/ work-in-progress session. We are proud to feature two excellent keynotes from leading experts on issues currently driving the distributed computing and sensor systems community. We hope that the technical program will provide a stimulating forum for researchers and practitioners throughout all three days. © 2012 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic distributed Scheduling Algorithm for State Space Search

引用

18th international conference on Euro-Par parallel Processing

作者： Narang, Ankur Srivastava, Abhinav Jain, Ramnik Shyamasundar, R. K. IBM India Res Lab New Delhi India Tata Inst Fundamental Res Bombay Maharashtra India

ISBN: (纸本)9783642328206

Petascale computing requires complex runtime systems that need to consider load balancing along with low time and message complexity for scheduling massive scale parallel computations. Simultaneous consideration of these objectives makes online distributed scheduling a very challenging problem. For state space search applications such as UTS, NQueens, Balanced Tree Search, SAT and others, the computations are highly irregular and data dependent. Here, prior scheduling approaches such as [16], [14], [7], HotSLAW 1101, which are dominantly locality-aware work-stealing driven, could lead to low parallel efficiency and scalability along with potentially high stack memory usage. In this paper we present a novel distributed scheduling algorithm (LDSS) for multi-placa parallel computations, that uses an unique combination of d-choice randomized remote (inter-place) spawns and topology-aware randomized remote work steals to reduce the overheads in the scheduler and dynamically maintain load balance across the compute nodes of the system. Our design was implemented using GASNet APfl and POSIX threads. For the UTS (Unbalanced Tree Search) benchmark (using upto 4096 nodes of Blue Gene/P), we deliver the best parallel efficiency (92%) for 295B node binomial tree, better than [16] (87%) and demonstrate super-linear speedup on 1 Trillion node (largest studied so far) geometric tree along with higher tree node processing rate. We also deliver upto 40% better performance than Charm++. Further, our memory utilization is lower compared to HotSLAW. Moreover, for NQueens (N = 18), we demonstrate superior parallel efficiency (92%) as compared Charm++ (85%).

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Influence of Network Communications to the Final Performance of Grid Visualization Software

Influence of Network Communications to the Final Performance...

引用

18th international conference on Information and Software Technologies

作者： Kaceniauskas, Arnas Pacevic, Ruslan Vilnius Gediminas Tech Univ Lab Parallel Comp LT-10223 Vilnius Lithuania

ISBN: (纸本)9783642333071

Influence of network communications to the final performance of grid visualization software VisPartDEM is investigated. distributed architecture of VisPartDEM is designed for interactive visualization of large particle systems simulated by the discrete element method on the gLite-based grid. Performance analysis of VisPartDEM is made on the geographically distributed gLite grid infrastructure. the attention is focused on the data transfer from storage elements, image transfer to clients and their contribution to the total benchmark time. the discussed issues are important for all researchers interactively visualizing results on gLite-based remote grid infrastructures.

关键词： network communications interactive grid visualization gLite middleware distributed visualization software VisPartDEM

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：