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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

983 篇 会议
24 篇 期刊文献
13 册 图书

馆藏范围

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

日期分布

学科分类号

791 篇 工学
- 761 篇 计算机科学与技术...
- 488 篇 软件工程
- 216 篇 信息与通信工程
- 97 篇 电气工程
- 78 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 18 篇 机械工程
- 15 篇 生物工程
- 13 篇 仪器科学与技术
- 13 篇 生物医学工程（可授...
- 12 篇 动力工程及工程热...
- 11 篇 安全科学与工程
- 10 篇 测绘科学与技术
- 9 篇 建筑学
- 8 篇 光学工程
- 7 篇 土木工程
- 7 篇 环境科学与工程（可...
- 6 篇 力学（可授工学、理...
- 6 篇 化学工程与技术
244 篇 理学
- 186 篇 数学
- 29 篇 系统科学
- 29 篇 统计学（可授理学、...
- 25 篇 生物学
- 21 篇 物理学
- 11 篇 化学
201 篇 管理学
- 154 篇 管理科学与工程(可...
- 89 篇 工商管理
- 56 篇 图书情报与档案管...
10 篇 经济学
- 10 篇 应用经济学
7 篇 教育学
- 7 篇 教育学
6 篇 法学
5 篇 农学
5 篇 医学
3 篇 文学
1 篇 军事学

主题

96 篇 distributed comp...
71 篇 cloud computing
68 篇 parallel process...
34 篇 parallel process...
33 篇 computational mo...
31 篇 grid computing
29 篇 servers
27 篇 distributed comp...
24 篇 fault tolerance
23 篇 peer to peer com...
21 篇 computer archite...
21 篇 distributed syst...
18 篇 parallel computi...
18 篇 distributed data...
16 篇 graphics process...
15 篇 mapreduce
15 篇 synchronization
14 篇 parallel algorit...
14 篇 parallel program...
13 篇 resource managem...

机构

5 篇 school of automa...
5 篇 national cims en...
5 篇 academic center ...
5 篇 department of in...
5 篇 school of mechat...
4 篇 school of comput...
4 篇 institute of com...
3 篇 a*star institute...
3 篇 school of comput...
3 篇 topic committee ...
2 篇 disca univ. poli...
2 篇 abou bekr belkai...
2 篇 department of co...
2 篇 national institu...
2 篇 hong kong polyte...
2 篇 institute of par...
2 篇 chinese acad sci...
2 篇 institute of par...
2 篇 ibnu sina instit...
2 篇 tsinghua univ de...

作者

5 篇 tianyuan xiao
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 lin zhang
5 篇 rothermel kurt
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
5 篇 li xiaorong
4 篇 matsumoto masaki
4 篇 beferull-lozano ...
4 篇 akl selim g.
4 篇 andresen daniel
3 篇 jakovits pelle
3 篇 dongarra jack
3 篇 kawamura takao
3 篇 shu jiwu
3 篇 vlassov vladimir
3 篇 rajkumar buyya
3 篇 tziritas nikos

语言

1,000 篇 英文
19 篇 其他
1 篇 中文

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2012"

共 1020 条记录，以下是1011-1020 订阅

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

详细简洁

排序：

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks

Approximation algorithms for deployment of sensors for line ...

引用

international Communication systems and Networks and Workshops, COMSNETS

作者： Dinesh Dash Arijit Bishnu Arobinda Gupta Subhas C. Nandy Department of Computer Science & Engineering Indian Institute of Technology Kharagpur India Advanced Computing and Microelectronics Unit Indian Statistical Institute India

The coverage problem in wireless sensor network deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments with minimum number of sensors. A line segment ℓ is said to be 1-covered if it intersects the sensing region of at least one among the sensors distributed in a bounded rectangular region R. We assume that the sensing radius of each sensor is uniform. The problem of finding the minimum number of sensors needed to 1-cover each member in a given set of line segments in R is NP-hard. We propose two constant factor approximation algorithms and a PTAS (Polynomial Time Approximation Scheme) for the problem for 1-covering a set of axis-parallel line segments. We also show that a PTAS exists for 1-covering a set of arbitrarily oriented line segments in R where the length of the line segments are bounded within a constant factor of the sensing radius of each sensor.

关键词： Sensors Approximation methods Strips Approximation algorithms Wireless sensor networks Roads Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Reliable Provisioning of Spot Instances for Compute-intensive Applications

Reliable Provisioning of Spot Instances for Compute-intensiv...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： William Voorsluys Rajkumar Buyya Cloud Computing and Distributed Systems (CLOUDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Cloud computing providers are now offering their unused resources for leasing in the spot market, which has been considered the first step towards a full-fledged market economy for computational resources. Spot instances are virtual machines (VMs) available at lower prices than their standard on-demand counterparts. These VMs will run for as long as the current price is lower than the maximum bid price users are willing to pay per hour. Spot instances have been increasingly used for executing compute-intensive applications. In spite of an apparent economical advantage, due to an intermittent nature of biddable resources, application execution times may be prolonged or they may not finish at all. This paper proposes a resource allocation strategy that addresses the problem of running compute-intensive jobs on a pool of intermittent virtual machines, while also aiming to run applications in a fast and economical way. To mitigate potential unavailability periods, a multifaceted fault-aware resource provisioning policy is proposed. Our solution employs price and runtime estimation mechanisms, as well as three fault-tolerance techniques, namely check pointing, task duplication and migration. We evaluate our strategies using trace-driven simulations, which take as input real price variation traces, as well as an application trace from the parallel Workload Archive. Our results demonstrate the effectiveness of executing applications on spot instances, respecting QoS constraints, despite occasional failures.

关键词： Fault tolerance Fault tolerant systems Checkpointing Runtime Virtual machining Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Multi-attribute resource discovery mechanism using bitmaps on HPGRID system

Multi-attribute resource discovery mechanism using bitmaps o...

引用

international conference on Recent Trends in Information Technology (ICRTIT)

作者： R. Lavanya C. Linta D. Doreen Hephzibah Miriam Sri Venkateswara College of Engineering Chennai Sri Venkateswara College of Engineering Chennai India

Grid computing refers to the sharing of geographically distributed resources in order to accomplish a desired task. Grids are more secure and enable the job to be broken into chunks, each being executed in a parallel way. Computational Grids serve the purpose of processing a submitted job by finding the required resource from the grid. In implementing computational grids, resource discovery and task scheduling play a major role. Discovery of resources should be done at a minimum cost, avoiding the traversal to unnecessary nodes. Many approaches have been proposed in this area. In this paper, we propose the use of a three-layered, hierarchical, weighted tree structure with bitmaps representing the resources available at each node updated in a way to help the user to make a multi-attribute query. The higher level nodes are put together to form a structured Hyper Cube, resulting in a peer-to-peer fault tolerant and scalable system. Our proposed algorithm outperforms the other resource discovery mechanisms by drastically reducing the number of hops required and also avoiding traversal to unnecessary nodes in the tree. It is a more dynamic and fault tolerant resource discovery mechanism for peer-to-peer grids.

关键词： Peer to peer computing Fault tolerance Fault tolerant systems Radiation detectors Servers Educational institutions Organizations

来源：评论

学校读者我要写书评

暂无评论

Applications of Evolutionary Computation 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Cecilia Chio Alexandros Agapitos Stefano Cagnoni Carlos Cotta Francisco Fernández Vega Gianni A. Caro Rolf Drechsler Anikó Ekárt Anna I. Esparcia-Alcázar Muddassar Farooq William B. Langdon Juan J. Merelo-Guervós Mike Preuss Hendrik Richter Sara Silva Anabela Simões Giovanni Squillero Ernesto Tarantino Andrea G. B. Tettamanzi Julian Togelius Neil Urquhart A. Şima Uyar Georgios N. Yannakakis

ISBN: (数字)9783642291784

ISBN: (纸本)9783642291777

This book constitutes the refereed proceedings of the international conference on the Applications of Evolutionary Computation, EvoApplications 2012, held in Málaga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoCOP, EvoBIO, and EvoMUSART. The 54 revised full papers presented were carefully reviewed and selected from 90 submissions. EvoApplications 2012 consisted of the following 11 tracks: EvoCOMNET (nature-inspired techniques for telecommunication networks and other parrallel and distributed systems), EvoCOMPLEX (algorithms and complex systems), EvoFIN (evolutionary and natural computation in finance and economics), EvoGAMES (bio-inspired algorithms in games), EvoHOT (bio-inspired heuristics for design automation), EvoIASP (evolutionary computation in image analysis and signal processing), EvoNUM (bio-inspired algorithms for continuous parameter optimization), EvoPAR (parallel implementation of evolutionary algorithms), EvoRISK (computational intelligence for risk management, security and defense applications), EvoSTIM (nature-inspired techniques in scheduling, planning, and timetabling), and EvoSTOC (evolutionary algorithms in stochastic and dynamic environments).

关键词： Computation by Abstract Devices Programming Techniques Computer Communication Networks Math Applications in Computer Science Image Processing and Computer Vision Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Synchronising Service Compositions in Dynamic Ad Hoc Environments

Synchronising Service Compositions in Dynamic Ad Hoc Environ...

引用

IEEE international conference on Mobile Services (MS)

作者： Christin Groba Siobh'n Clarke Distributed Systems Group School of Computer Science and StatisticsLero Graduate School of Software Engineering Trinity College Dublin Ireland

Service compositions in dynamic ad hoc environments face frequent changes in the network and service topology. Late service binding is a way to adapt to runtime changes but requires additional communication over error-prone and energy-constrained networks. In particular, synchronising parallel service flows relies on steady message exchange when mutually unknown service providers have to agree on a common merge node. Binding the merge node early through a single entity reduces the need for coordination. However, it compromises flexibility and may nonetheless increase communication as the decision entity has only partial view of the system. This paper proposes a multi-party late binding protocol as a solution for flexible, communication-aware service composition in dynamic ad hoc environments. The protocol integrates the discovery of unknown synchronisation partners with the exchange of binding suggestions to reduce communication. We embed this protocol in our model for opportunistic service composition and evaluate it against an early binding approach. Simulation results show that while being overall equally successful, late service binding outperforms early binding with respect to communication overhead and response time.

关键词： Peer to peer computing Synchronization Protocols Runtime Routing Ad hoc networks Noise

来源：评论

学校读者我要写书评

暂无评论

Optimizing Overlay-based Virtual Networking Through Optimistic Interrupts and Cut-through Forwarding 12

Optimizing Overlay-based Virtual Networking Through Optimist...

引用

ACM/IEEE international conference for High Performance computing, Networking, Storage, and Analysis

作者： Zheng Cui Lei Xia Patrick G. Bridges Peter A. Dinda John R. Lange Department of Computer Science University of New Mexico Albuquerque NM 87131 USA Department of EECS Northwestern University Evanston IL 60208 USA Department of Computer Science University of Pittsburgh Pittsburgh PA 15260 USA

ISBN: (纸本)9781467308052

Overlay-based virtual networking provides a powerful model for realizing virtual distributed and parallel computing systems with strong isolation, portability, and recoverability properties. However, in extremely high throughput and low latency networks, such overlays can suffer from bandwidth and latency limitations, which is of particular concern if we want to apply the model in HPC environments. Through careful study of an existing very high performance overlay-based virtual network system, we have identified two core issues limiting performance: delayed and/or excessive virtual interrupt delivery into guests, and copies between host and guest data buffers done during encapsulation. We respond with two novel optimizations: optimistic, timer-free virtual interrupt injection, and zero-copy cut-through data forwarding. These optimizations improve the latency and bandwidth of the overlay network on 10 Gbps interconnects, resulting in near-native performance for a wide range of microbenchmarks and MPI application benchmarks.

关键词： Cut-through Forwarding HPC MPI High Performance computing message passing mannose phosphate isomerase remote procedure calls interruption overlay network cut-through Bandwidth Latency Virtual

来源：评论

学校读者我要写书评

暂无评论

Cooperative VM migration for a virtualized HPC cluster with VMM-bypass I/O devices

Cooperative VM migration for a virtualized HPC cluster with ...

引用

IEEE international conference on e-Science and Grid computing

作者： Ryousei Takano Hidemoto Nakada Takahiro Hirofuchi Yoshio Tanaka Tomohiro Kudoh National Institute of Advanced Industrial Science and Technology (AIST) Tsukuba Ibaraki Japan

An HPC cloud, a flexible and robust cloud computing service specially dedicated to high performance computing, is a promising future e-Science platform. In cloud computing, virtualization is widely used to achieve flexibility and security. Virtualization makes migration or checkpoint/restart of computing elements (virtual machines) easy, and such features are useful for realizing fault tolerance and server consolidations. However, in widely used virtualization schemes, I/O devices are also virtualized, and thus I/O performance is severely degraded. To cope with this problem, VMM-bypass I/O technologies, including PCI passthrough and SR-IOV, in which the I/O overhead can be significantly reduced, have been introduced. However, such VMM-bypass I/O technologies make it impossible to migrate or checkpoint/restart virtual machines, since virtual machines are directly attached to hardware devices. This paper proposes a novel and practical mechanism, called Symbiotic Virtualization (SymVirt), for enabling migration and checkpoint/restart on a virtualized cluster with VMM-bypass I/O devices, without the virtualization overhead during normal operations. SymVirt allows a VMM to cooperate with a message passing layer on the guest OS, then it realizes VM-level migration and checkpoint/restart by using a combination of a PCI hotplug and coordination of distributed VMMs. We have implemented the proposed mechanism on top of QEMU/KVM and the Open MPI system. All PCI devices, including Infiniband and Myrinet, are supported without implementing specific para-virtualized drivers; and it is not necessary to modify either of the MPI runtime and applications. Using the proposed mechanism, we demonstrate reactive and proactive FT mechanisms on a virtualized Infiniband cluster. We have confirmed the effectiveness using both a memory intensive micro benchmark and the NAS parallel benchmark. Moreover, we also show that postcopy live migration enables us to reduce the down time of an applicat

关键词： Virtual machining Benchmark testing Cloud computing Fault tolerance Fault tolerant systems Virtual machine monitors

来源：评论

学校读者我要写书评

暂无评论

parallel Processing Policy Study on the Information Distribution based on Information Grid

Parallel Processing Policy Study on the Information Distribu...

引用

2012 international conference on Mechanical Engineering and Automation(ICMEA2012)

作者： FAN Xing1, ZHANG Guo-ping1 and XIA Xue-zhi1 1Wuhan Digital Engineering Institute, Wuhan, China

As the battlefield awareness capability increasingly grows, the information processing requirements on single platform increases significantly to such a degree that the information processing capability of current equipments can not meet the requirements. To improve the C4ISR system’s ability to deal with intelligence combined with the research of maritime information system, using a cross-platform multi-distributed system of information processing systems and methods. The method is to design a dynamic load balancing algorithm to deal with intelligence. And the foundations of this method are the intelligence-based Fragment strategy based on the load-balancing principle and the scheduling-improved algorithm based on the Backfilling strategy. The improved scheduling algorithm mainly takes into the effect, on which the time-delay of dealing with task, task scheduling and communications to task scheduling;Information processing algorithm have solved the problem, of which need to be dialed with in the multi-system dynamic changes, the unbalance of computing nodes load appeared. The results show that the information processing method has been improved, in the field of the reduction information processing delay and the increase of the ratio of parallel processing.

关键词： Information grid Intelligence processing Slicing policy Scheduling method Dynamic Load balancing

来源：评论

学校读者我要写书评

暂无评论

Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic Approach

Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic...

引用

international conference on Data Engineering

作者： Wenwen Qu Weixi Zhang Ji Cheng Chaorui Zhang Wei Han Bo Bai Chen Jason Zhang Liang He Xiaoling Wang East China Normal University Shanghai China Hong Kong Polytechnic University Theory Lab Central Research Institute 2012 Labs Huawei Technologies Co. Ltd Hong Kong China

Graph partitioning is crucial in distributed graph-parallel computing systems, and it is challenging for graph partitioning to optimize the communication cost and load balancing together. Existing state-of-the-art works, such as Powerlyra and TopoX, optimize the load balancing by randomly distributing the edges of high-degree vertices, which inevitably brings a high communication cost that is unbounded. This paper proposes a graph partition model that can minimize communication cost while maximizing load balancing. More specifically, we model the graph partition as the combinatorial design problem. Our proposed model can provide high-quality partition that guarantees that the computing load can be evenly distributed to each worker and minimizes the communication cost with a near-optimal theoretical *** on the proposed model, we extend the hybrid-cut partitioning algorithm for the power-law graph and propose HCPD, a hybrid-cut partitioning algorithm based on combinatorial design. HCPD uses the proposed model to optimize the load balancing and communication cost simultaneously for high-degree vertices, and assigns the high-degree vertices and their low-degree neighbors to the same workers by label propagation to reduce the overall communication cost. In this way, we partition the low-degree and high-degree vertices holistically and further improve the partition quality, unlike Powerlyra and TopoX, which deal with the two parts independently. Our experiments show that HCPD outperforms Powerlyra on PageRank task by up to 2× faster on real-world power-law graphs with billions of edges.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Versatile Modular Hardware Platform for distributed Large-Scale Real-Time Simulation

A Versatile Modular Hardware Platform for Distributed Large-...

引用

international Power Electronics and Motion Control conference

作者： F. Adler H. Stagge R. W. De Doncker Institute for Power Generation and Storage Systems (PGS) RWTH Aachen University

ISBN: (纸本)9781467319706

A new versatile and modular hardware platform for distributed real-time simulation is presented in this paper. The system is aimed at large-scale simulation on system level but with the ability to include simulation of switched power electronics for hardware-in-the-loop components connected to single nodes of the simulated system. High complexity is possible through parallelization on the system level to account for large numbers of simulated components. Low time-steps are possible through parallelization on chip-level to offer parallel computation aided by field-programmable gate array devices. Processor boards handle the simulation of subcomponents and are interconnected to build the large-scale systems. Hardware-in-the-loop connection is provided in a flexible yet powerful way by dedicated interface boards connected to a controlling processor board. A backplane with active routing capability is used to handle low-latency communication throughout the simulation platform. A small-scale system simulating an example buck converter with a time-step of 1 μs is presented to show the functionality of the simulation platform.

关键词： Real time systems Field programmable gate array distributed computing Hardware-in-the-loop

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 93 94 95 96 97 98 99 100 101 102 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：