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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,925 篇 会议
282 篇 期刊文献
26 册 图书
1 篇 科技报告

馆藏范围

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

日期分布

学科分类号

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

主题

1,705 篇 concurrent compu...
1,583 篇 distributed comp...
1,152 篇 parallel process...
986 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
725 篇 grid computing
598 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
456 篇 resource managem...
428 篇 scalability
399 篇 costs
395 篇 bandwidth
394 篇 runtime
383 篇 parallel program...
367 篇 peer to peer com...
356 篇 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
20 篇 maciejewski anth...
19 篇 feng wu-chun
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
17 篇 panda dhabaleswa...
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 hai jin
14 篇 gopalakrishnan g...
14 篇 alexey lastovets...

语言

11,156 篇 英文
68 篇 其他
10 篇 中文

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

共 11234 条记录，以下是4231-4240 订阅

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

详细简洁

排序：

Different Approaches to distributed Compilation

Different Approaches to Distributed Compilation

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Josef Gattermayer Pavel Tvrdik Faculty of Information Technology Czech Technical University Prague Czech Republic

ISBN: (纸本)9781467309745

Source code compiling is a non-trivial task that requires many computing resources. As a software project grows, its build time increases and debugging on a single computer becomes more and more time consuming task. An obvious solution would be a dedicated cluster acting as a build farm, where developers can send their requests. But in most cases, this solution has a very low utilization of available computing resources which makes it very ineffective. Therefore, we have focused on non-dedicated clusters to perform distributed compilation, where we could use users' computers as nodes of a build farm. We compare two different approaches: distcc, which is an open-source program to distribute compilation of C/C++ code between several computers on a network and Clondike, which is a universal peer-to-peer cluster that is being developed at the Czech Technical University in Prague. A very complex task able to test deeply both systems is a compilation of a Linux Kernel with many config options. We have run this task on a cluster with up to 20 computers and have measured computing times and CPU loads. In this paper, we will present the results of this experiment that indicate the scalability and utilization of given resources in both systems. We also discuss the penalty of a generic solution over a task-specific one.

关键词： Servers Peer to peer computing Kernel Testing Linux Time measurement Computers

来源：评论

学校读者我要写书评

暂无评论

Minimalistic Adaptive Resource Management for Multi-tier Applications Hosted on Clouds

Minimalistic Adaptive Resource Management for Multi-tier App...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Waheed Iqbal Computer Science and Information Management Asian Institute of Technology Thailand

ISBN: (纸本)9781467309745

Cloud computing allows Web application owners to host their applications with low operational cost and enables them to scale applications to maintain performance based on traffic load and application resource requirements. However, for multi-tier Web applications, it is difficult to automatically identify the exact location of a bottleneck and scale the appropriate resource tier accordingly because multi-tier applications are complex and bottleneck patterns may be dependent on the specific pattern of workload at any given time. This Ph.D. dissertation aims to explore the possibilities to satisfy response time guarantees for multi-tier applications hosted on clouds using adaptive resource management with minimal hardware profiling and application-centric knowledge.

关键词： Resource management Time factors Cloud computing Monitoring Hardware USA Councils Machine learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive Version Clocks and the OffSync Protocol

Adaptive Version Clocks and the OffSync Protocol

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Christoph P. Neumann Andreas M. Wahl Richard Lenz Computer Science 6 (Data Management) Friedrich-Alexander-Universitat Erlangen-Nuremberg Erlangen Germany

The α-OffSync project offers a synchronization concept for α-Flow, an electronic process support in heterogeneous inter-institutional scenarios in healthcare. A distributed case file is provided by α-Flow to represent workflow schemas as documents which are shared coequally to content documents. α-OffSync allows the detection and resolution of global concurrent modification conflicts on process artifacts based on locally available information by using logical timestamps. Further mechanisms are included to ease the management and dynamic extension of the group of participating actors.

关键词： Peer to peer computing Synchronization Protocols Medical services Clocks Computer science Process control

来源：评论

学校读者我要写书评

暂无评论

A Graph Partitioning Approach to distributed RDF Stores

A Graph Partitioning Approach to Distributed RDF Stores

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Rui Wang Kenneth Chiu Computer Science Department State University of New york Binghamton Binghamton USA

