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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

3,536 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3536 条记录，以下是371-380 订阅

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

详细简洁

排序：

Flying Edges: A High-Performance Scalable Isocontouring Algorithm 5

Flying Edges: A High-Performance Scalable Isocontouring Algo...

引用

ieee 5th symposium on Large Data Analysis and Visualization (LDAV)

作者： Schroeder, William Maynard, Rob Geveci, Berk Kitware Inc Clifton Pk NY 12065 USA

ISBN: (纸本)9781467385176

Isocontouring remains one of the most widely used visualization techniques. While a plethora of important contouring algorithms have been developed over the last few decades, many were created prior to the advent of ubiquitous parallel computing systems. With the emergence of large data and parallel architectures, a rethinking of isocontouring and other visualization algorithms is necessary to take full advantage of modern computing hardware. To this end we have developed a high-performance isocontouring algorithm for structured data that is designed to be inherently scalable. processing is performed completely independently along edges over multiple passes. this novel algorithm also employs computational trimming based on geometric reasoning to eliminate unnecessary computation, and removes the parallel bottleneck due to coincident point merging. As a result the algorithm performs well in serial or parallel execution, and supports heterogeneous parallel computation combining data parallel and shared memory approaches. Further it is capable of processing data too large to fit entirely inside GPU memory, does not suffer additional costs due to preprocessing and search structures, and is the fastest non-preprocessed isocontouring algorithm of which we are aware on shared memory, multicore systems. the software is currently available under a permissive, open source licence in the VTK visualization system.

关键词： I.3.1 [Computing Methodologies]: Computer Graphics ??? parallel processing I.3.5 [Computing Methodologies]: Computational Geometry and Object Modeling ??? Geometric algorithms Flying shared memory spatial reasoning algorithms parallel execution Scalability parallel processing (COMPUTERS) Plethora Serial Publications edges Computer hardware

来源：评论

学校读者我要写书评

暂无评论

Patternlets: A Teaching Tool for Introducing Students to parallel Design Patterns 29

Patternlets: A Teaching Tool for Introducing Students to Par...

引用

29th ieee International parallel and distributed processing symposium Workshops, IPDPSW 2015

作者： Adams, Joel C. Department of Computer Science Calvin College Grand RapidsMI United States

ISBN: (纸本)0769555101

thanks to the ubiquity of multicore processors, today's CS students must be introduced to parallel computing or they will be ill prepared as modern software developers. Professional developers of parallel software think in terms of parallel design patterns, which are markedly different from traditional (sequential) design patterns. It follows that the more we can teach students to think in terms of parallel patterns, the more their thinking will resemble that of parallel software professionals. In this paper, we present pattern lets - minimalist, scalable programs, each designed to introduce students to a particular parallel design pattern. the collection currently includes 33 MPI, Open MP, and Pthreads programs. We present assessment data that indicate the use of pattern lets in CS2 improved student mastery of parallel concepts. © 2015 ieee.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Streaming Ultra High Resolution Images to Large Tiled Display at Nearly Interactive Frame Rate with vl3 5

Streaming Ultra High Resolution Images to Large Tiled Displa...

引用

ieee 5th symposium on Large Data Analysis and Visualization (LDAV)

作者： Jiang, Jie Hereld, Mark Insley, Joseph Papka, Michael E. Rizzi, Silvio Uram, thomas Vishwanath, Venkatram Univ Illinois Chicago IL 60607 USA Argonne Natl Lab Argonne IL 60439 USA Northern Illinois Univ De Kalb IL USA

ISBN: (纸本)9781467385176

Visualization of large-scale simulations running on supercomputers requires ultra-high resolution images to capture important features in the data. In this work, we present a system for streaming ultra-high resolution images from a visualization cluster to a remote tiled display at nearly interactive frame rates. vl3, a modular framework for large scale data visualization and analysis, provides the backbone of our implementation. With this system we are able to stream over the network volume renderings of a 2048(3) voxel dataset at a resolution of 6144x3072 pixels with a frame rate of approximately 3.3 frames per second.

关键词： I.3.1 [Computing Methodologies]: Computer Graphics ??? Hardware Architecture: parallel processing I.3.2 [Computing Methodologies]: Computer Graphics ??? Graphics Systems: distributed/network graphic Frame Rate image resolution Streaming Resolving power supercomputer Visualization Interactive images pixel Frame High definition

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Co-Visualization for LAMMPS using vl3 5

Large-Scale Co-Visualization for LAMMPS using vl3

引用

ieee 5th symposium on Large Data Analysis and Visualization (LDAV)

作者： Rizzi, Silvio Hereld, Mark Insley, Joseph Papka, Michael E. Uram, thomas Vishwanath, Venkatram Argonne Natl Lab Argonne IL 60439 USA Northern Illinois Univ De Kalb IL USA

