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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

660 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

检索条件"任意字段=18th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 660 条记录，以下是351-360 订阅

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

详细简洁

排序：

Self-Stabilizing Micro Controller for Large-Scale Sensor Networks in Spite of Program Counter Corruptions Due to Soft Errors

Self-Stabilizing Micro Controller for Large-Scale Sensor Net...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Christopher Boelmann Torben Weis Michael Engel Arno Wacker Distributed Systems Group University of Duisburg-Essen Duisburg Germany Design Automation for Embedded Systems Group TU Dortmund University Dortmund Germany Software-engineering for Ubiquitous-Computing Applications University of Kassel Kassel Germany

For large installations of networked embedded systems it is important that each entity is self-stabilizing, because usually there is nobody to restart nodes that have hung up. Self-stabilization means to recover from temporary failures (soft errors) and adapt to a change of network topology caused by permanent failures. On the software side self-stabilizing algorithms must assume that the hardware is executing the software correctly. In this paper we discuss cases in which soft errors invalidate this assumption, especially in cases where CPU registers or the watchdog timer are affected by the fault. Based on the observation that a guaranteed self-stabilization is only possible as long as the watchdog-timer is working properly after temporary failures, we propose and compare three different approaches that meet the requirements of sensor networks, to solve this problem with a combination of hardware- and software-modifications: 1) A run-time verification of every watchdog access 2) A completely hardware-based approach, without any software modifications 3) A 2 X byte code alignment, to realign a corrupted program counter Furthermore we determine the average code-size increase and evaluate necessary hardware-modifications that come along with each approach.

关键词： Registers Hardware Random access memory Read only memory Microprocessors Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Workload Characteristic Oriented Scheduler for MapReduce

Workload Characteristic Oriented Scheduler for MapReduce

引用

international conference on parallel and distributed systems (ICPADS)

作者： Peng Lu Young Choon Lee Chen Wang Bing Bing Zhou Junliang Chen Albert Y. Zomaya Center for Distributed and High Performance Computing The University of Sydney NSW Australia CSIRO ICT Center Epping NSW Australia

Applications in many areas are increasingly developed and ported using the Map Reduce framework (more specifically, Hadoop) to exploit (data) parallelism. the application scope of Map Reduce has been extended beyond the original design goal which was large-scale data processing. this extension inherently makes a need for scheduler to explicitly take into account characteristics of job for two main goals of efficient resource use and performance improvement. In this paper, we study Map Reduce scheduling strategies to effectively deal with different workload characteristics CPU intensive and I/O intensive. We present the Workload Characteristic Oriented Scheduler (WCO), which strives for co-locating tasks of possibly different Map Reduce jobs with complementing resource usage characteristics. WCO is characterized by its essentially dynamic and adaptive scheduling decisions using information obtained from its characteristic estimator. Workload characteristics of tasks are primarily estimated by sampling with the help of some static task selection strategies, e.g., Java byte code analysis. Results obtained from extensive experiments using 11 benchmarks in a 4-node local cluster and a 51-node Amazon EC2 cluster show 17% performance improvement on average in terms of throughput in the situation of co-existing diverse workloads.

关键词： Benchmark testing Heart beat throughput Resource management Estimation Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

A Non-Intrusive Read-Copy-Update for UTS

A Non-Intrusive Read-Copy-Update for UTS

引用

international conference on parallel and distributed systems (ICPADS)

作者： Andrej Podzimek Martin Decký Lubomír Bulej Petr Tuma Department of Distributed an Dependable Systems Faculty of Mathematics and Physics Charles University in Prague Dept. of Distrib. an Dependable Syst. Charles Univ. in Prague Prague Czech Republic Univerzita Karlova Praha CZ

Read-Copy-Update (RCU) is a mechanism designed to increase the level of concurrency in readers-writer synchronization scenarios, vastly improving scalability of software running on multiprocessor machines. Most existing RCU variants have been developed for and studied within the Linux kernel. Due to strong dependency on the Linux internals, they cannot be easily transferred to other operating system kernels. this paper presents a novel non-intrusive variant of the RCU mechanism (AP-RCU), which depends only on basic kernel-level concepts while maintaining the scalability benefits. We have implemented AP-RCU in the Solaris kernel (UTS) and experimentally confirmed the expected benefits over traditional forms of synchronization, comparable with previous RCU implementations.

关键词： Kernel Linux Synchronization Context Radiation detectors Instruction sets

来源：评论

学校读者我要写书评

暂无评论

Estimation of maximum allowable time-delay bound for system stability of network controlled parallel DC/DC buck converters

Estimation of maximum allowable time-delay bound for system ...

引用

international conference on Automation and computing (ICAC)

作者： Ashraf Khalil Jihong Wang School of Electrical Electronic and Computer Engineering University of Birmingham Birmingham UK School of Engineering University of Warwick Coventry UK

