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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,923 篇 会议
278 篇 期刊文献
24 册 图书
1 篇 科技报告

馆藏范围

11,226 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,462 篇 工学
- 5,203 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 883 篇 电气工程
- 569 篇 信息与通信工程
- 252 篇 控制科学与工程
- 221 篇 电子科学与技术（可...
- 137 篇 网络空间安全
- 91 篇 机械工程
- 60 篇 生物工程
- 58 篇 动力工程及工程热...
- 52 篇 生物医学工程（可授...
- 46 篇 环境科学与工程（可...
- 45 篇 仪器科学与技术
- 41 篇 安全科学与工程
- 40 篇 建筑学
- 40 篇 测绘科学与技术
- 34 篇 化学工程与技术
- 33 篇 土木工程
- 32 篇 交通运输工程
1,034 篇 理学
- 814 篇 数学
- 121 篇 系统科学
- 116 篇 统计学（可授理学、...
- 83 篇 物理学
- 70 篇 生物学
- 48 篇 化学
- 41 篇 地球物理学
988 篇 管理学
- 843 篇 管理科学与工程(可...
- 285 篇 工商管理
- 176 篇 图书情报与档案管...
57 篇 经济学
- 54 篇 应用经济学
36 篇 法学
26 篇 医学
21 篇 农学
9 篇 教育学
6 篇 文学
3 篇 艺术学
2 篇 军事学

主题

1,705 篇 concurrent compu...
1,582 篇 distributed comp...
1,151 篇 parallel process...
985 篇 computer science
950 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
719 篇 grid computing
596 篇 hardware
589 篇 high performance...
523 篇 processor schedu...
487 篇 computer network...
454 篇 resource managem...
428 篇 scalability
407 篇 costs
394 篇 runtime
394 篇 bandwidth
386 篇 parallel program...
366 篇 peer to peer com...
350 篇 delay

机构

47 篇 college of compu...
40 篇 institute of com...
30 篇 oak ridge natl l...
29 篇 ibm thomas j. wa...
25 篇 institute of com...
23 篇 inria
23 篇 oak ridge nation...
22 篇 school of comput...
21 篇 mathematics and ...
18 篇 argonne natl lab...
18 篇 department of co...
18 篇 department of co...
18 篇 tokyo institute ...
17 篇 department of co...
17 篇 georgia inst tec...
17 篇 iit dept comp sc...
16 篇 univ chinese aca...
16 篇 lawrence berkele...
16 篇 department of co...
15 篇 department of co...

作者

32 篇 dongarra jack
30 篇 jack dongarra
23 篇 p. sadayappan
21 篇 a. choudhary
21 篇 david a. bader
19 篇 feng wu-chun
19 篇 maciejewski anth...
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
18 篇 panda dhabaleswa...
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
16 篇 hai jin
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 casanova henri
14 篇 gopalakrishnan g...

语言

11,198 篇 英文
18 篇 其他
10 篇 中文

检索条件"任意字段=International Symposium on Parallel and Distributed Computing"

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

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

详细简洁

排序：

Round Compression for parallel Matching Algorithms 2018

Round Compression for Parallel Matching Algorithms

引用

50th Annual ACM SIGACT symposium on the Theory of computing (STOC)

作者： Czumaj, Artur Lacki, Jakub Madry, Aleksander Mitrovic, Slobodan Onak, Krzysztof Sankowski, Piotr Univ Warwick Coventry W Midlands England Google Res New York NY USA MIT 77 Massachusetts Ave Cambridge MA 02139 USA Ecole Polytech Fed Lausanne Lausanne Switzerland IBM Res Yorktown Hts NY USA Univ Warsaw Warsaw Poland

ISBN: (纸本)9781450355599

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture the nature of large-scale computation. In particular, compared to the classic distributed algorithms or PRAM models, these frameworks allow for much more local computation. The fundamental question that arises in this context is though: can we leverage this additional power to obtain even faster parallel algorithms? A prominent example here is the maximum matching problem-one of the most classic graph problems. It is well known that in the PRAM model one can compute a 2-approximate maximum matching in O(logn) rounds. However, the exact complexity of this problem in the MPC framework is still far from understood. Lattanzi et al. (SPAA 2011) showed that if each machine has n(1+Omega(1)) memory, this problem can also be solved 2-approximately in a constant number of rounds. These techniques, as well as the approaches developed in the follow up work, seem though to get stuck in a fundamental way at roughly O(logn) rounds once we enter the (at most) near-linear memory regime. It is thus entirely possible that in this regime, which captures in particular the case of sparse graph computations, the best MPC round complexity matches what one can already get in the PRAM model, without the need to take advantage of the extra local computation power. In this paper, we finally refute that possibility. That is, we break the above O(logn) round complexity bound even in the case of slightly sublinear memory per machine. In fact, our improvement here is almost exponential: we are able to deliver a (2+epsilon)-approximate maximum matching, for any fixed constant epsilon > 0, in O (log logn)(2)) rounds. To establish our result we need to deviate from the previous work in two important ways that are crucial for exploiting the power of t

