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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,983 篇 电气工程
- 1,384 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 536 篇 控制科学与工程
- 229 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 62 篇 安全科学与工程
1,974 篇 理学
- 1,506 篇 数学
- 245 篇 物理学
- 204 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,464 篇 管理学
- 1,206 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

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

共 16627 条记录，以下是4951-4960 订阅

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

详细简洁

排序：

Network partitioning of data parallel computations

Network partitioning of data parallel computations

引用

Proceedings of the 3rd ieee international symposium on High Performance distributed Computing

作者： Weissman, Jon B. Grimshaw, Andrew S. Univ of Virginia Charlottesville United States

Partitioning data parallel computations across a network of heterogeneous workstations is a difficult problem for the user. We have developed a runtime partitioning method for choosing the number and type of processors to apply to a data parallel computation, and a decomposition of the data domain in order to achieve reduced completion time. The partitioning method utilizes information about the problem in the form of callback functions and uses a set of topology-specific communication functions to estimate communication costs. We show that the method makes effective partitioning decisions and has runtime overhead that is easily tolerated. In particular, we show that for two implementations of a canonical stencil application, minimum elapsed times are obtained for a range of problem sizes on a network of heterogeneous workstations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A Region-Based Approach to Pipeline parallelism in Java Programs on Multicores 25

A Region-Based Approach to Pipeline Parallelism in Java Prog...

引用

25th Euromicro international Conference on parallel, distributed and Network-Based processing (PDP)

作者： Wang, Yang Kent, Kenneth B. Chinese Acad Sci Shenzhen Inst Adv Technol Beijing Peoples R China Univ New Brunswick Fac Comp Sci CAS Atlantic Fredericton NB Canada

ISBN: (纸本)9781509060580

As multicore architectures dominate mainstream computing platforms, migrating legacy applications into their parallel representation becomes a viable approach to reaping the benefits of multicore computing. In this paper we present a dataflow analysis tool that assists programmers to exploit the coarse-grained pipeline parallelism in stream-like Java applications on multicores. With this tool, programmers can partition a source Java program into a set of regions, which as pipeline stages, are connected via data channels to execute on multicores. To this end, we propose a simple yet effective framework that leverages JVMTI (JVM Tool Interface) and Javaagent techniques to track the data communication patterns among different regions, whereby a stream graph of the program is constructed. The graph is further used by the framework and programmers to re-factor the Java application into a pipelined program so that the potential of the multicores can be fully utilized. This procedure can be repeated in several rounds to progressively improve the performance. By applying this tool to several selected benchmarks, we demonstrate the effectiveness of the approach in terms of the performance improvements of some stream-like Java applications.

关键词： Java Multicore processing Pipelines Pipeline processing Data communication Tuning

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of a parallel data redistribution component for TGrid 4th

引用

4th international symposium on parallel and distributed processing and applications

作者： Hunold, Sascha Rauber, Thomas Ruenger, Gudula Univ Bayreuth Dept Math & Phys D-95440 Bayreuth Germany Tech Univ Chemnitz Dept Comp Sci Chemnitz Germany

ISBN: (纸本)9783540680673

Data redistribution of parallel data representations has become an important factor of grid frameworks for scientific computing. Providing the developers with generalized interfaces for flexible parallel data redistribution is a major goal of this research. In this article we present the architecture and the implementation of the redistribution module of TGrid. TGrid is a grid-enabled runtime system for applications consisting of cooperating multiprocessor tasks (M-tasks). The data redistribution module enables TGrid components to transfer data structures to other components which may be located on the same local subnet or may be executed remotely. We show how the parallel data redistribution is designed to be flexible, extendible, scalable, and particularly easy-to-use. The article includes a detailed experimental analysis of the redistribution module by providing a comparison of throughputs which were measured for a large range of processors and for different interconnection networks.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Live demonstration : Efficient event-driven approach using synchrony processing for hardware spiking neural networks

Live demonstration : Efficient event-driven approach using s...

引用

ieee international symposium on Circuits and Systems (ISCAS)

作者： Seguin-Godin, Guillaume Mailhot, Frederic Rouat, Jean Univ Sherbrooke Dept Genie Elect & Genie Informat Quebec City PQ Canada

ISBN: (纸本)9781479983919