ISBN: (纸本)9781467385176

In this poster we propose to interconnect LAMMPS and vl3, our parallel framework for large-scale visualization and analysis. the goal is co-visualization and exploration at interactive frame rates of large-scale atomistic simulations. We describe the architecture of the proposed system, as well as a preliminary implementation that runs on GPU-based visualization clusters.

关键词： I.3.2 [Computing Methodologies]: Computer Graphics ??? Graphics Systems: distributed/network graphic Posters Visualization large sizes Frame Rate Exploration Building construction ARCHITECTURE

来源：评论

学校读者我要写书评

暂无评论

Randomized Renaming in Shared Memory Systems 29

Randomized Renaming in Shared Memory Systems

引用

29th ieee International parallel and distributed processing symposium (IPDPS)

作者： Berenbrink, Petra Brinkmann, Andre Elsaesser, Robert Friedetzky, Tom Nagel, Lars Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Johannes Gutenberg Univ Mainz Zentrum Datenverarbeitung D-55099 Mainz Germany Salzburg Univ Dept Comp Sci A-5020 Salzburg Austria Univ Durham Sch Engn & Comp Sci Durham DH1 3LE England

ISBN: (纸本)9781479986484

Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m. the problem is called tight if m = n, and loose if m > n. In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O(log n) steps per process. they also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = (1 + epsilon) . n and constant epsilon, they achieve a step complexity of O(log log n). In this paper we consider tight as well as loose renaming and introduce randomized algorithms that achieve their tasks with high probability. the model assumed is the asynchronous shared memory model against an adaptive adversary. Our algorithm for loose renaming maps n processes to a name space of size m = (1 + 2/(log n)(l)) . n = (1 + o(1)) . n performing O(l . (log log n)(2)) test-and-set operations. In the case of tight renaming, we present a protocol that assigns n processes to n names with step complexity O(log n), but without the overhead and impracticality of the AKS network. this algorithm utilizes modern hardware features in form of a counting device which is also described in the paper. this device may have the potential to speed up other distributed algorithms as well.

关键词： distributed Algorithms Renaming

来源：评论

学校读者我要写书评

暂无评论

Vispark: GPU-Accelerated distributed Visual Computing Using Spark 5

Vispark: GPU-Accelerated Distributed Visual Computing Using ...

引用

ieee 5th symposium on Large Data Analysis and Visualization (LDAV)

作者： Choi, Woohyuk Jeong, Won-Ki Ulsan Natl Inst Sci & Technol Sch Elect & Comp Engn Ulsan South Korea

ISBN: (纸本)9781467385176

With the growing need of big data processing in diverse application domains, MapReduce (e.g., Hadoop) becomes one of the standard computing paradigms for large-scale computing on a cluster system. Despite of its popularity, the current MapReduce framework suffers from inflexibility and inefficiency inherent from its programming model and system architecture. In order to address these problems, we propose Vispark, a novel extension of Spark for GPU-accelerated MapReduce processing on array-based scientific computing and image processing tasks. Vispark provides an easy-to-use, Python-like high-level language syntax and a novel data abstraction for MapReduce programming on a GPU cluster system. Vispark introduces a programming abstraction for accessing neighbor data in the mapper function, which greatly simplifies many image processing tasks using MapReduce by reducing memory footprints and bypassing the reduce stage. We demonstrate the performance of our prototype system on several visual computing tasks, such as image processing, and K-means clustering.

关键词： image processing task Data structures big data Programming Image processing Visualization

来源：评论

学校读者我要写书评

暂无评论

An in-depth study of next generation interface for emerging non-volatile memories

An in-depth study of next generation interface for emerging ...

引用

ieee Non-Volatile Memory Systems and Applications symposium (NVMSA)

作者： Wonil Choi Jie Zhang Shuwen Gao Jaesoo Lee Myoungsoo Jung Mahmut Kandemir Department of EECS The Pennsylvania State University School of Integrated Technology Yonsei Institute Convergence Technology Yonsei University Intel Corporation

ISBN: (纸本)9781509041374

Non-Volatile Memory Express (NVMe) is designed with the goal of unlocking the potential of low-latency, randomaccess, memory-based storage devices. Specifically, NVMe employs various rich communication and queuing mechanism that can ideally schedule four billion I/O instructions for a single storage device. To explore NVMe with assorted user scenarios, we model diverse interface-level design parameters such as PCI Express, NVMe protocol, and different rich queuing mechanisms by considering a wide spectrum of host-level system configurations. In this work, we also assemble a comprehensive memory stack with different types of emerging NVM technologies, which can give us detailed NVMe related statistics like I/O request lifespans and I/O thread-related parallelism. Our evaluation results reveal that, i) while NVMe handshaking is light-weight for flash memory that uses block-based accesses (Block NVM), it can impose tremendous overheads for memristor technology (DRAM-like NVM), ii) in contrast to the common expectation, the performance of an NVMe-equipped system may not improve in a scalable fashion as the queue depth and the number of queues increase, and iii) more- and deeperqueue systems atop a Block NVM can significantly suffer from tremendous host-side memory requirements, whereas a DRAMlike NVM can cause frequent system stalls due to NVMe's inefficient interrupt service routine.