关键词： maximum matching vertex partitioning round compression

来源：评论

学校读者我要写书评

暂无评论

Autonomic management of non-functional concerns in distributed & parallel application programming

Autonomic management of non-functional concerns in distribut...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Marco Aldinucci Marco Danelutto Peter Kilpatrick Department Computer Science University of Torino Torino Italy Department Computer Science University of Pisa Pisa Italy Department Computer Science Queen''s University Belfast Belfast UK

ISBN: (纸本)9781424437511

An approach to the management of non-functional concerns in massively parallel and/or distributed architectures that marries parallel programming patterns with autonomic computing is presented. The necessity and suitability of the adoption of autonomic techniques are evidenced. Issues arising in the implementation of autonomic managers taking care of multiple concerns and of coordination among hierarchies of such autonomic managers are discussed. Experimental results are presented that demonstrate the feasibility of the approach.

关键词： parallel programming Skeleton Clouds Environmental management Computer science Computer architecture Programming profession distributed computing Clustering algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fast, scalable parallel comparison sort on hybrid multicore architectures

Fast, scalable parallel comparison sort on hybrid multicore ...

引用

2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Banerjee, Dip Sankar Sakurikar, Parikshit Kothapalli, Kishore International Institute of Information Technology Hyderabad Gachibowli Hyderabad 500032 India

ISBN: (纸本)9780769549798

Sorting has been a topic of immense research value since the inception of Computer Science. Hybrid computing on multicore architectures involves computing simultaneously on a tightly coupled heterogeneous collection of devices. In this work, we consider a multicore CPU along with a many core GPU as our experimental hybrid platform. In this work, we present a hybrid comparison based sorting algorithm which utilizes a many-core GPU and a multi-core CPU to perform sorting. The algorithm is broadly based on splitting the input list according to a large number of splitters followed by creating independent sub lists. Sorting the independent sub lists results in sorting the entire original list. On a CPU+GPU platform consisting of an Intel i7 980 and an Nvidia GTX 580, our algorithm achieves a 20% gain over the current best known comparison sort result that was published by Davidson et. al. [In Par 2012]. On the above experimental platform, our results are better by 40% on average over a similar GPU-Alone algorithm proposed by Leischner et. al. [IPDPS 2010]. Our results also show that our algorithm and its implementation scale with the size of the input. We also show that such performance gains can be obtained on other hybrid CPU+GPU platforms. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Network and service management and diagnostics solution of a remote patient monitoring system

Network and service management and diagnostics solution of a...

引用

3rd IEEE international symposium on Logistics and Industrial Informatics, LINDI 2011

作者： Kozlovszky, Miklos Meixner, Zsolt Windisch, Gergely Márton, Judit Ács, Sándor Bogdanov, Pál Boruzs, Anikó Kotcauer, Péter Ferenczi, János Kozlovszky, Viktor MTA SZTAKI Laboratory of Parallel and Distributed Computing Budapest Hungary Óbuda University John von Neumann Faculty of Informatics Budapest Hungary

ISBN: (纸本)9781457718410

We have developed a combined network and service management and diagnostics solution for our in-house developed remote patient monitoring system. The developed system has included into the ALPHA eHealth/remote patient monitoring system and was successfully used in our large Living Lab infrastructure operating in three different Hungarian regions with 40 patients. In this paper we will identify the key elements of the combined Network and Service Management solution of the remote patient monitoring system. © 2011 IEEE.

关键词： Telemedicine

来源：评论

学校读者我要写书评

暂无评论

Improving the Separation of parallel Code in Skeletal Systems

Improving the Separation of Parallel Code in Skeletal System...

引用

international symposium on parallel and distributed computing

作者： Diogo Telmo Neves João Luís Sobral Departmento de Informática Universidade do Minho Portugal

ISBN: (纸本)9781424444106

