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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,037 篇 会议
43 篇 期刊文献
8 册 图书

馆藏范围

1,088 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

729 篇 工学
- 674 篇 计算机科学与技术...
- 402 篇 软件工程
- 105 篇 电气工程
- 92 篇 信息与通信工程
- 83 篇 控制科学与工程
- 47 篇 电子科学与技术（可...
- 20 篇 网络空间安全
- 18 篇 机械工程
- 8 篇 光学工程
- 8 篇 土木工程
- 8 篇 化学工程与技术
- 7 篇 建筑学
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 6 篇 冶金工程
- 5 篇 材料科学与工程（可...
- 5 篇 安全科学与工程
- 4 篇 交通运输工程
162 篇 理学
- 122 篇 数学
- 36 篇 系统科学
- 18 篇 物理学
- 18 篇 统计学（可授理学、...
- 7 篇 化学
- 6 篇 生物学
110 篇 管理学
- 86 篇 管理科学与工程(可...
- 49 篇 工商管理
- 33 篇 图书情报与档案管...
14 篇 教育学
- 14 篇 教育学
12 篇 经济学
- 12 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 医学
3 篇 农学
2 篇 军事学

主题

94 篇 distributed comp...
87 篇 concurrent compu...
86 篇 parallel process...
78 篇 parallel process...
62 篇 application soft...
62 篇 distributed comp...
54 篇 computer science
53 篇 computational mo...
49 篇 fault tolerance
49 篇 hardware
45 篇 parallel program...
42 篇 computer archite...
34 篇 large-scale syst...
32 篇 computer simulat...
32 篇 real time system...
30 篇 computer network...
25 篇 message passing
25 篇 processor schedu...
24 篇 fault tolerant s...
23 篇 discrete event s...

机构

6 篇 georgia inst tec...
3 篇 school of comput...
3 篇 rensselaer polyt...
3 篇 university of fl...
2 篇 architecture and...
2 篇 open grid comput...
2 篇 univ n carolina ...
2 篇 department of co...
2 篇 georgia inst tec...
2 篇 illinois institu...
2 篇 mobile network p...
2 篇 syracuse univ sy...
2 篇 ibm canada softw...
2 篇 ibm thomas j. wa...
2 篇 distributed syst...
2 篇 institute for ro...
2 篇 universität-gh p...
2 篇 department of co...
2 篇 computer science...
2 篇 saga university

作者

6 篇 fujimoto richard...
4 篇 a. choudhary
4 篇 park alfred
4 篇 cai wentong
4 篇 siegel howard ja...
4 篇 maehle erik
3 篇 ould-khaoua moha...
3 篇 min geyong
3 篇 nicol dm
3 篇 schwan karsten
3 篇 nicol d.m.
3 篇 maciejewski anth...
3 篇 song shuaiwen le...
3 篇 liu j
3 篇 korah john
3 篇 ayani rassul
3 篇 donatiello l
3 篇 turner stephen j...
3 篇 rothermel kurt
3 篇 santos eunice e.

语言

1,085 篇 英文
2 篇 中文
1 篇 其他

检索条件"任意字段=Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems"

共 1088 条记录，以下是271-280 订阅

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

详细简洁

排序：

Optimal replication transition strategy in distributed hierarchical systems

Optimal replication transition strategy in distributed hiera...

引用

10th workshop on advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed Processing Symposium

作者： Hsu, Chun-Chen Wang, Chien-Min Liu, Pangfeng Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 10764 Taiwan Acad Sinica Inst Informat Sci Nankang Taiwan Natl Taipei Univ Grad Inst Networking & Multimedia New Taipei 23741 Taiwan

ISBN: (纸本)9781424416936

We study the replication transition problem in distributed hierarchical systems. Most distributed systems replicate data to increase data access efficiency. A replication strategy dictates where the replicas are stored in respond to the data access pattern, therefore a good strategy can effectively improve data access efficiency. However the access pattern in a distributed system is constantly changing. As a result, a good replication strategy must evolve accordingly. The replication transition problem is to seek an efficient transition from one replication strategy to another in order to cope with the dynamic access pattern. This paper focuses on solving the replication transition problem on tree topology, which is one of the most important models in Data Grid systems and web proxy systems from the literature. To the best of our knowledge, our work is the first that proposes an optimal algorithm for the replication transition problem on tree topology. The algorithm has a time complexity of O(n log Delta log(n Lambda)), where n is the number of sites, A is the maximum degree in the tree and A is the largest communication delay in the network.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Domain-specific library generation for parallel software and hardware platforms

Domain-specific library generation for parallel software and...

引用

10th workshop on advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed Processing Symposium

作者： Franchetti, Franz Voronenkol, Yevgen Milder, Peter A. Chellappa, Srinivas Telgarsky, Marek R. Shen, Hao D'Alberto, Paolo de Mesmay, Frederic Hoe, James C. Moura, Jose M. F. Puschel, Marlais Carnegie Mellon Univ Pittsburgh PA 15213 USA Tech Univ Denmark Lyngby Denmark Yahoo Inc Sunnyvale CA USA

ISBN: (纸本)9781424416936

We overview a library generation framework called Spiral. For the domain of linear transforms, Spiral automatically generates implementations for parallel platforms including SIMD vector extensions, multicore processors, field-programmable gate arrays (FPGAs) and FPGA accelerated processors. The performance of the generated code is competitive with the best available hand-written libraries.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

Self-optimizing distributed trees

Self-optimizing distributed trees

引用

10th workshop on advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed Processing Symposium

作者： Reiter, Michael K. Samar, Asad Wang, Chenxi Univ N Carolina Chapel Hill NC 27515 USA Goldman Sachs Internat London England Forrester Res Foster City CA USA

ISBN: (纸本)9781424416936

We present a novel protocol for restructuring a tree-based overlay network in response to the workload of the application running over it. Through low-cost restructuring operations, our protocol incrementally adapts the tree so as to bring nodes that tend to communicate with one another closer together in the tree. It achieves this while respecting degree bounds on nodes so that, e.g., no node degenerates into a "hub" for the overlay. Moreover it limits restructuring to those parts of the tree over which communication takes place, avoiding restructuring other parts of the tree unnecessarily. We show via experiments on PlanetLab that our protocol can significantly reduce communication latencies in workloads dominated by clusters of communicating nodes.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A linear solver for benchmarking partitioners

A linear solver for benchmarking partitioners

引用

10th workshop on advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed Processing Symposium

作者： Ghazinour, Kambiz Shaw, Ruth E. Aubanel, Eric Garey, Larry E. Univ New Brunswick Dept Comp Sci & Appl Stat St John NB E2L 4L5 Canada Univ New Brunswick Dept Comp Sci Fredericton NB E3B 5A3 Canada

ISBN: (纸本)9781424416936

A number of graph partitioners are currently available for solving linear systems on parallel computers. Partitioning algorithms divide the graph that arises from the linear system into a specified number of partitions such that the workload per processor is balanced and the communication between the processors is minimized The measure of partition quality is often taken to be the number of edges cut by the partition. Ultimately the quality of a partition will be reflected in the execution time of the parallel application. In this paper, we introduce a linear solver benchmark that enables comparison of partition quality. This work also serves to motivate further work on developing benchmarks for graph partitioners.

关键词： finite element method parallel benchmark graph partitioning

来源：评论

学校读者我要写书评

暂无评论

parallel, scalable, memory-efficient backtracking for combinatorial modeling of large-scale biological systems

Parallel, scalable, memory-efficient backtracking for combin...

引用

10th workshop on advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed Processing Symposium

作者： Park, Byung-Hoon Schmidt, Matthew Thomas, Kevin Karpinets, Tatiana Samatova, Nagiza F. Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN 37831 USA N Carolina State Univ Comp Sci Dept Raleigh NC 27695 USA

ISBN: (纸本)9781424416936

Data-driven modeling of biological systems such as protein-protein interaction networks is data-intensive and combinatorially challenging. Backtracking can constrain a combinatorial search space. Yet, its recursive nature, exacerbated by dida-intensity, limits its applicability for large-scale systems. parallel, scalable, and memory-efficient backtracking is a promising approach parallel backtracking suffers from unbalanced loads. Load rebalancing via synchronization and data movement is prohibitively expensive. Balancing these discrepancies, while minimizing end-to-end execution time and memory requirements, is desirable. This paper introduces such a framework. Its scalability and efficiency, demonstrated on the maximal clique enumeration problem, are attributed to the proposed: (a) representation of search tree decomposition to enable parallelization;(b) depth-first parallel search to minimize memory requirement;(c) least stringent synchronization to minimize data movement;and (d) on-demand work stealing with stack splitting to minimize processors' idle time. The applications of this framework to real biological problems related to bioethanol production are discussed.

关键词： Biological systems

来源：评论

学校读者我要写书评

暂无评论

advances in software design methods for concurrent, real-time and distributed applications

Advances in software design methods for concurrent, real-tim...

引用

3rd International Conference on Software Engineering advances, ICSEA 2008

作者： Gomaa, Hassan Department of Computer Science George Mason University Fairfax VA 22030 United States

ISBN: (纸本)9780769533728

This paper describes the advances in software design methods for concurrent, real-time and distributed applications from structured methods for centralized systems to distributed, object-oriented, component-based and service-oriented systems and product lines. The influence of software architectural and design patterns is also described. Current challenges for designing service-oriented architectures, adaptive software design, and evolutionary software design are also discussed. © 2008 ieee.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Unified programming environment for heterogeneous distributed parallel systems

Unified programming environment for heterogeneous distribute...

引用

2008 International workshop on Innovative Architecture for Future Generation High Performance Processors and systems, IWIA'08

作者： Hirasawa, Shoichi Honda, Hiroki University of Electro-Communications/JST CREST Japan

ISBN: (纸本)9780769537702

parallel execution environment, such as the multi-core CPU, a cluster, and a grid, has spread increasingly. The change from a homogeneous core based CPU and a shared memory to the distributed memory and the heterogeneous core based CPU is making system architecture complicate. The programming interface and programming model which are different in each parallel execution environment are used. Since this serves as a burden for users, it has barred the spread of parallel execution environment. In this paper, the execution model which treats such system architecture systematically is explored. This performs the unified programming interface for heterogeneous distributed memory system architecture. © 3770 ieee.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of tabu search method for job scheduling in distributed environments

Design and evaluation of tabu search method for job scheduli...

引用

10th workshop on advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed Processing Symposium

作者： Xhafa, Fatos Carretero, Javier Alba, Enrique Dorronsoro, Bernabe Dept. of Languages and Informatics Systems Polytechnic University of Catalonia Spain Dept. of Languages and Computer Science University of Málaga Spain Faculty of Science Technology and Communication University of Luxembourg Luxembourg Luxembourg

ISBN: (纸本)9781424416936

The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications. The scheduling problem is computationally hard even when there are no dependencies among jobs. Thus, we present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We consider the job scheduling as a bi-objective optimization problem consisting of the minimization of the makespan and flowtime. The bi-objectivity is tackled through a hierarchic approach in which makespan is considered a primary objective and flowtime a secondary one. An extensive experimental study has been first conducted in order to fine-tune the parameters of our TS algorithm. Then, our tuned TS is compared versus two well known TS algorithms in the literature (one of them is hybridized with an ant colony optimization algorithm)for the problem. The computational results show that our TS implementation clearly outperforms the compared algorithms. Finally, we evaluated the performance of our TS algorithm on a new set of instances that better fits with the concept of computational grid. These instances are composed of a higher number of -heterogeneous- machines (up to 256) and emulate the dynamic behavior of these systems.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Outlier detection in performance data of parallel applications

Outlier detection in performance data of parallel applicatio...

引用

10th workshop on advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed Processing Symposium

作者： Benkert, Katharina Gabriel, Edgar Resch, Michael M. Univ Houston Dept Comp Sci Parallel Software Technol Lab Houston TX 77204 USA High Performance Comp Ctr Stuttgart HLRS D-70569 Stuttgart Germany

ISBN: (纸本)9781424416936

When an adaptive software component is employed to select the best-performing implementation for a communication operation at runtime, the correctness of the decision taken strongly depends on detecting and removing outliers in the data used for the comparison. This automatic decision is greatly complicated by the fact that the types and quantities of outliers depend on the network interconnect and the nodes assigned to the job by the batch scheduler. This paper evaluates four different statistical methods used for handling outliers, namely a standard interquartile range method, a heuristic derived from the trimmed mean value, cluster analysis and a method using robust statistics. Using performance data from the Abstract Data and Communication Library (ADCL) we evaluate the correctness of the decisions made with each statistical approach over three fundamentally different network interconnects, namely a highly reliable InfiniBand network, a Gigabit Ethernet network having a larger variance in the performance, and a hierarchical Gigabit Ethernet network.

关键词： outlier detection performance analysis adaptive communication libraries

来源：评论

学校读者我要写书评

暂无评论

引用

9th ieee/ACM International Conference on Grid Computing

作者： Kondo, Derrick Andrzejak, Artur Anderson, David P. INRIA Paris France ZIB Hamburg Germany Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781424425785

As computer networks rapidly increase in size and speed, Internet-distributed systems such as P2P, volunteer computing, and Grid systems are increasingly common. A precise and accurate characterization of Internet resources is important for the design and evaluation, of such Internet-distributed systems, yet our picture of the Internet landscape is not perfectly clear. To improve this picture, we measure and characterize the time dynamics of availability ire a large-scale Internet-distributed system with over 110,000 hosts. Our characterization focuses on identifying patterns of correlated availability. We determine scalable and accurate clustering techniques and distance metrics for automatically detecting significant availability patterns. By means of clustering, we identify groups of resources with correlated availability that exhibit similar time effects. Then, we show how these correlated clusters of resources can be used to improve resource management for parallel applications in the context of volunteer computing.

关键词： Availability Internet Distance measurement Resource management Clustering algorithms Time measurement Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共109页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：