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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
277 篇 期刊文献
26 册 图书

馆藏范围

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

日期分布

学科分类号

5,461 篇 工学
- 5,202 篇 计算机科学与技术...
- 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,581 篇 distributed comp...
1,152 篇 parallel process...
985 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
725 篇 grid computing
597 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
456 篇 resource managem...
428 篇 scalability
399 篇 costs
395 篇 bandwidth
394 篇 runtime
384 篇 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,093 篇 英文
125 篇 其他
10 篇 中文

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

共 11228 条记录，以下是4091-4100 订阅

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

详细简洁

排序：

A Novel Associative Model of Data: Toward a distributed Large-Scale Data Processing Scheme for Future Computer Clouds

A Novel Associative Model of Data: Toward a Distributed Larg...

引用

11th IEEE international symposium on Network computing and Applications (NCA)

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

ISBN: (纸本)9780769547732

Existing cloud frameworks involve isolating low-level operations within an application for data distribution and partitioning. This limits their applicability for many applications with complex data dependency considerations. This paper aims to explore new methods of partitioning and distributing data in the cloud by fundamentally re-thinking the way in which future data management models will need to be developed on the Internet. Loosely-coupled associative computing techniques, which have so far not been considered, can provide the break-through needed for a distributed data management scheme. Using a novel lightweight associative memory algorithm known as Edge Detecting Hierarchical Graph Neuron (EdgeHGN), data retrieval/processing can be modeled as a pattern recognition problem, conducted across multiple records 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 One-shot Learning Associative computing Cloud computing

来源：评论

学校读者我要写书评

暂无评论

GTI: A Generic Tools Infrastructure for Event-Based Tools in parallel Systems

GTI: A Generic Tools Infrastructure for Event-Based Tools in...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive computing

作者： Hilbrich, Tobias Mueller, Matthias S. de Supinski, Bronis R. Schulz, Martin Nagel, Wolfgang E. Tech Univ Dresden ZIH D-01062 Dresden Germany Lawrence Livermore Natl Lab Livermore CA 94551 USA

ISBN: (纸本)9780769546759

Runtime detection of semantic errors in MPI applications supports efficient and correct large-scale application development. However, current approaches scale to at most one thousand processes and design limitations prevent increased scalability. The need for global knowledge for analyses such as type matching, and deadlock detection presents a major challenge. We present a scalable tool infrastructure - the Generic Tool Infrastructure (GTI) - that we will use to implement MPI runtime error detection tools and that applies to other use cases. GTI supports simple offloading of tool processing onto extra processes or threads and provides a tree based overlay network (TBON) for creating scalable tools that analyze global knowledge. We present its abstractions and code generation facilities that ease many hurdles in tool development, including wrapper generation, tool communication, trace reductions, and filters. GTI ultimately allows tool developers to focus on implementing tool functionality instead of the surrounding infrastructure. Further, we demonstrate that GTI supports scalable tool development through a lost message detector and a phase profiler. The former provides a more scalable implementation of important base functionality for MPI correctness checking, while the latter tool demonstrates that GTI can serve as the basis of further types of tools. Experiments with up to 2048 cores show that GTI's scalability features apply to both tools.

关键词： Tools Tool infrastructure Message Passing Interface Scalability Runtime error detection

来源：评论

学校读者我要写书评

暂无评论

On-line Batch Scheduling in distributed Optical Networks

On-line Batch Scheduling in Distributed Optical Networks

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive computing

作者： Wang, Yang Cao, Xiaojun Caciula, Adrian Hu, Qian Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9780769546766

Batch scheduling accommodates a group of tasks with the start/end time constraints to maximize the revenue from scheduling tasks over a number of servers, which has been extensively studied in the context of Job-machine scheduling. In optical networks, batch scheduling refers to the process of scheduling a group of data units (i.e., the jobs) that competing for the same set of wavelength channels (i.e., the machines). Classical Job-machine scheduling studies considered both the case of a pure-loss system, and the case with waiting rooms (i.e., buffers), which are generally in the form of Random Access Memory (RAM). In optical networks, the buffering is achieved by feeding the optical signal into a fixed length of fiber, namely Fiber Delay Lines, since optical RAM is not yet available. The unique feature of the discrete and predefined buffering time in fact instantiates a new type of problem, namely Job-machine scheduling with Discrete-time Buffers. In this work, we comprehensively study batch scheduling in optical networks. We show that batch scheduling with and without FDLs corresponds to two different instances of Job-machine scheduling problem. While proving their NP-Completeness, we mathematically model both cases using Integer Linear Programming formulations to provide an optimal scheduling. Given the timeliness request for on-line batch scheduling and the dramatic problem size in optical networks, we also propose polynomial-time heuristic algorithms, which are shown to be near-optimal in our simulations.

