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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是4291-4300 订阅

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

详细简洁

排序：

Automatic Refinement of parallel Applications Structure Detection

Automatic Refinement of Parallel Applications Structure Dete...

引用

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

作者： Juan Gonzalez Kevin Huck Judit Gimenez Jesus Labarta Barcelona Supercomputing Center Universitat Politécnica de Catalunya-Barcelona Tech Barcelona Spain ParaTools Inc. Eugene OR USA

ISBN: (纸本)9781467309745

Analyzing parallel programs has become increasingly difficult due to the immense amount of information collected on large systems. In this scenario, cluster analysis has been proved to be a useful technique to reduce the amount of data to analyze. A good example is the use of the density-based cluster algorithm DBSCAN to identify similar single program multiple data (SPMD) computing phases in message-passing applications. This structure detection simplifies the analyst work as the whole information available is reduced to a small set of clusters. However, DBSCAN presents two major problems: it is very sensitive to its parametrization and is not capable of correctly detect clusters when the data set has different densities across the data space. In this paper, we introduce the Aggregative Cluster Refinement, an iterative algorithm that produces more accurate structure detections of SPMD phases than DBSCAN. In addition, it is able to detect clusters with different densities.

关键词： Clustering algorithms Algorithm design and analysis Manuals Radiation detectors Partitioning algorithms Hardware Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Cloud Services Gateway: A Tool for Exposing Private Services to the Public Cloud with Fine-grained Control

Cloud Services Gateway: A Tool for Exposing Private Services...

引用

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

作者： Srinath Perera Rajika Kumarasiri Supun Kamburugamuva Senaka Fernando Sanjiva Weerawarana Paul Fremantle WSO2 Inc. Colombo Sri Lanka

ISBN: (纸本)9781467309745

By enabling users to allocate computing resources on demand, cheaply, and in an elastic manner, Cloud computing has made large computation resources available to small and medium size organizations. However, using the Cloud requires users to place their computations, data, or both in a shared data center own by an outsider. This sharing has raised many security concerns. Such concerns are much apparent with use cases like health informatics, where the security of the information is critical and imposed by government regulations. We propose a hybrid approach to solve this problem, where only computations are moved to the public domains while keeping the data within the private network, and computations may access data through a set of services that expose data following the Principle of Least Privilege. Such architectures will, however, require computations in the cloud to connect to the local network that holds the data, and the obvious solution: that is opening up ports in the organizational firewall could potentially create security loopholes. As an alternative, we propose Cloud Services Gateway (CSG), which enable users to selectively expose their private services that reside inside a firewall to outside clients while maintaining fine grained control. This paper motivates hybrid Cloud architectures and presents the architecture and design decisions of Cloud Services Gateway.

关键词： Servers Cloud computing Logic gates Security Containers Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Research on Data parallel and Scheduling Mechanism based on Petri nets

Research on Data parallel and Scheduling Mechanism based on ...

引用

The Eleventh international symposium on distributed computing and Applications to Business,Engineering and Science(DCABES2012)(第十一届分布式计算及其应用国际学术研讨会)(原名:电子商务、工程及科学领域的分布式计算和应用国际学术研讨会)

作者： Jing Zhao Kun Yang Wanfeng Dou Xuejun Liu School of Computer Science and Technology Nanjing Normal University Nanjing China Nanjing Normal University Nanjing China Virtual Geographic Environment Key Laboratory of the Ministry of Education Nanjing China

There are two method frequently used for parallelization: data parallel and task *** to the characteristics of analysis of digital terrain,data parallel is more applied,so Petri nets is introduced in this paper to describe the parallel relationships within data patitions based on granularity *** for different storage environment,corresponding scheduling algorithms are proposed for load balance.

关键词： PDTA Petri nets data parallel dependent relation

来源：评论

学校读者我要写书评

暂无评论

Simplifying Hands-On Teaching of distributed Algorithms with SPLAY

Simplifying Hands-On Teaching of Distributed Algorithms with...

引用

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

作者： Etienne Rivière Institut dInformatique Universita de Neuchâtel Switzerland

ISBN: (纸本)9781467309745