Recent neuromorphic applications now use spiking neural networks (SNNs) because of their improved computational power compared to previous generations of neural networks. Efficient simulation is essential when using this type of neuron since many events have to be handled on a large number of neurons within the network. In this demonstration, a hardware simulator for SNNs that has applications in image recognition is presented. This SNN uses synchrony processing for efficient event-driven simulation (SPEEDS) which allows parallel computations of synchronized events. SPEEDS differs from common event-driven approaches that serialize every event and can improve significantly the computational efficiency of a SNN simulator. The hardware SNN is implemented on a Xilinx Virtex-6 XC6VLX240T field-programmable gate array (FPGA) and can contain 131 072 neurons. It can process approximately 70 million spikes per second on a 4-bank architecture clocked at 100 MHz. The presentation explains how such a system can be used for image processing tasks like image segmentation, feature extraction and pattern matching to realize a recognition system that can detect several objects in a given image.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

On optimal hierarchical configuration of distributed systems on mesh and hypercube

On optimal hierarchical configuration of distributed systems...

引用

international parallel and distributed processing symposium, IPDPS 2003

作者： Wang, Dajin Cao, Jiannong Department of Computer Science Montclair State University Upper MontclairNJ07043 United States Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong

ISBN: (纸本)0769519261

This paper studies hierarchical configuration of distributed systems for achieving optimized system performance. A distributed system consists of a collection of local processes which are distributed over the network of processors and cooperate to perform some functions. An hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels, so as to coordinate the local computation/control activities to improve the overall system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. The optimization problem considered in this paper is concerned with finding an optimal hierarchical partition of the processors so that the total cost is minimal. The problem in its general form has been known to be NP-hard. Therefore, we just focus on distributed computing jobs which require collecting information from all processors. One example of such job is distributed monitoring. By limiting the levels of the hierarchy to 2, we study optimal hierarchical configurations for two popular interconnection networks: mesh and hypercube. Based on analytical results, partitioning algorithms are proposed which achieve optimal communication cost attributed to information collection. We also discuss heuristic schemes for multiple-level hierarchical partitions. Although this paper is presented in terms of distributed monitoring, the approaches can also be applied to other hierarchical control problems in distributed computing. © 2003 ieee.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Towards a High Level Approach for the Programming of Heterogeneous Clusters 45

Towards a High Level Approach for the Programming of Heterog...

引用

45th international Conference on parallel processing (ICPP)

作者： Vinas, Moises Fraguela, Basilio B. Andrade, Diego Doallo, Ramon Univ A Coruna Dept Elect & Sistemas La Coruna Spain

ISBN: (纸本)9781509028252

The programming of heterogeneous clusters is inherently complex, as these architectures require programmers to manage both distributed memory and computational units with a very different nature. Fortunately, there has been extensive research on the development of frameworks that raise the level of abstraction of cluster-based applications, thus enabling the use of programming models that are much more convenient that the traditional one based on message-passing. One of such proposals is the Hierarchically Tiled Array (HTA), a data type that represents globally distributed arrays on which it is possible to perform a wide range of data-parallel operations. In this paper we explore for the first time the development of heterogeneous applications for clusters using HTAs. In order to use a high level API also for the heterogenous parts of the application, we developed them using the Heterogeneous Programming Library (HPL), which operates on top of OpenCL but providing much better programmability. Our experiments show that this approach is a very attractive alternative, as it obtains large programmability benefits with respect to a traditional implementation based on MPI and OpenCL, while presenting average performance overheads just around 2%.

关键词： distributed computing heterogeneity data parallelism programming model libraries OpenCL

来源：评论

学校读者我要写书评

暂无评论

BDViewer - A Web-Based Big Data processing and Visualization Tool 42

BDViewer - A Web-Based Big Data Processing and Visualization...

引用

42nd Annual ieee-Computer-Society Computers, Software and applications (COMPSAC) Conference - Staying Smarter in a Smartening World

作者： Li, Yan Ma, Junming An, Bo Cao, Donggang Peking Univ Minist Educ Key Lab High Confidence Software Technol Beijing Peoples R China

ISBN: (纸本)9781538626672

The size of data sets being collected and analyzed in data science field is growing rapidly, making traditional big data processing solution prohibitively expensive. Especially when the data sets are too large, distributed techniques are inevitable even for simple embarrassing parallel jobs. However, distributed computing is still inaccessible to a large number of users. For example, many average users are still struggling with complex cluster management and configuration tools[24] even just for summing up a group of numbers in a large data file. In this paper, we present BDViewer, a web-based big data processing and visualizing tool. BDViewer uses JavaScript plugins to enable users to view, process and visualize their large data files just through a web browser. By just clicking a button, users can open a large data file online and view the file contents immediately no matter how large the file is. In the back-end, BDViewer is built on a virtual private cloud system. Users' operations in a web browser are converted into map-reduce jobs and MPI tasks that are executed on the cloud. At the end of this paper, some experiments are carried out, which demonstrate BDViewer's effectiveness and ease of use.