关键词： Fiber optic networks FIBER LENGTH DATA CELLS WAITING ROOM fiber delay line machine scheduling fixed length jobs Optimal scheduling buffers discrete-time

来源：评论

学校读者我要写书评

暂无评论

High-Performance Interaction-Based Simulation of Gut Immunopathologies with ENteric Immunity SImulator (ENISI)

High-Performance Interaction-Based Simulation of Gut Immunop...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive computing

作者： Bisset, Keith Alam, Md Maksudul Bassaganya-Riera, Josep Carbo, Adria Eubank, Stephen Hontecillas, Raquel Hoops, Stefan Mei, Yongguo Wendelsdorf, Katherine Xie, Dawen Yeom, Jae-Seung Marathe, Madhav Virginia Tech Virginia Bioinformat Inst Blacksburg VA 24061 USA

ISBN: (纸本)9780769546759

Here we present the ENteric Immunity Simulator (ENISI), a modeling system for the inflammatory and regulatory immune pathways triggered by microbe-immune cell interactions in the gut. With ENISI, immunologists and infectious disease experts can test and generate hypotheses for enteric disease pathology and propose interventions through experimental infection of an in silico gut. ENISI is an agent based simulator, in which individual cells move through the simulated tissues, and engage in context-dependent interactions with the other cells with which they are in contact. The scale of ENISI is unprecedented in this domain, with the ability to simulate 10 7 cells for 250 simulated days on 576 cores in one and a half hours, with the potential to scale to even larger hardware and problem sizes. In this paper we describe the ENISI simulator for modeling mucosal immune responses to gastrointestinal pathogens. We then demonstrate the utility of ENISI by recreating an experimental infection of a mouse with Helicobacter pylori 26695. The results identify specific processes by which bacterial virulence factors do and do not contribute to pathogenesis associated with H. pylori strain 26695. These modeling results inform general intervention strategies by indicating immunomodulatory mechanisms such as those used in inflammatory bowel disease may be more appropriate therapeutically than directly targeting specific microbial populations through vaccination or by using antimicrobials.

关键词： Computational Immunology parallel Efficiency and Scalability Agent Based Simulation Biocomputing

来源：评论

学校读者我要写书评

暂无评论

SIaaS - Sensing instrument as a service using cloud computing to turn physical instrument into ubiquitous service

SIaaS - Sensing instrument as a service using cloud computin...

引用

2012 10th IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2012

作者： Di Lauro, Roberto Lucarelli, Francesca Montella, Raffaele Department of Applied Science University of Naples Parthenope Italy

ISBN: (纸本)9780769547015

Sensing Instrument as a Service (SIaaS) is a new cloud service that allows users to use data acquisition instruments shared through cloud infrastructure. It offers a common interface to managing physical sensing instrument and it permits to take all advantages of using cloud computing technology in storing and processing acquired data. With SIaaS different research groups could share physical instrument, in a controlled way, event if they are geographically distributed and user can access to them using an internet connected device without the need to install any sort of program. With the interaction of different own framework we have created a new cloud service for transforming physical resources in a ubiquitous service. © 2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Steps towards GPU accelerated aggregation AMG

Steps towards GPU accelerated aggregation AMG

引用

2012 11th international symposium on parallel and distributed computing, ISPDC 2012

作者： Emans, Maximilian Liebmann, Manfred Basara, Branislav Johann Radon Institute for Computational and Applied Mathematics IMCC GmbH 4040 Linz Austria Institute for Mathematics and Scientific Computing University of Graz 8010 Graz Austria AVL GmbH Advanced Simulation Technology 8020 Graz Austria

ISBN: (纸本)9780769548050

We present an implementation of AMG with simple aggregation techniques on multiple GPUs. It supports the parallel matrix representations typically used for finite volume discretisation. We employ the ICRS sparse matrix format and the asynchronous exchange mechanism of MPI on CPUs that has been modified to make it suitable for the GPU coprocessors. We show that the solution phase of the standard v-cycle AMG with simple aggregation is accelerated by a factor of up to 12. The solution phase of the more advanced Krylov-accelerated AMG runs faster by a factor of up to 7 on Nvidia TESLA C2070 compared to calculation on Intel X5650 CPUs. © 2012 IEEE.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Analyzing the robustness of dynamic loop scheduling for heterogeneous computing systems

Analyzing the robustness of dynamic loop scheduling for hete...

引用

2012 11th international symposium on parallel and distributed computing, ISPDC 2012