Teaching distributed algorithms using a learning-by-doing approach is usually associated with a slow and cumbersome learning process for students. In order to test and evaluate even simple protocols, students need to learn how to set up and operate a test bed, and to write scripts for deploying, running their program and finally retrieving some logs for parsing and observation of the results. Moreover, the amount of code required in languages such as C# or Java for implementing even a simple protocol is often one order of magnitude more than the length of the protocol pseudo-code description as discussed in class or in research papers. Nevertheless, teaching distributed algorithms and protocols using real deployed code on real conditions is highly desirable and can not always be replaced by the use of simulators. We present in this paper our experience of using SPLAY, a distributed systems evaluation framework that greatly simplifies the work of both instructors and students for hands-on learning of distributed systems. SPLAY simplifies the writing, deployment and observation of distributed algorithms and the management of test environments, narrowing the complexity gap between pseudo-code descriptions and executable implementations. In addition, SPLAY's features and the focus kept on the algorithms and their evaluation, allow students to evaluate their protocols in a variety of conditions, by controlling the experiments and their running conditions, or by allowing running them on multiple test beds at no additional costs and with minimal administration complexity.

关键词： distributed algorithms Protocols Education Complexity theory Libraries Programming Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Performance Portability with the Chapel Language

Performance Portability with the Chapel Language

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Albert Sidelnik Saeed Maleki Bradford L. Chamberlain María J. Garzar'n David Padua Department of Computer Science University of Illinois at Urbana-Champaign Urbana Illinois USA Cray Inc. Seattle Washington USA

It has been widely shown that high-throughput computing architectures such as GPUs offer large performance gains compared with their traditional low-latency counterparts for many applications. The downside to these architectures is that the current programming models present numerous challenges to the programmer: lower-level languages, loss of portability across different architectures, explicit data movement, and challenges in performance optimization. This paper presents novel methods and compiler transformations that increase programmer productivity by enabling users of the language Chapel to provide a single code implementation that the compiler can then use to target not only conventional multiprocessors, but also high-throughput and hybrid machines. Rather than resorting to different parallel libraries or annotations for a given parallel platform, this work leverages a language that has been designed from first principles to address the challenge of programming for parallelism and locality. This also has the advantage of providing portability across different parallel architectures. Finally, this work presents experimental results from the Parboil benchmark suite which demonstrate that codes written in Chapel achieve performance comparable to the original versions implemented in CUDA on both GPUs and multicore platforms.

关键词： Graphics processing unit Arrays Multicore processing parallel processing Benchmark testing Reactive power

来源：评论

学校读者我要写书评

暂无评论

Research on parallel computing algorithm of the second harmonic generation coefficients of nonlinear optical crystals based on MPI

Research on parallel computing algorithm of the second harmo...

引用

作者： Rong Liu Meiqing Wang Yongfan Zhang College of Mathematics and Computer Science Fuzhou University College of Chemistry and Chemical Engineering Fuzhou University FuzhouFujian35000

The second harmonic generation(SHG)coefficients of nonlinear optical crystals play an important role in measuring the nonlinear optical properties of materials,but it is time-consuming to get the SHG coefficients by the theoretical *** this paper,we proposed two sorts of parallel computing schemes for the SHG coefficients based on Message Passing Interface(MPI).If the amount of nodes is small,we will choose the the master slave model and statically allocated tasks;on the other hand,we will select the work pool mode for large amount of nodes,which can prevent the main node to suffer bottlenecks and get a sufficient load *** experimental results show that with the master slave model,the efficiency reaches to 98%when using 4 nodes and declines with the nodes becoming large;while the work pool mode reaches the stable efficiency of 85%in the parallel computing with more than 24 processors.

关键词： Second Harmonic Generation Coefficient parallel computing Message Passing Interface (MPI)

来源：评论

学校读者我要写书评

暂无评论

parallel Construction of Approximate kNN Graph

Parallel Construction of Approximate kNN Graph

引用

作者： Dilin Wang Jianwen Cao Yanmei Zheng Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese

Building k-nearest neighbor(kNN)graphs is a necessary step in such areas as data mining and machine *** in this paper,we attempt to study the kNN furthermore,we first propose a parallel algorithm for approximate kNN graph construction and then apply the kNN graph to the application of *** show that our MPI/OpenMP mixed mode codes can make the construction of approximate kNN graph faster and make the parallelization and implementation ***,we compare the results of agglomerative clustering methods by using our parallel algorithm to illustrate the applicability of this method.

关键词： Approximate kNN MPI/OpenMP parallel algorithms Clustering

