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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,501 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

2,574 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,571 篇 英文
2 篇 其他
1 篇 葡萄牙文

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

共 2574 条记录，以下是1841-1850 订阅

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

详细简洁

排序：

Model-driven generative techniques for scalable performability analysis of distributed systems

Model-driven generative techniques for scalable performabili...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： A. Kogekar D. Kaul A. Gokhale P. Vandal U. Praphamontripong S. Gokhale Jing Zhang Yuehua Lin J. Gray Department of Electrical Engineering and Computer Science Vanderbilt University Nashville TN USA Department of Computer Science and Engineering University of Connecticut Storrs CT USA Department of Computer and Information Science University of Alabama Birmingham Birmingham AL USA

the ever increasing societal demand for the timely availability of newer and feature-rich but highly dependable network-centric applications imposes the need for these applications to be constructed by the composition, assembly and deployment of off-the-shelf infrastructure and domain-specific services building blocks. Service oriented architecture (SOA) is an emerging paradigm to build applications in this manner by defining a choreography of loosely coupled building blocks. However, current research in SOA does not yet address the per for mobility (i.e., performance and dependability) challenges of these modern applications. Our research is developing novel mechanisms to address these challenges. We initially focus on the composition and configuration of the infrastructure hosting the individual services. We illustrate the use of domain-specific modeling languages and model weavers to model infrastructure composition using middleware building blocks, and to enhance these models with the desired performability attributes. We also demonstrate the use of generative tools that synthesize metadata from these models for performability validation using analytical, simulation and empirical benchmarking tools.

关键词： Performance analysis Application software Service oriented architecture Computer science Middleware Programming Assembly Information analysis Computer networks distributed computing

来源：评论

学校读者我要写书评

暂无评论

Supporting self-adaptation in streaming data mining applications 06

Supporting self-adaptation in streaming data mining applicat...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Liang Chen G. Agrawal Department of Computer Science and Engineering Ohio State Uinversity Columbus OH USA

ISBN: (纸本)9781424400546

there are many application classes where the users are flexible with respect to the output quality. At the same time, there are other constraints, such as the need for real-time or interactive response, which are more crucial. this paper presents and evaluates a runtime algorithm for supporting adaptive execution for such applications. the particular domain we target is distributed data mining on streaming data. this work has been done in the context of a middleware system called GATES (grid-based adaptive execution on streams) that we have been developing. the self-adaptation algorithm we present and evaluate in this paper has the following characteristics. First, it carefully evaluates the long-term load at each processing stage. It considers different possibilities for the load at a processing stage and its next stages, and decides if the value of an adaptation parameter needs to be modified, and if so, in which direction. To find the ideal new value of an adaptation parameter, it performs a binary search on the specified range of the parameter. To evaluate the self-adaptation algorithm in our middleware, we have implemented two streaming data mining applications. the main observations from our experiments are as follows. First, our algorithm is able to quickly converge to stable values of the adaptation parameter, for different data arrival rates, and independent of the specified initial value. Second, in a dynamic environment, the algorithm is able to adapt the processing rapidly. Finally, in both static and dynamic environments, the algorithm clearly outperforms the algorithm described in our earlier work and an obvious alternative, which is based on linear-updates.

关键词： Data mining Middleware Application software Runtime Streaming media Heuristic algorithms Data visualization Real time systems Computer science Program processors

来源：评论

学校读者我要写书评

暂无评论

Sim-X: parallel system software for interactive multi-experiment computational studies 06

Sim-X: parallel system software for interactive multi-experi...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Siu-Man Yau E. Grinspun V. Karamcheti D. Zorin Courant Institute of Mathematical Sciences New York University USA Department of Computer Science Columbia University USA

ISBN: (纸本)9781424400546

Advances in high-performance computing have led to the broad use of computational studies in everyday engineering and scientific applications. A single study may require thousands of computational experiments, each corresponding to individual runs of simulation software with different parameter settings; in complex studies, the pattern of parameter changes is complex and may have to be adjusted by the user based on partial simulation results. Unfortunately, existing tools have limited high-level support for managing large ensembles of simultaneous computational experiments. In this paper, we present a system architecture for interactive computational studies targeting two goals. the first is to provide a framework for high-level user interaction with computational studies, rather than individual experiments; the second is to maximize the size of the studies that can be performed at close to interactive rates. We describe a prototype implementation of the system and demonstrate performance improvements obtained using our approach for a simple model problem

关键词： System software Concurrent computing Computational modeling High performance computing Grid computing Application software Computer architecture Computer science Software prototyping Virtual prototyping

来源：评论

学校读者我要写书评

暂无评论

Topology-aware task mapping for reducing communication contention on large parallel machines