作者： Srivastava, Srishti Sukhija, Nitin Banicescu, Ioana Ciorba, Florina M. Mississippi State University Department of Computer Science and Engineering Mississippi State MS 39762 United States Technische Universität Dresden Center for Information Services and High Performance Computing 01062 Dresden Germany

ISBN: (纸本)9780769548050

Scheduling scientific applications in parallel on non-dedicated, heterogeneous systems, where the computing resources may differ in availability, is a challenging task, and requires efficient execution and robust scheduling methods. Dynamic loop scheduling methods provide means to achieve the desired robust performance. These methods are based on probabilistic analyses and are inherently robust. However, a methodology is required to measure the robustness of the dynamic loop scheduling methods that ensures their performance in unpredictably changing computing environments. In this paper, a methodology is proposed for performing robustness analysis of the dynamic loop scheduling techniques using a metric, formulated in earlier work, to measure their robustness in heterogeneous computing systems with uncertainties. The dynamic loop scheduling methods have been implemented in a simulation. The experimental results were used as an input to the proposed methodology, which in turn has been used to experimentally analyze the robustness of a number of dynamic loop scheduling methods on a heterogeneous system with variable availability. © 2012 IEEE.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

A framework for parallel numerical simulations on multi-scale geometries

A framework for parallel numerical simulations on multi-scal...

引用

2012 11th international symposium on parallel and distributed computing, ISPDC 2012

作者： Varduhn, Vasco Mundani, Ralf-Peter Rank, Ernst Department of Computation in Engineering Technische Universität München Munich Germany

ISBN: (纸本)9780769548050

In this paper, an approach on performing numerical multi-scale simulations on fine detailed geometries is presented. In particular, the focus lies on the generation of sufficient fine mesh representations, whereas a resolution of dozens of millions of voxels is inevitable in order to sufficiently represent the geometry. Furthermore, the propagation of boundary conditions is investigated by using simulation results on the coarser simulation scale as input boundary conditions on the next finer scale. Finally, the applicability of our approach is shown on a two-phase simulation for flooding scenarios in urban structures running from a city wide scale to a fine detailed in-door scale on feature rich building geometries. © 2012 IEEE.

关键词： Boundary conditions

来源：评论

学校读者我要写书评

暂无评论

Implementation of data-parallel skeletons: A case study using a coarse-grained hierarchical model

Implementation of data-parallel skeletons: A case study usin...

引用

2012 11th international symposium on parallel and distributed computing, ISPDC 2012

作者： Li, Chong Gava, Frédéric Hains, Gaétan LACL Université Paris-Est EXQIM S.A.S. Paris France LACL Université Paris-Est Créteil France LACL Université Paris-Est EXQIM S.A.S. Créteil France

ISBN: (纸本)9780769548050

Writing parallel programs is known to be notoriously difficult. Often programmers do not want to reason about message-passing algorithms and only want to combine existing high-level patterns to produce their parallel program. This is the algorithmic skeletons approach to parallel programming. It improves reliability and clarity of source code. But skeletons can be insufficient when complicated communication schemes are needed. Expressing skeletons in a more general and low level language in the form of a library seems to be a good compromise between simplicity and expressive power. In this article, we present a coarsed-grained implementation using a hierarchical model of a set of data-parallel skeletons. Programming experiments and benchmarks complete the article. © 2012 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Optimized GPU Sorting Algorithms on Special Input Distributions

Optimized GPU Sorting Algorithms on Special Input Distributi...

引用

11th international symposium on distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Yang, Quan Du, Zhihui Zhang, Sen Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China State Univ Newyork Dept Math Comp Sci & Stat Albany NY 13820 USA

ISBN: (纸本)9780769548180

We present a high performance graphics processing unit (GPU) sorting algorithm ISSD (Improved Sorting considering Special Distributions) implemented with the Compute Unified Device Architecture (CUDA). The ISSD focuses on two aspects to improve parallel sorting performance. One is how to decompose the sorting tasks into independent and balanced subtasks which can then be easily distributed to thousands of threads to realize the concept of "parallel sorting" as well as to efficiently explore the power of GPU. The other one is how to take advantage of special data distributions to further optimize the algorithms and improve their performance. The algorithm is redesigned based on our previous general data distribution version and optimized both on general implementation methods and special input distributions. Experimental results show that for the general data distribution inputs, the ISSD outperforms the existing parallel sorting algorithms by about 10% in performance due to its practical optimization in implementation;and for three special data distribution inputs, the ISSD outperforms the existing algorithms by more than 40% due to its special optimization based on the data distributions. Therefore, the algorithm is viable and efficient when dealing with specific data distributions.

关键词： GPU parallel sorting algorithm special data distribution

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 406 407 408 409 410 411 412 413 414 415 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：