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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,437 篇 会议
108 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,544 篇 英文
3 篇 其他
1 篇 中文

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

共 3548 条记录，以下是581-590 订阅

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

详细简洁

排序：

Schedulability analysis for distributed systems using network of action automata and environment automata

Schedulability analysis for distributed systems using networ...

引用

9th ieee International symposium on parallel and distributed processing with Applications, ISPA 2011

作者： Gui, Shenglin Luo, Lei Yu, Miao Xu, Jianhua Li, Yun School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China

ISBN: (纸本)9780769544281

Recently, several formal approaches have been presented to address the problem of schedulability analysis of real-time systems by some varieties of timed automata, e.g., UPPAAL and TIMES. In this paper, we consider a more general and complicated formal computational model for distributed systems. To analyze the schedulability of tasks within this model by automata theory, we present a model, action automata, which is a class of suspension automata, to describe the execution semantics of tasks;we also define an environment model, environment automata, to describe the arrival patterns of tasks. One main result gives the scheduling policies under which the schedulability can be analyzed by our method correctly. To achieve this result, we translate the schedulability analysis to the reachability analysis of the network of action automata and environment automata. Therefore, another main result of this paper is that we prove the reachability of action automata is decidable. Based on these conclusions, we implement a prototype tool for schedulability analysis and test its performance under EDF policy. © 2011 ieee.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Determining optimal update period for minimizing inconsistency in multi-server distributed virtual environments 11

Determining optimal update period for minimizing inconsisten...

引用

15th ieee/ACM International symposium on distributed Simulation and Real Time Applications, DS-RT 2011

作者： Li, Yusen Cai, Wentong Parallel and Distributed Computing Center Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9780769545530

The primary task of distributed virtual environments (DVEs) is to maintain a consistent view of the virtual world among all users. Multi-server architecture has been shown to have good scalability to support a large population of users in DVEs. However, some of the servers' resources like CPU, memory and network bandwidth can still get saturated as the scale of DVE increases. In this case, state updates cannot be disseminated timely and the consistency of the virtual world cannot be guaranteed. In this paper, we investigate how to efficiently use the limited resources for state update to minimize inconsistency in multi-server DVEs. Using time-space inconsistency metric, we firstly prove that periodic state update will result in minimal inconsistency for each replica. Then, in order to determine the optimal update periods for replicas to minimize the total time-space inconsistency of the DVE, we formulate the problem as a convex optimization problem with inequality constraints. Finally, an interior point method is adopted to solve the problem and the performance is evaluated using simulation results. © 2011 ieee.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Beyond traditional NLP: A distributed solution for optimizing chat processing - Automatic chat assessment using tagged latent semantic analysis

Beyond traditional NLP: A distributed solution for optimizin...

引用

2011 10th International symposium on parallel and distributed Computing, ISPDC 2011

作者： Dascalu, Mihai Dobre, Ciprian Trausan-Matu, Stefan Cristea, Valentin Computer Science Department Politehnica University of Bucharest Bucharest Romania

ISBN: (纸本)9780769545400

With the increasing popularity and evolution of Computer Supported Collaborative Learning systems, the need for developing a tool that automatically assesses instant messaging conversations has become imperative. The main reasons are the high volume of data and the increased amount of time spent for manually assessing conversations. We propose an automated analysis system based on Natural Language processing (centered on Latent Semantic Analysis and Social Network Analysis) and optimize its runtime performance by means of distributed computing. Moreover, we provide a unique grading mechanism based on a multilayered architecture and induce an increase of speedup by deploying a Replicated Worker architecture. Load balancing and fault tolerance represent key aspects of this approach, besides the actual increase in performance. © 2011 ieee.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Novel approach for finding optimization opportunities in multicore architectures

Novel approach for finding optimization opportunities in mul...

引用

9th ieee International symposium on parallel and distributed processing with Applications, ISPA 2011

作者： Lin, Ching-Chi Liu, Pangfeng Wu, Jan-Jan Institute of Information Science Academia Sinica Taipei Taiwan Dept. of CSIE Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan

ISBN: (纸本)9780769544281

Compiler techniques for program optimizations have been well studied for single-thread programs. With the advance of multi-core architectures, compiler optimizations for multi-threaded parallel programs have started to draw research attention in recent years. Optimizations for multi-threaded parallel programs on multi-core architectures are much more difficult because of the complicated interaction and resource competition between threads. Therefore, identifying the appropriate code segments for performing optimization becomes one of the most challenging issues. In this work, we propose a novel technique to identify the code segments that exhibit unstable performance behavior and show that by applying appropriate optimizations to such code segments, the performance of the parallel program can be improved. Our technique is based on a simple and efficient sampling method that analyzes variations in the performance variance of basic blocks to classify basic blocks into "stable" and "unstable" ones. "Stable" basic blocks have low average coefficient of variation(CoV) while "unstable" ones have CoV higher than a threshold value. Such analysis results can be used to determine the "unstable" code segments that may benefit from runtime optimizations. Our experiment results on the SPEC OMP2001 benchmark suite demonstrate that the proposed method is effective in finding "unstable" code segments. © 2011 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