Topology-aware task mapping for reducing communication conte...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： T. Agarwal A. Sharma A. Laxmikant L.V. Kale University of Illinois at Urbana-Champaign University of Illinois at Urbana-Champaign Urbana IL US Univ. of Illinois at Urbana-Champaign IL USA

Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies became insignificant, i.e., the no-load latencies for far-away processors were not significantly higher (and too small to matter) than those for nearby processors. Contention in the network is then left as the major factor affecting latencies. With networks such as fat-trees of hypercubes, with number of wires growing as P log P, even this is not a very significant factor. However, for torus and grid networks now being used in large machines such as BlueGene/L and the Cray XT3, such contention becomes an issue. We quantify the effect of this contention with benchmarks that vary the number of hops traveled by each communicated byte. We then demonstrate a process mapping strategy that minimizes the impact of topology by heuristically minimizing the total number of hop-bytes communicated. this strategy, and its variants, are implemented in an adaptive runtime system in Charm++ and adaptive MPI, so it is available for a broad class of applications.

关键词： parallel machines Delay Concurrent computing Computer networks Multiprocessor interconnection networks Network topology Jacobian matrices Routing Hypercubes Wires

来源：评论

学校读者我要写书评

暂无评论

FIFO scheduling of divisible loads with return messages under the one-port model 06

FIFO scheduling of divisible loads with return messages unde...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： O. Beaumont L. Marchal V. Rehn Y. Robert LaBRI UMR CNRS 5800 Bordeaux France LIP UMR CNRS-INRIA-UCBL 5668 ENS Lyon France

ISBN: (纸本)9781424400546

this paper deals with scheduling divisible load applications on star networks, in presence of return messages. this work is a follow-on of Beumont et al. (2005), where the same problem was considered under the two-port model, where a given processor can simultaneously send and receive a message. Here, we concentrate on the one-port model, where a processor can either send or receive a message at a given time step. the problem of scheduling divisible load on star platforms turns out to be very difficult as soon as return messages are involved. Unfortunately, we have not been able to assess its complexity, but we provide an optimal solution in the special (but important) case of FIFO communication schemes. We also provide an explicit formula for the optimal number of load units that can be processed by a FIFO ordering on a bus network. Finally, we provide a set of MPI experiments to assess the accuracy and usefulness of our results in a real framework.

关键词： Processor scheduling Bandwidth Scattering Computer aided instruction Cryptography Size control Pipeline processing Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Oblivious parallel probabilistic channel utilization without control channels

Oblivious parallel probabilistic channel utilization without...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： C. Schindelhauer University of Paderborn Heinz Nixdorf Institute Paderborn

the research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot use data gathering. However, if a large number of channels can be used, then parallel transmission can compensate this drawback. If the senders and receivers are not known in advance, then a control channel poses a bottleneck for communication. We present an oblivious MAC protocol, called the funnel protocol, where the channels are nearly optimally utilized in parallel. In this, senders and receivers choose for a polylogarithmic number of rounds (several sending attempts) a decreasing number of channels which are selected equiprobably. then, we show that a previously presented approach using only one round and therefore one type of probability distribution is optimal up to some constant factor, and considerably worse than the funnel protocol. the protocol works with few resources if a sufficient number of channels is available. the funnel protocol is simple, elegant, and does not need to know the number of senders and receivers, thus being oblivious. On the bottom line we prove that small messages can be efficiently transmitted by the MAC layer in parallel without a control channel if more than one channel for communication can be used

关键词： Protocols Radio transceivers Frequency Time division multiple access Hardware Communication system control Probability distribution Sensor phenomena and characterization Central processing Unit parallel processing

来源：评论

学校读者我要写书评

暂无评论

An extensible global address space framework with decoupled task and data abstractions

An extensible global address space framework with decoupled ...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Sriram Krishnamoorthy Umit Catalyurek Jarek Nieplocha Atanas Rountev P. Sadayappan Department of Computer Science and Engineering Ohio State Uinversity Columbus OH USA Department of Biomedical Informatics Ohio State Uinversity Columbus OH USA Computational Sciences and Mathematics Pacific Northwest National Laboratory Richland WA USA