With growing of Semantic Web data, especially RDF data, managing large RDF dataset on a single machine does not scale well. Previous work has explored how to distribute RDF triples to multiple machines. However due to inefficient dataset partitioning used by these solutions, the performance of distributed store system is significantly affected. In this paper, we proposed a promising approach that utilized the graph nature of RDF datasets to minimize relations between partitions after dataset partitioning, and optimized system design based on it. As shown in our experiments, our approach can effectively reduce communication cost of query-processing messages, balance size of partitions compared with other approaches, and enhance parallelism through independent sub-querying.

关键词： Resource description framework Peer to peer computing Indexes Resource management parallel processing Benchmark testing distributed databases

来源：评论

学校读者我要写书评

暂无评论

Hybrid Transactions: Lock Allocation and Assignment for Irrevocability

Hybrid Transactions: Lock Allocation and Assignment for Irre...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Jaswanth Sreeram Santosh Pande Intel Laboratories India College of Computing Georgia Institute of Technology USA

ISBN: (纸本)9781467309752

Irrevocable Software Memory Transactions provide a safe way to perform certain unrecoverable operations such as I/O or system calls inside transactions. In this paper we show that this notion of irrevocability has strong relevance and impact on the performance and throughput of a transactional program. In this paper we propose a compile-time analysis and transactional memory runtime system that allows several irrevocable transactions to execute concurrently with normal revocable transactions unlike state-of-the-art methods that allow for at most one irrevocable transaction at a time. Our approach uses a compile-time analysis to derive a fine-grained lock-assignment scheme using a precise context-sensitive data structure analysis that is able to identify disjoint logical data structures. We describe the prototype implementation of our system in the LLVM compiler and TL2 STM system and evaluate the parallel performance of our system on high-contention transactional programs in the STAMP suite.

关键词： Data structures Interference Synchronization Software Runtime Memory management Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Algebraic Block Multi-Color Ordering Method for parallel Multi-Threaded Sparse Triangular Solver in ICCG Method

Algebraic Block Multi-Color Ordering Method for Parallel Mul...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Takeshi Iwashita Hiroshi Nakashima Yasuhito Takahashi Academic Center for Computing and Media Studies Kyoto University Kyoto Japan Department of Electrical Engineering Doshisha University Kyoto Japan

This paper covers the multi-threaded parallel processing of a sparse triangular solver for a linear system with a sparse coefficient matrix, focusing on its application to a parallel ICCG solver. We propose algebraic block multi-color ordering, which is an enhanced version of block multi-color ordering for general unstructured analysis. We present blocking and coloring strategies that achieve a high cache hit ratio and fast convergence. Five numerical tests on a shared memory parallel computer verify that the computation time of the proposed method is between 1.7 and 2.6 times faster than that of the conventional multi-color ordering method.

关键词： Image color analysis Matrices Convergence Integrated circuits Color Sparse matrices parallel processing

来源：评论

学校读者我要写书评

暂无评论

High-Performance distributed Multi-Model / Multi-Kernel Simulations: A Case-Study in Jungle computing

High-Performance Distributed Multi-Model / Multi-Kernel Simu...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Niels Drost Jason Maassen Maarten A.J. van Meersbergen Henri E. Bal F. Inti Pelupessy Simon Portegies Zwart Michael Kliphuis Henk A. Dijkstra Frank J. Seinstra Department of Computer Science VU University Amsterdam Netherlands Leiden Observatory Leiden University Leiden Netherlands Institute for Marine and Atmospheric research Utrecht Department of Physics and Astronomy University of Utrecht Utrecht Netherlands

High-performance scientific applications require more and more compute power. The concurrent use of multiple distributed compute resources is vital for making scientific progress. The resulting distributed system, a so-called Jungle computing System, is both highly heterogeneous and hierarchical, potentially consisting of grids, clouds, stand-alone machines, clusters, desktop grids, mobile devices, and supercomputers, possibly with accelerators such as GPUs. One striking example of applications that can benefit greatly of Jungle computing Systems are Multi-Model / Multi-Kernel simulations. In these simulations, multiple models, possibly implemented using different techniques and programming models, are coupled into a single simulation of a physical system. Examples include the domain of computational astrophysics and climate modeling. In this paper we investigate the use of Jungle computing Systems for such Multi-Model / Multi-Kernel simulations. We make use of the software developed in the Ibis project, which addresses many of the problems faced when running applications on Jungle computing Systems. We create a prototype Jungle-aware version of AMUSE, an astrophysical simulation framework. We show preliminary experiments with the resulting system, using clusters, grids, stand-alone machines, and GPUs.