LACIO: A new collective I/O strategy for parallel I/O systems

LACIO: A new collective I/O strategy for parallel I/O system...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Chen, Yong Sun, Xian-He Thakur, Rajeev Roth, Philip C. Gropp, William D. Department of Computer Science Texas Tech. University Lubbock TX United States Department of Computer Science Illinois Institute of Technology Chicago IL United States Mathematics and Computer Science Division Argonne National Laboratory Argonne IL United States Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN United States Department of Computer Science University of Illinois Urbana-Champaign Urbana IL United States

ISBN: (纸本)9780769543857

parallel applications benefit considerably from the rapid advance of processor architectures and the available massive computational capability, but their performance suffers from large latency of I/O accesses. The poor I/O performance has been attributed as a critical cause of the low sustained performance of parallel systems. Collective I/O is widely considered a critical solution that exploits the correlation among I/O accesses from multiple processes of a parallel application and optimizes the I/O performance. However, the conventional collective I/O strategy makes the optimization decision based on the logical file layout to avoid multiple file system calls and does not take the physical data layout into consideration. On the other hand, the physical data layout in fact decides the actual I/O access locality and concurrency. In this study, we propose a new collective I/O strategy that is aware of the underlying physical data layout. We confirm that the new Layout-Aware Collective I/O (LACIO) improves the performance of current parallel I/O systems effectively with the help of noncontiguous file system calls. It holds promise in improving the I/O performance for parallel systems. © 2011 ieee.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

The evaluation of an effective out-of-core run-time system in the context of parallel mesh generation

The evaluation of an effective out-of-core run-time system i...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Kot, Andriy Chernikov, Andrey N. Chrisochoides, Nikos P. Computer Science Department College of William and Mary Williamsburg VA United States Computer Science Department Old Dominion University Norfolk VA United States

ISBN: (纸本)9780769543857

We present an out-of-core run-time system that supports effective parallel computation of large irregular and adaptive problems, in particular unstructured mesh generation (PUMG). PUMG is a highly challenging application due to intensive memory accesses, unpredictable communication patterns, and variable and irregular data dependencies reflecting the unstructured spatial connectivity of mesh elements. Our runtime system allows to transform the footprint of parallel applications from wide and shallow into narrow and deep by extending the memory utilization to the out-of-core level. It simplifies and streamlines the development of otherwise highly time consuming out-of-core applications as well as the converting of existing applications. It utilizes disk, network and memory hierarchy to achieve high utilization of computing resources without sacrificing performance with PUMG. The runtime system combines different programming paradigms: multi-threading within the nodes using industrial strength software framework, one-sided active messages among the nodes, and an out-of-core subsystem for managing large datasets. We performed an evaluation on traditional parallel platforms to stress test all layers of the run-time system using three different PUMG methods with significantly varying communication and synchronization patterns. We demonstrated high overlap in computation, communication, and disk I/O which results in good performance when computing large out-of-core problems. The runtime system adds very small overhead (up to 18% on most configurations) when computing in-core which means performance is not compromised. © 2011 ieee.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Fast community detection algorithm with GPUs and multicore architectures

Fast community detection algorithm with GPUs and multicore a...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Soman, Jyothish Narang, Ankur IBM Research India New Delhi India

ISBN: (纸本)9780769543857

In this paper, we present the design of a novel scalable parallel algorithm for community detection optimized for multi-core and GPU architectures. Our algorithm is based on label propagation, which works solely on local information, thus giving it the scalability advantage over conventional approaches. We also show that weighted label propagation can overcome typical quality issues in communities detected with label propagation. Experimental results on well known massive scale graphs such as Wikipedia (100M edges) and also on RMAT graphs with 10M - 40M edges, demonstrate the superior performance and scalability of our algorithm compared to the well known approaches for community detection. On the hep-th graph (352K edges) and the wikipedia graph (100M edges), using Power 6 architecture with 32 cores, our algorithm achieves one to two orders of magnitude better performance compared to the best known prior results on parallel architectures with similar number of CPUs. Further, our GPGPU based algorithm achieves 8x improvement over the Power 6 performance on 40M edge R-MAT graph. Alongside, we achieve high quality (modularity) of communities detected, with experimental evidence from well-known graphs such as Zachary karate club, Dolphin network and Football club, where we achieve modularity that is close to the best known alternatives. To the best of our knowledge these are best known results for community detection on massive graphs (100M edges) in terms of performance and also quality vs. performance trade-off. This is also a unique work on community detection on GPGPUs with scalable performance. © 2011 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Communication optimizations for distributed-memory X10 programs