the current trend in distributed energy system control is moving toward implementing quasi-decentralized control strategy where the control signals are exchanged over shared dedicated control or communication networks which reduces the complexity in the wiring and enhances the reliability. Transmitting control signals through shared networks induces time delays and data losses which may destabilize the system. So it is important to identify what the maximum allowable delay bound (MADB) can be tolerant with respect to system stability. the paper proposes a new method for estimating the allowable time delay under which the system stability can be maintained. the proposed method is originated from analyzing the network controlled parallel DC/DC Buck converters. the influences of the system parameters and controllers on the boundary of the MADB are studied. Simulation using Matlab SimPowerSystem Toolbox is performed to verify the stability bound determined by the MADB. the results are compared with the methods previously reported in the literature and the new method is proved to be simpler in estimation procedures and easier in applications to practical systems.

关键词： Delay effects Voltage control DC-DC power converters Stability analysis Control systems Master-slave Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization of a parallel, Two Stage Stochastic Linear Program

Performance Optimization of a Parallel, Two Stage Stochastic...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Akhil Langer Ramprasad Venkataraman Udatta Palekar Laxmikant Kale Steven Baker Dept of Computer Science University of Illinois at Urbana-Champaign College of Business University of Illinois at Urbana-Champaign MITRE Corporation

Stochastic optimization is used in several high impact contexts to provide optimal solutions in the face of uncertainties. this paper explores the parallelization of two-stage stochastic resource allocation problems that seek an optimal solution in the first stage, while accounting for sudden changes in resource requirements by evaluating multiple possible scenarios in the second stage. Unlike typical scientific computing algorithms, linear programs (which are the individual grains of computation in our parallel design) have unpredictable and long execution times. this confounds both a priori load distribution as well as persistence-based dynamic load balancing techniques. We present a master-worker decomposition coupled with a pull-based work assignment scheme for load balance. We discuss some of the challenges encountered in optimizing both the master and the worker portions of the computations, and techniques to address them. Of note are cut retirement schemes for balancing memory requirements with duplicated worker computation, and scenario clustering for accelerating the evaluation of similar scenarios. We base our work in the context of a real application: the optimization of US military aircraft allocation to various cargo and personnel movement missions in the face of uncertain demands. We demonstrate scaling up to 122 cores of an intel 64 cluster, even for very small, but representative datasets. Our decision to eschew problem-specific decompositions has resulted in a parallel infrastructure that should be easily adapted to other similar problems. Similarly, we believe the techniques developed in this paper will be generally applicable to other contexts that require quick solutions to stochastic optimization problems.

关键词： Resource management Aircraft Optimization Stochastic processes Military aircraft Atmospheric modeling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Accelerating Cost Aggregation for Real-Time Stereo Matching

Accelerating Cost Aggregation for Real-Time Stereo Matching

引用

international conference on parallel and distributed systems (ICPADS)

作者： Jianbin Fang Ana Lucia Varbanescu Jie Shen Henk Sips Gorkem Saygili Laurens Van Der Maaten Parallel and Distributed Systems Group Pattern Recognition and Bioinformatics Group Delft University of Technology Delft The Netherlands

Real-time stereo matching, which is important in many applications like self-driving cars and 3-D scene reconstruction, requires large computation capability and high memory bandwidth. the most time-consuming part of stereo-matching algorithms is the aggregation of information (i.e. costs) over local image regions. In this paper, we present a generic representation and suitable implementations for three commonly used cost aggregators on many-core processors. We perform typical optimizations on the kernels, which leads to significant performance improvement (up to two orders of magnitude). Finally, we present a performance model for the three aggregators to predict the aggregation speed for a given pair of input images on a given architecture. Experimental results validate our model with an acceptable error margin (an average of 10.4%). We conclude that GPU-like many-cores are excellent platforms for accelerating stereo matching.

关键词： Kernel Optimization Memory management Acceleration Venus Graphics processing units Image color analysis

来源：评论

学校读者我要写书评

暂无评论

parallel Secondo: Boosting Database Engines with Hadoop

Parallel Secondo: Boosting Database Engines with Hadoop

引用

international conference on parallel and distributed systems (ICPADS)

作者： Jiamin Lu Ralf Hartmut Güting Faculty of Mathematics and Computer Science FernUniversität Hagen Hagen Germany