关键词： Computational modeling Atmospheric modeling Middleware Couplers Supercomputers Kernel

来源：评论

学校读者我要写书评

暂无评论

Asynchronous occlusion culling on heterogeneous PC clusters for distributed 3D scenes

Asynchronous occlusion culling on heterogeneous PC clusters ...

引用

8th international symposium on Visual computing, ISVC 2012

作者： Süß, Tim Koch, Clemens Jähn, Claudius Fischer, Matthias Meyer Auf Der Heide, Friedhelm Johannes Gutenberg-University Mainz Germany CC HPC - Fraunhofer ITWM Germany Heinz Nixdorf Institute University of Paderborn Germany

ISBN: (纸本)9783642331787

We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes' memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350 M polygons (≈ 8.5 GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time. © 2012 Springer-Verlag.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Task Scheduling in Large-scale distributed Systems Utilizing Partial Reconfigurable Processing Elements

Task Scheduling in Large-scale Distributed Systems Utilizing...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： M. Faisal Nadeem Imran Ashraf S. Arash Ostadzadeh Stephan Wong Koen Bertels Computer Engineering Laboratory Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Netherlands

Recent progress in processing speeds, network bandwidths, and middleware technologies have contributed towards novel computing platforms, ranging from large-scale computing clusters to globally distributed systems. Consequently, most current computing systems possess different types of heterogeneous processing resources. Entering into the peta-scale computing era and beyond, reconfigurable processing elements such as Field Programmable Gate Arrays (FPGAs), as well as forthcoming integrated hybrid computing cores, will play a leading role in the design of future distributed systems. Therefore, it is important to develop simulation tools to measure the performance of reconfigurable processors in the current and future distributed systems. In this paper, we propose the design of a simulation framework to investigate the performance of reconfigurable processors in distributed systems. The framework incorporates the partial reconfigurable functionality to the reconfigurable nodes. Depending on the available reconfigurable area, each node is able to execute more than one task simultaneously. Furthermore as a case study, we present a simple task scheduling algorithm to verify the functionality of the simulation framework. The proposed algorithm supports the scheduling of tasks on partially reconfigurable nodes. The simulation results are based on various experiments and they provide a comparison between full (one node-one task mapping) and partial (one node-multiple tasks mapping) configuration of the nodes, for the same set of parameters in each simulation run. Results suggest that the average wasted area per task is less as compared to the full configuration, verifying the functionality of the simulation framework.

关键词： Program processors Field programmable gate arrays Computational modeling Processor scheduling Dynamic scheduling Resource management

来源：评论

学校读者我要写书评

暂无评论

A Practical Privacy-preserving Password Authentication Scheme for Cloud computing

A Practical Privacy-preserving Password Authentication Schem...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Ali A. Yassin Hai Jin Ayad Ibrahim Weizhong Qiang Deqing Zou Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781467309745

An era of cloud computing allows users to profit from many privileges. However, there are several new security challenges. In fact, anonymous password authentication in the traditional setting has been suffered from many inherent drawbacks such as ease of exposure to malicious attacks and users registered their passwords in the server. Our scheme proposes the phenomenal context according to three main components: data owner, users, and service provider in cloud where users do not need to register their passwords in the service provider. Moreover, the data owner is contributed to make secure decisions, so that he manages the significant keys to other components distributedly. The proposal enjoys several advantages such as preserving privacy of password, unlink ability, and secrecy of session key. We have given a mechanism to prove the identity of the users authenticated without a need to reveal their passwords. Our approach has been achieved good results of reliability, and validity for cloud password authentication. The experimental results show an effective level of performance.

关键词： Authentication Servers Encryption Privacy Dictionaries Zinc

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 420 421 422 423 424 425 426 427 428 429 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：