关键词： Big Data Data processing Data Visualization distributed Computing parallel Computing

来源：评论

学校读者我要写书评

暂无评论

A case for economy grid architecture for service oriented grid computing 15

A case for economy grid architecture for service oriented gr...

引用

15th international parallel and distributed processing symposium, IPDPS 2001

作者： Buyya, R. Abramson, D. Giddy, J. School of Computer Science and Software Engineering Monash University Caulfield Campus Melbourne Australia CRC for Enterprise Distributed Systems Technology Monash University Caulfield Campus Melbourne Australia

ISBN: (纸本)0769509908

Computational Grids are a promising platform for executing large-scale resource intensive applications. However, resource management and scheduling in the Grid environment is a complex undertaking as resources are (geographically) distributed, heterogeneous in nature, owned by different individuals or organizations with their own policies, have different access and cost models, and have dynamically varying loads and availability. This introduces a number of challenging issues such as site autonomy, heterogeneous interaction, policy extensibility, resource allocation or co-allocation, online control, scalability, transparency, resource brokering, and "computational economy". A number of Grid systems (such as Globus and Legion) have addressed many of these issues with exception of a computational economy. We argue that a computational economy is required in order to create a real world scalable Grid because it provides a mechanism for regulating the Grid resources demand and supply. It offers incentive for resource owners to be part of the Grid and encourages consumers to optimally utilize resources and balance timeframe and access costs. We propose a 'computational economy framework' that builds on the existing Grid middleware systems and offers an infrastructure for resource management and trading in the Grid environment. We discuss the usage economic models for resource trading in the Nimrod/G resource broker and present deadline and cost-based scheduling experimental results on the Grid. © 2001 ieee.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Efficient routing and message bounds for optimal parallel algorithms

Efficient routing and message bounds for optimal parallel al...

引用

Proceedings of the ieee 9th international parallel processing symposium

作者： Deng, Xiaotie Dymond, Patrick York Univ North York Canada

The cost of interprocessor communication has a substantial impact on execution time when implementating parallel algorithms on physical parallel computers. We study these implementation costs, examining the number of inter-processor messages, the cost of routing these messages on various architectures, and the number of communication phases. We provide an improved direct routing algorithm for realizing h-relations on crossbar networks. We also introduce a round-robin message-delivery algorithm which reduces the number of times a communication link is established between a pair of processors (by delivering all messages of that phase for the pair in order without interruption.) We summarize criteria sufficient for a parallel algorithm to be implemented optimally on several common networks. We also describe a log n-phase optimal parallel list-ranking algorithm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

SMR-X: Flexible parallel State Machine Replication for Cloud Computing 19

SMR-X: Flexible Parallel State Machine Replication for Cloud...

引用

19th Annual ieee/ACM international symposium on Cluster, Cloud, and Grid Computing (CCGRID)

作者： Zhou, Meng Wu, Weigang Chen, Zhiguang Xiao, Nong Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou Guangdong Peoples R China Guangdong Prov Key Lab Big Data Anal & Proc Guangzhou Guangdong Peoples R China Mo Key Lab Machine Intelligence & Adv Comp Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781728109121

State Machine Replication (SMR) is a fundamental fault tolerant technique for distributed systems. SMR traditionally requires sequential execution of commands at each replica node, so as to guarantee strong consistency among replicas. To achieve high performance at large scale cloud datacenters, SMR has been parallelized by employing multiple threads at each replica. In this paper, we propose SMR-X, a novel parallel SMR scheme, which realizes flexible mapping of commands for parallel executing at each replica. The mapping between clients' requests and work threads is dynamically adjusted according to the load level of work threads. Therefore, workloads of different threads can he well balanced and high system throughput can be achieved. The major challenge in our work lies in the inconsistency problem caused by dynamic changes in request-thread mapping. To cope with this, we design delicate mechanisms to synchronize mapping function, so that strong consistency among replicas can he guaranteed. The correctness of the proposed scheme is rigorously proved and its performance is evaluated via simulations. Simulation results show that SMR-X can achieve better load balance and lower access latency than existing parallel SMR schemes.

关键词： cloud computing data centers distributed systems parallel processing state machine replication

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：