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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,952 篇 工学
- 1,912 篇 计算机科学与技术...
- 890 篇 软件工程
- 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
87 篇 distributed comp...
86 篇 runtime
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,547 篇 英文
27 篇 其他
1 篇 葡萄牙文

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

共 2575 条记录，以下是1761-1770 订阅

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

详细简洁

排序：

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

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

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Yau, Siu-Man Grinspun, Eitan Karamcheti, Vijay Zorin, Denis Courant Institute of Mathematical Sciences New York University United States Department of Computer Science Columbia University United States

ISBN: (纸本)1424400546

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. © 2006 ieee.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

A note on broadcast encryption key management with applications to large scale emergency alert systems 20

A note on broadcast encryption key management with applicati...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Shu, Guoqiang Lee, David Yannakakis, Mihalis Ohio State University Dept. of Computer Science and Engineering Columbus OH 43210 United States Columbia University Dept. of Computer Science New York NY 10027 United States

ISBN: (纸本)1424400546

Emergency alerting capability is crucial for the prompt response to natural disasters and terrorist attacks. the emerging network infrastructure and secure broadcast techniques enable prompt and secure delivery of emergency notification messages. With the ubiquitous deployment of alert systems, scalability and heterogeneity pose new challenges for the design of secure broadcast schemes. In this paper we discuss the key generation problem with the goal of minimizing the total number of keys which need to be generated by the alert center and distributed to the users. Two encryption schemes, zero message scheme and extended header scheme, are modeled formally. For both schemes we show the equivalence of the general optimal key generation (OKG) problem and the bipartite clique cover (BCC) problem, and show that OKG problem is NP-Hard. the result is then generalized to the case with resource constraints, and we provide a heuristic algorithm for solving the restricted BCC (and OKG) problem. © 2006 ieee.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

Compilation of XSLT into dataflow graphs for web service composition 06

Compilation of XSLT into dataflow graphs for web service com...

引用

6th ieee international symposium on Cluster Computing and the Grid (CCGRID 2006)

作者： Kelly, Peter M. Coddington, Paul D. Wendelborn, Andrew L. Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia

ISBN: (纸本)0769525857

Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and data intensive programs that delegate part of their computation to services, and making it easier to develop such applications. the ability to invoke multiple service calls at one time on different machines enables different portions of the program to be executed concurrently. We are addressing this through an implementation of an existing functional language, XSLT Our implementation uses a dataflow execution model, and includes a compiler to build dataflow graphs from XSLT source code. this paper describes the execution model used to obtain parallelism and compose web services, as well as the compilation process used to create the dataflow graphs. Our aim with this paper is to present the design of our system and demonstrate that XSLT provides a suitable model for distributed execution and parallel composition of web services.

关键词： Web services Concurrent computing Australia throughput Large-scale systems parallel processing Grid computing Libraries Data flow computing Computer science

来源：评论

学校读者我要写书评

暂无评论

Centralized versus distributed schedulers for multiple bag-of-task applications 20

Centralized versus distributed schedulers for multiple bag-o...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Beaumont, Olivier Carter, Larry Ferrante, Jeanne Legrand, Arnaud Marchai, Loris Robert, Yves Laboratoire LaBRI CNRS-INRIA Bordeaux France Dept. of Computer Science and Engineering University of California San Diego United States Laboratoire ID-IMAG CNRS-INRIA Grenoble France Laboratoire LIP CNRS-INRIA École Normale Supérieure de Lyon France

ISBN: (纸本)1424400546

Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem, of scheduling applications to ensure fair and efficient execution on a distributed network of processors. We limit our study to the case where communication is restricted to a tree embedded in the network, and the applications consist of a large number of independent tasks that originate at the tree's root. the tasks of a given application all have the same computation and communication requirements, but these requirements can vary for different applications. Each application is given a weight that quantifies its relative value. the goal of scheduling is to maximize throughput while executing tasks from each application in the same ratio as their weights. We can find the optimal asymptotic rates by solving a linear program that expresses all necessary problem, constraints, and we show how to construct a periodic schedule. For single-level trees, the solution is characterized by processing tasks with larger communication-to- computation ratios at children with larger bandwidths. For multi-level trees, this approach requires global knowledge of all application and platform parameters. For large-scale platforms, such global coordination by a centralized scheduler may be unrealistic. thus, we also investigate decentralized schedulers that use only local information at each participating resource. We assess their performance via simulation, and compare to a centralized solution obtained via linear programming. the best of our decentralized heuristics achieves the same performance on about two-thirds of our test cases, but is far worse in a few cases. While our results are based on simplistic assumptions and do not explore all parameters (such as buffer size), they provide insight into the important question of fairly and optimally co-scheduling heterogeneous applications on heterogeneous grids. ©2006 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Hierarchical multithreading: Programming model and system software 20