Hadoop is an efficient and simple parallel framework following the Map Reduce paradigm, and making the parallel processing recently become a hot issue in data-intensive applications. Since Hadoop can be easily deployed on large-scale clusters including up to thousands of computers, various studies intend to process common relational database operations also on this new platform and expect to achieve a remarkable performance. However, these works have to prepare customized programs according to different input format, making the communication between co-workers difficult. Additionally, all intermediate data have to be transformed to key-value pairs and then transferred through the underlying HDFS, making the data processable by Map and Reduce tasks and keeping a balanced workload on the cluster. During this period, unnecessary overhead decreases both the speed-up and scale-up of these systems. therefore, this paper attempts to propose a light and efficient coupling structure thus to combine Hadoop with single-computer databases on the engine level. On one hand, it uses a well-designed parallel data model to make end-users represent parallel queries like common queries. All current and future data types and algorithms can be used directly, having no need to be specifically changed for the parallel platform. On the other hand, it provides a simple and independent distributed file system to transfer data among database engines directly, without passing through HDFS, hence to remove as much as possible unnecessary transform and transfer overhead. For purpose of demonstration, a prototype parallel Secondo is introduced in this paper. It has been fully evaluated in both small and large scale clusters, achieving satisfactory performances for different database operations.

关键词： Servers distributed databases Computers Engines Trajectory Distribution functions

来源：评论

学校读者我要写书评

暂无评论

From a Store-Collect Object and Ω to Efficient Asynchronous Consensus

引用

18th international conference on Euro-Par parallel Processing

作者： Raynal, Michel Stainer, Julien Institut Universitaire de France France IRISA Université de Rennes 1 France

ISBN: (纸本)9783642328206

this paper presents an efficient algorithm that build a consensus object. this algorithm is based on an Omega failure detector (to obtain consensus liveness) and a store-collect object (to maintain its safety). A store-collect object provides the processes with two operations, a store operation which allows the invoking process to deposit a new value while discarding the previous value it has deposited and a collect operation that returns to the invoking process a set of pairs (i, val) where val is the last value deposited by the process p(i). A store-collect object has no sequential specification. While store-collect objects have been used as base objects to design wait-free constructions of more sophisticated objects (such as snapshot or renaming objects), as far as we know, they have not been explicitly used to built consensus objects. the proposed store-collect-based algorithm, which is round-based, has several noteworthy features. First it uses a single store-collect object (and not an object per round). Second, during a round, a process invokes at most once the store operation and the value val it deposits is a simple pair < r,v > where r is a round number and v a proposed value. third, a process is directed to skip rounds according to its view of the current global state (thereby saving useless computation rounds). Finally, the algorithm benefits from the adaptive wait-free implementations that have been proposed for store-collect objects, namely, the number of shared memory accesses involved in a collect operation is O(k) where k is the number of processes that have invoked the store operation. this makes the proposed algorithm particularly efficient and interesting for multiprocess programs made up of asynchronous crash-prone processes that run on top of multicore architectures.

关键词： Asynchronous shared memory system Building block Concurrent object Consensus distributed algorithm Eventual leader Failure detector Fault-tolerance Modularity Multicore systems Process crash Store-collect object

来源：评论

学校读者我要写书评

暂无评论

An Implementation of parallel 1-D FFT on the K Computer

An Implementation of Parallel 1-D FFT on the K Computer

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Daisuke Takahashi Atsuya Uno Mitsuo Yokokawa Faculty of Engineering Information and Systems University of Tsukuba Tsukuba Ibaraki Japan Rikagaku Kenkyujo Yokohama Campus Yokohama Kanagawa JP

In this paper, we propose an implementation of a parallel one-dimensional fast Fourier transform (FFT) on the K computer. the proposed algorithm is based on the six-step FFT algorithm, which can be altered into the recursive six-step FFT algorithm to reduce the number of cache misses. the recursive six-step FFT algorithm improves performance by utilizing the cache memory effectively. We use the recursive six-step FFT algorithm to implement the parallel one-dimensional FFT algorithm. the performance results of one-dimensional FFTs on the K computer are reported. We successfully achieved a performance of over 18 TFlops on 8192 nodes of the K computer (82944 nodes, 128 GFlops/node, 10.6 PFlops peak performance) for a 2 41 -point FFT.

关键词： Computers Arrays Registers Equations Indexes Kernel distributed databases

来源：评论

学校读者我要写书评

暂无评论

Invasive programming as a concept for HPC

Invasive programming as a concept for HPC

引用

10th iasted international conference on parallel and distributed computing and Networks, PDCN 2011

作者： Bader, Michael Bungartz, Hans-Joachim Gerndt, Michael Hollmann, Andreas Weidendorfer, Josef Institute for Parallel and Distributed Systems Universität Stuttgart Universitätsstr. 38 70569 Stuttgart Germany Institute for Informatics Technische Universität München Boltzmannstr. 3 85748 Garching Germany

ISBN: (纸本)9780889868649

this paper introduces invasive computing, a new paradigm for programming parallel architectures. the goals are to enable the development and execution of resource aware programs that can dynamically allocate and free new resources in phases with more parallelism. To allocate more resources, applications use the invade operation and to free them the retreat. the research is conducted within the framework of the Transregional Collaborative Research Centre 89 funded by the German Science Foundation.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：