Communication optimizations for distributed-memory X10 progr...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Barik, Rajkishore Zhao, Jisheng Grove, David Peshansky, Igor Budimlić, Zoran Sarkar, Vivek Intel Corporation Santa Clara CA United States Rice University Houston TX United States IBM T.J Watson Research Center NY United States

ISBN: (纸本)9780769543857

X10 is a new object-oriented PGAS (Partitioned Global Address Space) programming language with support for distributed asynchronous dynamic parallelism that goes beyond past SPMD message-passing models such as MPI and SPMD PGAS models such as UPC and Co-Array Fortran. The concurrency constructs in X10 make it possible to express complex computation and communication structures with higher productivity than other distributed-memory programming models. However, this productivity often comes at the cost of high performance overhead when the language is used in its full generality. This paper introduces high-level compiler optimizations and transformations to reduce communication and synchronization overheads in distributed-memory implementations of X10 programs. Specifically, we focus on locality optimizations such as scalar replacement and task localization, combined with supporting transformations such as loop distribution, scalar expansion, loop tiling, and loop splitting. We have completed a prototype implementation of these high-level optimizations, and performed a performance evaluation that shows significant improvements in performance, scalability, communication volume and number of tasks. We evaluated the communication optimizations on three platforms: a 128-node Blue Gene/P cluster, a 32-node Nehalem cluster, and a 16-node Power7 cluster. On the Blue Gene/P cluster, we observed a maximum performance improvement of 31.46x relative to the unoptimized case (for the MolDyn benchmark). On the Nehalem cluster, we observed a maximum performance improvement of 3.01x (for the NQueens benchmark) and on the Power7 cluster, we observed a maximum performance improvement of 2.73x (for the MolDyn benchmark). In addition, there was no case in which the optimized code was slower than the unoptimized case. We also believe that the optimizations presented in this paper will be necessary for any high-productivity PGAS language based on modern object-oriented principles, that is

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

parallel biomedical image processing with GPGPUs in cancer research

Parallel biomedical image processing with GPGPUs in cancer r...

引用

3rd ieee International symposium on Logistics and Industrial Informatics, LINDI 2011

作者： Reményi, Attila Szénási, Sándor Bándi, István Vámossy, Zoltán Valcz, Gábor Bogdanov, Pál Sergyán, Szabolcs Kozlovszky, Miklos Óbuda University John von Neumann Faculty of Informatics Budapest Hungary Semmelweiss University 2nd Department of Internal Medicine Budapest Hungary MTA SZTAKI/Laboratory of Parallel and Distributed Computing Budapest Hungary

ISBN: (纸本)9781457718410

The main aim of this work is to show, how GPGPUs can facilitate certain type of image processing methods. The software used in this paper is used to detect special tissue part, the nuclei on (HE - hematoxilin eosin) stained colon tissue sample images. Since pathologists are working with large number of high resolution images - thus require significant storage space -, one feasible way to achieve reasonable processing time is the usage of GPGPUs. The CUDA software development kit was used to develop processing algorithms to NVIDIA type GPUs. Our work focuses on how to achieve better performance with coalesced global memory access when working with three-channel RGB tissue images, and how to use the on-die shared memory efficiently. © 2011 ieee.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

distributed computer emulation: Using OpenCL framework

Distributed computer emulation: Using OpenCL framework

引用

9th ieee International symposium on Applied Machine Intelligence and Informatics, SAMI 2011

作者： Jakubčo, Peter Ádám, Norbert Danková, Eva Department of Computers and Informatics Faculty of Electrical Engineering and Informatics Technical University of Košice Letná 9 042 00 Košice Slovakia

ISBN: (纸本)9781424474301

The idea of distributed computer emulation is presented within this paper. Since classic emulation techniques put the power load on the host CPU only, the new approach tries to distribute the load among other available processors within the host platform. The implementation uses OpenCL framework. This standard allows writing high parallel and portable programs in ISO C99 subset language, runnable on heterogeneous platforms that include variety of CPU, GPU or other processors. The aim is to present key concepts and ideas about the implementation of an emulator imitating any of the Flynn's computers. © 2011 ieee.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 55 56 57 58 59 60 61 62 63 64 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：