Hierarchical multithreading: Programming model and system so...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Gao, Guang R. Sterling, thomas Stevens, Rick Hereld, Mark Zhu, Weirong Department of Electrical and Computer Engineering University of Delaware United States Center for Advanced Computing Research California Institute of Technology United States Department of Computer Science Louisiana State University United States Mathematics and Computer Science Division Argonne National Laboratory United States

ISBN: (纸本)1424400546

this paper addresses the underlying sources of performance degradation (e.g. latency, overhead, and starvation) and the difficulties of programmer productivity (e.g. explicit locality management and scheduling, performance tuning, fragmented memory, and synchronous global barriers) to dramatically enhance the broad effectiveness of parallel processing for high end computing. We are developing a hierarchical threaded virtual machine (HTVM) that defines a dynamic, multithreaded execution model and programming model, providing an architecture abstraction for EEC system software and tools development. We are working on a prototype language, LITL-X (pronounced "little-X") for Latency Intrinsic-Tolerant Language, which provides the application programmers with a powerful set of semantic constructs to organize parallel computations in a way that hides/manages latency and limits the effects of overhead. this is quite different from locality management, although the intent of both strategies is to minimize the effect of latency on the efficiency of computation. We will work on a dynamic compilation and runtime model to achieve efficient LITL-X program execution. Several adaptive optimizations will be studied. A methodology of incorporating domain-specific knowledge in program optimization will be studied. Finally, we plan to implement our method in an experimental testbed for a HEC architecture and perform a qualitative and quantitative evaluation on selected applications. © 2006 ieee.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed antipole clustering for efficient data search and management in euclidean and metric spaces 20

Distributed antipole clustering for efficient data search an...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Ferro, Alfredo Giugno, Rosalba Mongiovì, Misael Pigola, Giuseppe Pulvirenti, Alfredo University of Catania Dept. of Mathematics and Computer Science Viale A. Doria 6 95125 Catania Italy Proteo S.p.A. Research and Development Department via S. Sofia 65 Catania 95123 Italy

ISBN: (纸本)1424400546

In this paper a simple and efficient distributed version of the recently introduced Antipole Clustering algorithm for general metric spaces is proposed. this combines ideas from the M-Tree, the Multi-Vantage Point structure and the FQ-Tree to create a new structure in the "bisector tree" class, called the Antipole Tree. Bisection is based on the proximity to an "Antipole" pair of elements generated by a suitable linear randomized tournament. the final winners (A, B) of such a tournament are far enough apart to approximate the diameter of the splitting set. A simple linear algorithm computing Antipoles in Euclidean spaces with exponentially small approximation ratio is proposed. the Antipole Tree Clustering has been shown to be very effective in important applications such as range and k-nearest neighbor searching, mobile objects clustering in centralized wireless networks with movable base stations and multiple alignment of biological sequences. In many of such applications an efficient distributed clustering algorithm is needed. In the proposed distributed versions of Antipole Clustering the amount of data passed from one node to another is either constant or proportional to the number of nodes in the network. the distributed Antipole Tree is equipped with additional information in order to perform efficient range search and dynamic clusters management. this is achieved by adding to the randomized tournaments technique, methodologies taken from established systems such as BFR and BIRCH*. Experiments show the good performance of the proposed algorithms on both real and synthetic data. © 2006 ieee.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

On improving performance and energy profiles of sparse scientific applications 20

On improving performance and energy profiles of sparse scien...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Malkowski, Konrad Lee, Ingyu Raghavan, Padma Irwin, Mary Jane Department of Computer Science and Engineering Pennsylvania State University University Park PA 16802 United States

ISBN: (纸本)1424400546

