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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

8,773 篇 会议
176 篇 期刊文献
13 册 图书

馆藏范围

8,962 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,788 篇 工学
- 4,279 篇 计算机科学与技术...
- 1,781 篇 软件工程
- 986 篇 电气工程
- 741 篇 信息与通信工程
- 301 篇 控制科学与工程
- 211 篇 电子科学与技术（可...
- 109 篇 生物医学工程（可授...
- 105 篇 生物工程
- 101 篇 机械工程
- 85 篇 仪器科学与技术
- 74 篇 动力工程及工程热...
- 69 篇 网络空间安全
- 58 篇 力学（可授工学、理...
- 44 篇 安全科学与工程
- 39 篇 材料科学与工程（可...
- 37 篇 交通运输工程
- 36 篇 环境科学与工程（可...
986 篇 理学
- 630 篇 数学
- 210 篇 物理学
- 123 篇 系统科学
- 117 篇 生物学
- 106 篇 统计学（可授理学、...
- 53 篇 化学
569 篇 管理学
- 425 篇 管理科学与工程(可...
- 186 篇 图书情报与档案管...
- 171 篇 工商管理
89 篇 医学
- 58 篇 临床医学
- 45 篇 基础医学(可授医学...
56 篇 法学
- 36 篇 社会学
45 篇 经济学
- 44 篇 应用经济学
22 篇 农学
17 篇 文学
16 篇 教育学
4 篇 军事学
3 篇 艺术学

主题

1,126 篇 distributed comp...
750 篇 concurrent compu...
595 篇 memory managemen...
565 篇 computational mo...
540 篇 computer archite...
470 篇 parallel process...
428 篇 cloud computing
371 篇 computer science
339 篇 random access me...
318 篇 scalability
297 篇 memory
295 篇 application soft...
268 篇 hardware
249 篇 bandwidth
245 篇 message passing
244 篇 servers
234 篇 costs
233 篇 resource managem...
222 篇 high performance...
220 篇 runtime

机构

26 篇 institute of com...
21 篇 university of ch...
17 篇 georgia inst tec...
14 篇 tsinghua univers...
14 篇 school of comput...
13 篇 oak ridge natl l...
13 篇 ohio state univ ...
11 篇 lawrence berkele...
11 篇 univ chinese aca...
11 篇 pacific northwes...
11 篇 the islamic univ...
10 篇 college of compu...
10 篇 ibm thomas j. wa...
10 篇 lawrence berkele...
10 篇 ohio state univ ...
10 篇 institute of inf...
10 篇 department of co...
10 篇 tsinghua univ pe...
10 篇 college of compu...
10 篇 intel corporatio...

作者

17 篇 p. banerjee
17 篇 hai jin
14 篇 liu jie
13 篇 li dongsheng
13 篇 jin hai
11 篇 a. choudhary
10 篇 dongarra jack
10 篇 p. sadayappan
10 篇 wang wei
9 篇 hoefler torsten
9 篇 dongsheng li
9 篇 liu yang
9 篇 dou yong
9 篇 lai zhiquan
9 篇 nong xiao
8 篇 beineke kevin
8 篇 zhiyi huang
8 篇 lumsdaine andrew
8 篇 mitsuhisa sato
8 篇 xicheng lu

语言

8,621 篇 英文
311 篇 其他
36 篇 中文
4 篇 俄文
1 篇 西班牙文
1 篇 葡萄牙文
1 篇 土耳其文

检索条件"任意字段=Distributed Memory Computing Conference"

共 8962 条记录，以下是4991-5000 订阅

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

详细简洁

排序：

Handling of inter-thread memory access dependencies for automatic binary-code parallelization

Handling of inter-thread memory access dependencies for auto...

引用

10th IASTED International conference on Parallel and distributed computing and Networks, PDCN 2011

作者： Ootsu, Kanemitsu Shiroto, Takashi Yokota, Takashi Baba, Takanobu Graduate School of Engineering Utsunomiya University 7-1-2 Yoto Utsunomiya Tochigi 321-8585 Japan

ISBN: (纸本)9780889868649

Now the multi-core processors are widely available everywhere, and the speedup with thread-level parallelization of sequential programs becomes quite important. In general, thread-level parallelization are performed using the source code of the target program, but the source code are not always available. In order to realize the parallelization of existing sequential programs without need of the source codes, we have developed the software system that can automatically parallelize the executable binary codes of the programs at thread level, with binary translation. For thread-level parallelization, it is necessary to correctly analyze the data dependencies of variables between threads. However, since the memory accesses for the reference of variables are performed by specifying the target addresses using the registers and the values of the registers are generally unknown until execution, it is not easy to identify the variables located on memory and to examine the data dependencies. This paper discusses the analysis for the data dependencies of variables located on memory and the thread-level parallel processing based on the analysis results, in our automatic thread-level parallelization system by binary translation. The binary-level variable analysis statically analyzes and identifies the variables on memory in order to examine the data dependencies between threads. This is the method for identifying the variable by comparing the calculation trees that represent the target addresses of variables. And the runtime inspection of memory access dependencies hardware guarantees the correct parallel execution for the parallelized binary code containing data dependencies that cannot statically determined.

关键词： Binary codes

来源：评论

学校读者我要写书评

暂无评论

Introducing a Novel Data Management Approach for distributed Large Scale Data Processing in Future Computer Clouds

Introducing a Novel Data Management Approach for Distributed...

引用

18th International conference on Neural Information Processing (ICONIP)

作者： Basirat, Amir H. Khan, Asad I. Monash Univ Clayton Sch IT Melbourne Vic 3004 Australia

ISBN: (纸本)9783642249570;9783642249587

Deployment of pattern recognition applications for large-scale data sets is an open issue that needs to be addressed. In this paper, an attempt is made to explore new methods of partitioning and distributing data, that is, resource virtualization in the cloud by fundamentally re-thinking the way in which future data management models will need to be developed on the Internet. The work presented here will incorporate content-addressable memory into Cloud data processing to entail a large number of loosely-coupled parallel operations resulting in vastly improved performance. Using a lightweight associative memory algorithm known as distributed Hierarchical Graph Neuron (DHGN), data retrieval/processing can be modeled as pattern recognition/matching problem, conducted across multiple records and data segments within a single-cycle, utilizing a parallel approach. The proposed model envisions a distributed data management scheme for large-scale data processing and database updating that is capable of providing scalable real-time recognition and processing with high accuracy while being able to maintain low computational cost in its function.

关键词： distributed Data Processing Neural Network Data Mining Associative computing Cloud computing

来源：评论

学校读者我要写书评

暂无评论

distributed Generalized Dynamic Barrier Synchronization

Distributed Generalized Dynamic Barrier Synchronization

引用

12th International conference on distributed computing and Networking

作者： Agarwal, Shivali Joshi, Saurabh Shyamasundar, Rudrapatna K. IBM Research India Indian Institute of Technology Kanpur India Tata Institute of Fundamental Research Mumbai India

ISBN: (纸本)9783642176784

Barrier synchronization is widely used in shared-memory parallel programs to synchronize between phases of data-parallel algorithms. With proliferation of many-core processors, barrier synchronization has been adapted for higher level language abstractions in new languages such as X10 wherein the processes participating in barrier synchronization are not known a priori, and the processes in distinct "places" don't share memory. Thus, the challenge here is to not only achieve barrier synchronization in a distributed setting without any centralized controller, but also to deal with dynamic nature of such a synchronization as processes are free to join and drop out at any synchronization phase. In this paper, we describe a solution for the generalized distributed barrier synchronization wherein processes can dynamically join or drop out of barrier synchronization;that is, participating processes are not known a priori. Using the policy of permitting a process to join only in the beginning of each phase, we arrive at a solution that ensures (i) Progress: a process executing phase k will enter phase k 1 unless it wants to drop out of synchronization (assuming the phase execution of the processes terminate), and (ii) Starvation Freedom: a new process that wants to join a phase synchronization group that has already started, does so in a finite number of phases. The above protocol is further generalized to multiple groups of processes (possibly non-disjoint) engaged in barrier synchronization.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2011 12th International conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2011

Proceedings - 2011 12th International Conference on Parallel...

引用

2011 12th International conference on Parallel and distributed computing, Applications and Technologies, PDCAT 2011

ISBN: (纸本)9780769545646

The proceedings contain 73 papers. The topics discussed include: guaranteed scheduling for (m,k)-firm deadline-constrained real-time tasks on multiprocessors;a distributed task migration scheme for mesh-based chip-multiprocessors;jMigBSP: object migration and asynchronous one-sided communication for BSP applications;a social network-based information dissemination scheme;XunleiProbe: a sensitive and accurate probing on a large-scale P2SP system;data flow error recovery with checkpointing and instruction-level fault tolerance;an experimental study on memory allocators in multicore and multithreaded applications;efficient hierarchical agglomerative clustering algorithms on GPU using data partitioning;the multidimensional scaling and barycentric coordinates based distributed localization in wireless sensor networks;fast estimation of Gaussian mixture model parameters on GPU using CUDA;and optimizing web browser on many-core architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive thread scheduling techniques for improving scalability of software transactional memory

Adaptive thread scheduling techniques for improving scalabil...

引用

10th IASTED International conference on Parallel and distributed computing and Networks, PDCN 2011

作者： Chan, Kinson Lam, King Tin Wang, Cho-Li Department of Computer Science University of Hong Kong Pokfulum Road Hong Kong Hong Kong

ISBN: (纸本)9780889868649

Software transactional memory (STM) enhances both ease-of-use and concurrency, and is considered state-of-the-art for parallel applications to scale on modern multi-core hardware. However, there are certain situations where STM performs even worse than traditional locks. Upon hotspots where most threads contend over a few pieces of shared data, going transactional will result in excessive conflicts and aborts that adversely degrade performance. We present a new design of adaptive thread scheduler that manages concurrency when the system is about entering and leaving hotspots. The scheduler controls the number of threads spawning new transactions according to the live commit throughput. We implemented two feedback-control policies called Throttle and Probe to realize this adaptive scheduling. Performance evaluation with the STAMP benchmarks shows that enabling Throttle and Probe obtain best-case speedups of 87.5% and 108.7% respectively.

关键词： Probes

来源：评论

学校读者我要写书评

暂无评论

Ranking Information in Networks

引用

4th International conference on Social computing, Behavioral-Cultural Modeling and Prediction

作者： Eliassi-Rad, Tina Henderson, Keith Rutgers State Univ Piscataway NJ 08855 USA Lawrence Livermore Natl Lab Livermore CA USA

ISBN: (纸本)9783642196553

Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would like to discover sets of authors with expertise in a wide range of disciplines. We present this ranking task as a Top-K problem;utilize fixed-memory heuristic search;and present performance of both the serial and distributed search algorithms on synthetic and real-world data sets.

关键词： Ranking social networks heuristic search distributed search

来源：评论

学校读者我要写书评

暂无评论

Type-Safe Updating for Modular WSN Software

Type-Safe Updating for Modular WSN Software

引用

7th IEEE International conference on distributed computing in Sensor Systems (DCOSS)

作者： Porter, Barry Roedig, Utz Coulson, Geoff Univ Lancaster Sch Comp & Commun Lancaster LA1 4YW England

ISBN: (纸本)9781457705137

Modular software, in which strongly-separated units of functionality can be independently added to and removed from a node's running software, offers a promising approach to effective dynamic software updating in Wireless Sensor Networks (WSNs). Modular software updating approaches offer high efficiency, in terms of both network costs and update installation at nodes, as well as low disruption, allowing existing software to continue to operate during updates. Existing approaches however critically lack safety, relying on weakly-typed event-based programming abstractions for inter-module interaction. This precludes compile-time or composition-time verification of interoperability between dynamically loaded modules and therefore presents major risks for future large-scale production-class deployments. In this paper we present Lorien: a component-based modular operating environment that employs interface-based inter-component interaction to support completely type-safe software composition, while still supporting high update efficiency and low disruption. Our approach also has very wide scope, allowing almost 90% of software to be remotely updated on common sensor platforms such as the TelosB. We compare Lorien against existing modular designs, finding that the safety properties of Lorien are offered with near equal efficiency.

关键词： Computer architecture Kernel Lorien modular operating environment Random access memory Runtime Safety Wireless sensor networks compile-time verification composition-time verification event-based programming abstraction formal verification interoperability

来源：评论

学校读者我要写书评

暂无评论

Parallel execution of distributed SVM using MPI (CoDLib)

Parallel execution of distributed SVM using MPI (CoDLib)

引用

2011 International conference on Information Technology and Multimedia: "Ubiquitous ICT for Sustainable and Green Living", ICIM 2011

作者： Salleh, Nur Shakirah Md. Suliman, Azizah Ahmad, Abdul Rahim Department of System and Networking Universiti Tenaga Nasional Kajang Malaysia

ISBN: (纸本)9781457709890

Support Vector Machine (SVM) is an efficient data mining approach for data classification. However, SVM algorithm requires very large memory requirement and computational time to deal with very large dataset. To reduce the computational time during the process of training the SVM, a combination of distributed and parallel computing method, CoDLib have been proposed. Instead of using a single machine for parallel computing, multiple machines in a cluster are used. Message Passing Interface (MPI) is used in the communication between machines in the cluster. The original dataset is split and distributed to the respective machines. Experiments results shows a great speed up on the training of the MNIST dataset where training time has been significantly reduced compared with standard LIBSVM without affecting the quality of the SVM. © 2011 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Efficient data service design for a SOA approach to scientific computing

Efficient data service design for a SOA approach to scientif...

引用

10th IASTED International conference on Parallel and distributed computing and Networks, PDCN 2011

作者： Mulerikkal, Jaison Paul Strazdins, Peter School of Computer Science Australian National University Canberra Australia

ISBN: (纸本)9780889868649

In recent years, the Service Oriented Architecture (SOA) has evolved itself into emerging technologies like cloud computing to give it more relevance. ANU-SOAM - a service oriented middleware - aims to provide convenient API, a unique data service extension and proper load-balancing techniques for high performance scientific computing. The data service extension offers both Common Data Service (CDS) and Local Data Service (LDS). CDS helps set data common to all service instances and to manipulate it using add, get, put, sync, etc. functions. The LDS allows consumer to partially replicate data among service instances to improve memory scalability. Comparable paradigms like MPI are mostly agnostic and non-responsive to heterogeneous conditions. The SOA approach enables ANU-SOAM to have load balancing techniques implemented with the help of a Resource Manager. Experiments using N Body Solver and Heat Transfer applications have shown that ANU-SOAM performs as good as most of its MPI counterparts, especially under heterogeneous conditions.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

OpenMP parallelization of the SCIARA Cellular Automata lava flow model: performance analysis on shared-memory computers

OpenMP parallelization of the SCIARA Cellular Automata lava ...

引用

International conference on Computational Science (ICCS) on the Ascent of Computational Excellence

作者： Oliverio, Marco Spataro, William D'Ambrosio, Donato Rongo, Rocco Spingola, Giuseppe Trunfio, Giuseppe A. Univ Calabria Dept Math I-87036 Arcavacata Di Rende Italy Univ Calabria Dept Earth Sci I-87036 Arcavacata Di Rende Italy Univ Sassari I-07100 Sassari Italy

Parallel computing represents a valid solution for reducing execution times in simulations of complex geological processes, such as lava flows, debris flows and, in general, of fluid-dynamic processes. In these cases, Cellular Automata (CA) models have proved to be effective when the behavior of the system to be modeled can be described in terms of local interactions among its constituent parts. Cellular Automata are parallel computing models, discrete in space and time;space is generally subdivided into cells of uniform size and the overall dynamics of the system emerges as the result of the simultaneous application, at discrete time steps, of proper local rules of evolution to each one of them. Due to their intrinsic parallelism, CA models are attractive since they are suitable to be effectively and naturally implemented on parallel computers achieving also high performance. In the recent past, CA models were efficiently executed on distributed memory architectures, such as Beowulf clusters and many-node Supercomputers, while fewer implementations are found regarding shared-memory computers, such as in multi-core machines. This paper shows performance results of the parallelization of a well-known CA model for simulating lava flows - the SCIARA model - in a shared memory environment, by means of OpenMP, an Application Programming Interface which supports multi-platform shared-memory parallel programming.

关键词： Parallelization Shared memory paradigm OpenMP Cellular Automata Lava flow modelling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 491 492 493 494 495 496 497 498 499 500 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：