This paper describes how to improve separation between domain-specific code and parallel code in skeletal systems. Traditionally, the code used to exploit parallelism is tangled among domain-specific code, which leads to problems such as: poor maintainability, lower flexibility, and weak scalability. In this paper we introduce the design of the YaSkel framework, which is a support tool to write parallel programs. We argue that the design of YaSkel framework allows more freedom to change the parallelization strategy when compared with traditional skeleton frameworks. To change the parallelization strategy we rely on DI - Dependency Injection - to inject a reference of a specific skeleton in latter development stages. We also show that AOP - Aspect Oriented Programming - could be used to minimize the impact of applying skeleton based approaches to legacy code.

关键词： Skeleton parallel processing parallel programming Application software distributed computing Scalability Productivity Multicore processing Hardware Programming profession

来源：评论

学校读者我要写书评

暂无评论

A Concept for Grid Credential Lifecycle Management and Heuristic Credential Abuse Detection

A Concept for Grid Credential Lifecycle Management and Heuri...

引用

international symposium on parallel and distributed computing

作者： Christopher Kunz Jan Wiebelitz Stefan Piger Christian Grimm Regional Computing Center of Lower Saxony Leibniz Universität Hannover Hanover Germany

ISBN: (纸本)9781424436880

In modern grids, authentication is usually implemented via an X.509 PKI (public key infrastructure). Proxy certificates are employed to facilitate interaction with the grid, especially for purposes of delegation and single sign-on. We propose modifications to the grid security infrastructure that allow reporting of proxy usage information to a database, giving the end user an opportunity to review by whom and for which purpose his credentials were used. By means of a standardized protocol for certificate revocation, they can then revoke affected proxies and stop abuse.

关键词： Authentication Grid computing Authorization distributed computing Middleware Concurrent computing Public key Data security Information security Databases

来源：评论

学校读者我要写书评

暂无评论

Template based structured collections

Template based structured collections

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： J. Nolte M. Sato Y. Ishikawa Real World Computing Partnership Tsukuba Ibaraki Japan

Collective operations on distributed data sets foster a high-level data-parallel programming style that eases many aspects of parallel programming significantly. In this paper we describe how higher-order collective operations on distributed object sets can be introduced in a structured way by means of reusable topology classes and C++ templates.

关键词： Electrical capacitance tomography Libraries parallel programming Yarn Identity-based encryption Programming profession Topology Concurrent computing Scattering

来源：评论

学校读者我要写书评

暂无评论

High performance grid computing - HPGC

High performance grid computing - HPGC

引用

international symposium on parallel and distributed Processing (IPDPS)

This workshop gives a forum to researchers and engineers to present their results in grid and distributed computing. Special areas of interest are grid middleware, grid applications, grid benchmarking, data distribution and replication on the grid, fault tolerance and efficiency of grid applications, novel models of grid computing, including cloud and mobile computing. Topics include: • Applications: Theory and practice of grid computing. Solution of large problems on grids. • Benchmarking: Evaluating performance of grid hardware and middleware. Grid benchmarking. • Infrastructure: Implementation and evaluation of grid middleware. • Data Grids: Use of grids for analysis of large data sets. • Management and Scheduling: Account management, resource monitoring • Scheduling: Resource allocation, application scheduling and containerization. • Networking: QoS for grid applications. Bandwidth management. • Partitioning and Load Balancing: Mapping data and applications on computational grids. • Programming Models: Methods for remote execution and intertask communications, including message passing and RPC.

关键词： Grid computing Middleware Resource management Processor scheduling distributed computing Computer network management Fault tolerance Mobile computing Cloud computing Hardware

来源：评论

学校读者我要写书评

暂无评论

18th international symposium on Computer Architecture and High Performance computing - Title

18th International Symposium on Computer Architecture and Hi...

引用

international symposium on Computer Architecture and High Performance computing (SBAC-PAD)

The following topics are dealt with: computer architecture; high performance computing; grid computing; cluster computing; processor microarchitecture; performance measurement; performance analysis; memory hierarchy architecture; parallel algorithms; distributed algorithms; parallel architectures; parallel interconnection networks; reconfigurable systems; and operating system support

关键词：

来源：评论

学校读者我要写书评

暂无评论

A comparison of MPI and process networks

A comparison of MPI and process networks

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： T.M. Parks Computer Science Department Colgate University Hamilton NY USA

The Message Passing Interface (MPI) is a popular communication library that supports the SIMD model of parallel computing. Process networks (PN), where processes communicate through first-in-first-out channels, support the MIMD model of parallel computing. Java implementations of both MPI and PN are available. We show that the communication primitives available in MPI, such as send/receive, scatter/gather, and broadcast can be emulated in PN. We present benchmark results comparing the performance of MPIJava and to own PN library.

关键词： Software libraries parallel processing Concurrent computing Message passing Java Broadcasting Scattering Computer science Signal processing Sonar

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：