关键词： Nonvolatile memory Protocols Bandwidth Registers Message systems Mathematical model parallel processing

来源：评论

学校读者我要写书评

暂无评论

parallel Computing of Electromagnetic Field Based on Domain Decomposition Method 5

Parallel Computing of Electromagnetic Field Based on Domain ...

引用

5th International Conference on Electric Utility Deregulation and Restructuring and Power Technologies (DRPT)

作者： Li, Tianwei Wu, Tian CSG Elect Power Res Inst Guangzhou Guangdong Peoples R China China Elect Power Res Inst Wuhan Peoples R China

ISBN: (纸本)9781467371063

the computing velocity and memory storage of Single PC are often limited in large-scale electromagnetic simulation by finite element method (FEM), parallel processing is an important means to overcome such problems. the domain decomposition method (DDM) which decomposes the domain by nodes dominating and suits for parallel computing was illustrated first in this paper;A 2D electrostatic model was built and decomposed by the DDM;And the FEM linear system of equations was solved by using parallel CG method on the distributed parallel system composed of 6 PCs, the effective speed up reaching 97.5% was satisfying. Especially for large-scale simulation which consists of more than millions of freedoms, the parallel processing reduces computing time and increases the computing velocity greatly, it's the base on which large-scale 3D electromagnetic parallel computing.

关键词： parallel Computing Electromagnetic Field Domain Decomposition Method FEM effective speed

来源：评论

学校读者我要写书评

暂无评论

parallelizing a Real-time Audio Application - A Case Study in Multithreaded Software Engineering 29

Parallelizing a Real-time Audio Application - A Case Study i...

引用

29th ieee International parallel and distributed processing symposium (IPDPS)

作者： Kiefer, Marc Aurel Molitorisz, Korbinian Bieler, Jochen Tichy, Walter F. Karlsruhe Inst Technol Inst Program Struct & Data Org IPD Fasanengarten 5 D-76131 Karlsruhe Germany

ISBN: (纸本)9781467376846

Multicore hardware is ubiquitous, but billions of lines of code in performance-critical commodity software are still sequential. Although parallel libraries, design patterns, and best practice guidelines are available, thinking parallel is still a big challenge for many software engineers. In this paper we present a case study on parallelizing commodity software using a commercial real-time audio application with over 700,000 lines of code. In contrast to best practice guidelines, our goal is to investigate what parallelization strategy can effectively be used in data stream-intensive applications. Performing an in-depth analysis of the software architecture and its run-time performance, we locate parallelization potential and propose three different parallelization strategies. We evaluate them with respect to their parallel performance impact. Regarding the application's intrinsic real-time requirement and a very short audio cycle turnaround time, a busy-waiting strategy offers the best audio performance of 327 mu s per cycle on an eight-core machine. With an efficiency of 99% this is close to the optimal schedule.

关键词： Software Engineering Multicore parallelization Study

来源：评论

学校读者我要写书评

暂无评论

Signature-Based Top-k Query processing against Data Replacement Attacks in MANETs 34

Signature-Based Top-k Query Processing against Data Replacem...

引用

SRDS 2015 34th symposium on Reliable distributed Systems

作者： Tsuda, Takuji Komai, Yuka Hara, Takahiro Nishio, Shojiro Osaka Univ Grad Sch Informat Sci & Technol Dept Multimedia Engn 1-5 Yamadaoka Suita Osaka 5650871 Japan

ISBN: (纸本)9781467393027

In this paper, we propose a signature-based top-k query processing method against data replacement attacks in mobile ad hoc networks (MANETs). In order to rapidly identify a greater number of malicious nodes, nodes share information about identified malicious nodes with other nodes. If nodes share only this information, however, malicious nodes may successfully transmit false information identifying normal nodes as malicious. therefore, in the proposed method, when nodes send reply messages during query processing, they attach encrypted information about the sent data items (i.e., digital signatures), providing the query-issuing node with critical information about the data items sent by nodes in the network, and thereby enabling it to identify malicious nodes, using the received signatures. After identifying the malicious nodes, it floods the network with a notification message including the signatures in which the identified malicious nodes have replaced higher-score data items to their own lower-score items.

关键词： MANET top-k query data replacement attack signature

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：