Although message passing using MPI is the dominant model for parallel programming today, the significant effort required to develop high-performance MPI applications has prompted the development of several parallel programming models that are more convenient. Programming models such as Co-Array Fortran, Global Arrays, Titanium, and UPC provide a more convenient global view of the data, but face significant challenges in delivering high performance over a range of applications. It is particularly challenging to achieve high performance using global-address-space languages for unstructured applications with irregular data structures. In this paper, we describe a global-address-space parallel programming framework with decoupled task and data abstractions. the framework centers around the use of task pools, where tasks specify operands in a distributed, globally addressable pool of data chunks. the data chunks can be addressed in a logical multidimensional "tuple" space, and are distributed among the nodes of the system. Locality-aware load balancing of tasks in the task pool is achieved through judicious mapping via hyper-graph partitioning, as well as dynamic task/data migration. the framework implements a transparent interface for out-of-core data, so that explicit orchestration of movement of data between disks and memory is not required of the programmer. the use of the framework for implementation of parallel block-sparse tensor computations in the context of a quantum chemistry application is illustrated

关键词： parallel programming Quantum computing Message passing Titanium Data structures Multidimensional systems Load management Programming profession Tensile stress Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Techniques supporting threadprivate in OpenMP 06

Techniques supporting threadprivate in OpenMP

引用

international symposium on parallel and distributed processing (IPDPS)

作者： X. Martorell M. Gonzalez A. Duran J. Balart R. Ferrer E. Ayguade J. Labarta Barcelona Supercomputing Center-Computer Architecture Department Technical University Catalunya Barcelona Spain

ISBN: (纸本)9781424400546

this paper presents the alternatives available to support threadprivate data in OpenMP and evaluates them. We show how current compilation systems rely on custom techniques for implementing thread-local data. But in fact the ELF binary specification currently supports data sections that become threadprivate by default. ELF naming for such areas is thread-local storage (TLS). Our experiments demonstrate that implementing threadprivate based on the TLS support is very easy, and more efficient. this proposal goes in the same line as the future implementation of OpenMP on the GNU compiler collection. In addition, our experience with the use of threadprivate in OpenMP applications shows that usually it is better to avoid it. this is because threadprivate variables reside in common blocks and they impede the compiler to fully optimize the code. So it is better to keep threadprivate as a temporary technique only to ease porting MPI codes to OpenMP

关键词： Ground penetrating radar Geophysical measurement techniques Yarn Proposals parallel processing Computer architecture Impedance Optimizing compilers parallel programming Memory architecture

来源：评论

学校读者我要写书评

暂无评论

A cost-effective context memory structure for dynamically reconfigurable processors 06

A cost-effective context memory structure for dynamically re...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： M. Suzuki Y. Hasegawa V.M. Tuan S. Abe H. Amano Graduate School of Science and Technology Keio University Yokohama Japan

ISBN: (纸本)9781424400546

Multicontext reconfigurable processors can switch its configuration in a single clock cycle by providing a context memory in each of the processing elements. Although these processors have proven to be powerful in many applications, the number of contexts is often not enough. the context translation table which translates the global instruction pointer, or the global logical context number, into a local physical context number is proposed to realize a larger application while reducing the actual context memories. Our evaluation using NEC Electronics' DRP-1 shows that the proposed method is effective when the size of the tile is small and the number of context is large. In the most efficient case, the required number of contexts is reduced to 25%, and the total amount of configuration data becomes 6.9%. the template configuration method which extends this idea harnesses the power of multicontext devices by storing basic contexts as templates and combining them to form the actual contexts. While effective in theory, our evaluation shows that the return in adopting such mechanisms in more finer processors as the DRP-1 is minimal where the size of the context memory adds up relative to the number of processing units.

关键词： Hardware Switches Clocks National electric code Tiles Central processing Unit Fabrics Costs System-on-a-chip Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Using virtual grids to simplify application scheduling 06

Using virtual grids to simplify application scheduling

引用

international symposium on parallel and distributed processing (IPDPS)

作者： R. Huang H. Casanova A.A. Chien Computer Science & Engineering and Center for Networked Systems University of California San Diego USA Information and Computer Sciences Department University of Hawaii Manoa USA

ISBN: (纸本)9781424400546

Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also raise the issue of application scheduling scalability. First, even polynomial time scheduling heuristics may take a prohibitively long time to compute a schedule. Second, and perhaps more critical, it may not be possible to gather all the resource information needed by a scheduling algorithm in a scalable manner. Our application focus is scientific workflows, which can be represented as directed acyclic graphs (DAGs). Our claim is that, in future resource-rich environments, simple scheduling algorithms may be sufficient to achieve good workflow performances. We introduce a scalable scheduling approach that uses a resource abstraction called a virtual grid (VG). Our simulations of a range of typical DAG structures and resources demonstrate that a simple greedy scheduling heuristic combined with the virtual grid abstraction is as effective and more scalable than more complex heuristic DAG scheduling algorithms on large-scale platforms

关键词： Optimal scheduling Processor scheduling Scheduling algorithm Application software Large-scale systems Grid computing Polynomials distributed computing Computer science Computer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 181 182 183 184 185 186 187 188 189 190 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：