In many scientific applications, the majority of the execution time is spent within a few basic sparse kernels such as sparse matrix vector multiplication (SMV). Such sparse kernels can utilize only a fraction of the available processing speed because of their relatively large number of data accesses per floating point operation, and limited data locality and data re-use. Algorithmic changes and tuning of codes through blocking and loop unrolling schemes can improve performance but such tuned versions are typically not available in benchmark suites such as the SPEC CFP 2000. In this paper, we consider sparse SMV kernels with different levels of tuning that are representative of this application space. We emulate certain memory subsystem optimizations using SimpleScalar and Wattch to evaluate improvements in performance and energy metrics. We also characterize how such an evaluation can be affected by the interplay between code tuning and memory subsystem optimizations. Our results indicate that the optimizations reduce execution time by over 40%, and the energy by over 85%, when used with power control modes of CPUs and caches. Furthermore, the relative impact of the same set of memory subsystem optimizations can vary significantly depending on the level of code tuning. Consequently, it may be appropriate to augment traditional benchmarks by tuned kernels typical of high performance sparse scientific codes to enable comprehensive evaluations of future systems. © 2006 ieee.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A service differentiation mechanism for improving the performance of ieee 802.15.4 sensor networks 4th

引用

4th international symposium on parallel and distributed processing and applications

作者： Kim, Tae-Yoon Youm, Sungkwan Kim, Eui-Jik Kang, Chul-Hee Korea Univ Dept Elect Engn 15a GaAnam Dong Seoul 136701 South Korea Samsung Elect Co LTD Suwon South Korea

ISBN: (纸本)9783540680673

In the sensor networks, each device generates data of different sizes in the home networking and the industrial application according to their roles in the networks. In this paper, we propose a mechanism that provides differentiated services for the ieee 802.15.4 sensor networks to improve the total throughput and the fairness of the channel. To provide differentiated services for each and every device, our mechanism adds different sizes of backoff period according to the size of packet that is generated by the device. the mathematical model based on the discrete-time Markov chain is presented and is analyzed to measure the performances of the proposed mechanism. Simulation results are also given to verify the accuracy of the analytical model. Finally, the analytical results show the improvement in the throughput and the fairness of the network which applies our mechanism.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of scheduling applications with DAG topologies on multiclusters with independent local schedulers 20

Performance evaluation of scheduling applications with DAG t...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： He, Ligang Jarvis, Stephen A. Spooner, Daniel P. Nudd, Graham R. Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom

ISBN: (纸本)1424400546

Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG-based application) to be executed at each computational resource are determined. the tasks are then sent to the corresponding resources, where they are orchestrated in the pre-designed pattern to complete the work. Most DAG mapping policies in the literature assume that each computational resource is a processing node of a single processor, i.e. the tasks mapped to a resource are to be run in sequence. Our studies demonstrate that if the resource is actually a cluster with multiple processing nodes, this assumption will cause a misperception in the tasks' execution time and execution order. this will disturb the pre-designed cooperation among tasks so that the expected performance cannot be achieved. In this paper, a DAG mapping algorithm is presented for multicluster architectures. Each constituent cluster in the multicluster is shared by background work-load (from other users) and has its own independent local scheduler. the multicluster DAG mapping policy is based on theoretical analysis and its performance is evaluated through extensive experimental studies. the results show that compared with conventional DAG mapping policies, the new scheme that we present can significantly improve the scheduling performance of a DAG-based application in terms of the schedule length*. © 2006 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

OVIS: A tool for intelligent, real-time monitoring of computational clusters 20

OVIS: A tool for intelligent, real-time monitoring of comput...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Brandt, J.M. Gentile, A.C. Hale, D.J. Pébay, P.P. Sandia National Laboratories Livermore CA 94550 United States

ISBN: (纸本)1424400546

Traditional cluster monitoring approaches consider nodes in singleton, using manufacturer-specified extreme limits as thresholds for failure "prediction". We have developed a tool, OVIS, for monitoring and analysis of large computational platforms which, instead, uses a statistical approach to characterize single device behaviors from those of a large number of statistically similar devices. Baseline capabilities of OVIS include the visual display of deterministic information about state variables (e.g., temperature, CPU utilization, fan speed) and their aggregate statistics. Visual consideration of the cluster as a comparative ensemble, rather than as singleton nodes, is an easy and useful method for tuning cluster configuration and determining effects of real-time changes. Additionally, OVIS incorporates a novel Bayesian inference scheme to dynamically infer models for the normal behavior of a system and to determine bounds on the probability of values evinced in the system. Individual node values that are unlikely given the current applicable model are flagged as aberrant. this can be a much earlier indicator of problems than waiting for the crossing of some threshold that is necessarily set high to preclude too many false alarms. We present OVIS and discuss its applications in cluster configuration and environmental tuning and to abnormality and problem discovery in our production clusters. © 2006 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 173 174 175 176 177 178 179 180 181 182 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：