来源：评论

学校读者我要写书评

暂无评论

Space-aware Design Factors for Located Learning Activities Supported with Smart Phones

Space-aware Design Factors for Located Learning Activities S...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Patricia Santos Mar Pérez-Sanagustín Davinia Hern'ndez-Leo Josep Blat ICT Department Universitat Pompeu Fabra Barcelona Spain Department of Telematics Universidad Carlos III Madrid Madrid Spain

Mobile technologies are currently being applied to facilitate the development of learning activities in diverse spaces beyond the classroom. Indoors and outdoors spaces are augmented with located digital Educational Resources (ER) through specific technologies that provide a sensory input to smart phones that can indicate position and, thus, enable located learning activities. The potentiality that smart phones have, make these devices adequate to facilitate the access to located ERs. This paper proposes four space-aware design factors (the space, the connectivity, the position-based technologies and the guidance) that have to be considered for designing located learning activities supported with smart phones. The application of the factors is explained through four illustrative located learning scenarios. The paper discusses and provides a wide-range vision of how the combination of these factors affects the design of the activity, accessing to the ERs and monitoring the students' progress.

关键词： Smart phones Erbium Bluetooth Cloud computing Global Positioning System Monitoring

来源：评论

学校读者我要写书评

暂无评论

Distributing Power Grid State Estimation on HPC Clusters - A System Architecture Prototype

Distributing Power Grid State Estimation on HPC Clusters - A...

引用

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

作者： Yan Liu Wei Jiang Shuangshuang Jin Mark Rice Yousu Chen Data Intensive Computing Group Pacific Northwest National Laboratory Richland WA USA Department of Computer Science and Engineering Ohio State University Columbus OH USA Electrical Power Systems Engergy Pacific Northwest National Laboratory Richland WA USA

ISBN: (纸本)9781467309745

The future power grid is expected to further expand with highly distributed energy sources and smart loads. The increased size and complexity lead to increased burden on existing computational resources in energy control centers. Thus the need to perform real-time assessment on such systems entails efficient means to distribute centralized functions such as state estimation in the power system. In this paper, we present our experience of prototyping a system architecture that connects distributed state estimators individually running parallel programs to solve non-linear estimation procedure. Through our experience, we highlight the needs of integrating the distributed state estimation algorithm with efficient partition and data communication tools so that distributed state estimation has low overhead compared to the centralized solution. We build a test case based on the IEEE 118 bus system and partition the state estimation of the whole system model to available HPC clusters. The measurement from the test bed demonstrates the low overhead of our solution.

关键词： State estimation Computer architecture Size measurement distributed databases Power grids Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

The Multi-Processor Scheduling Problem in Phylogenetics

The Multi-Processor Scheduling Problem in Phylogenetics

引用

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

作者： Jiajie Zhang Alexandros Stamatakis Graduate School for Computing in Medicine and Life Sciences University of Lübeck Lubeck Germany Exelixis Laboratory Scientific Computing Group Heidelberg Institute for Theoretical Studies Heidelberg Germany

Advances in wet-lab sequencing techniques allow for sequencing between 100 genomes up to 1000 full transcriptomes of species whose evolutionary relationships shall be disentangled by means of phylogenetic analyses. Likelihood-based evolutionary models allow for partitioning such broad phylogenomic datasets, for instance into gene regions, for which likelihood model parameters (except for the tree itself) can be estimated independently. Present day phylogenomic datasets are typically split up into 1000-10,000 distinct partitions. While the likelihood on such datasets needs to be computed in parallel because of the high memory requirements, it has not yet been assessed how to optimally distribute partitions and/or alignment sites to processors, in particular when the number of cores is significantly smaller than the number of partitions. We find that, by distributing partitions (of varying lengths) monolithically to processors, the induced load distribution problem essentially corresponds to the well-known multiprocessor scheduling problem. By implementing the simple Longest Processing Time (LPT) heuristics in the PThreads and MPI version of RAxML-Light, we were able to accelerate run times by up to one order of magnitude. Other heuristics for multi-processor scheduling such as improved MultiFit, improved Zero-One, or the Three Phase approach did not yield notable performance improvements.

关键词： Partitioning algorithms Standards Phylogeny Computational modeling Program processors Mathematical model Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 426 427 428 429 430 431 432 433 434 435 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：