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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,713 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,298 篇 工学
- 1,197 篇 计算机科学与技术...
- 536 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
165 篇 管理学
- 116 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

155 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
68 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 grid computing

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 shen hong
11 篇 rothermel kurt
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,724 篇 英文
30 篇 俄文
9 篇 其他
4 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1767 条记录，以下是981-990 订阅

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

详细简洁

排序：

MiriaPOD: A distributed solution for virtual network topologies management

MiriaPOD: A distributed solution for virtual network topolog...

引用

2011 10th RoEduNet international conference on Networking in Education and Research, RoEduNet 2011

作者： Costea, Sergiu Dumitrescu, Vlad Rughiniş, RǍzvan Bucicoiu, Mihai Faculty of Automatic Control and Computers University Politehnica of Bucharest Bucharest Romania

ISBN: (纸本)9781457712333

Virtualization technologies have grown steadily in the testing and educational environments, owing to their low costs for deploying a wide variety of scenarios. Many applications that provide network node virtualization face scalability problems when larger topologies are created because of their high memory and processing requirements. Although such applications offer methods for load distribution on multiple machines, the distribution must be manually set up through a cumbersome and error prone process. the miriaPOD distributed virtualization application provides an easy to use graphical topology editor that relies on a broker service to deploy virtual network nodes on multiple machines. the extensibility and scalability of the project enables its use for assessing migration scenarios and running network technologies harmonization tests. We also propose integration possibilities with the Moodle platform, positioning the miriaPOD infrastructure as a vital tool for testing and teaching networking concepts. © 2011 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Slot Selection and Co-allocation for Economic Scheduling in distributed computing

Slot Selection and Co-allocation for Economic Scheduling in ...

引用

11th international conference on parallel computing technologies

作者： Toporkov, Victor Bobchenkov, Alexander Toporkova, Anna Tselishchev, Alexey Yemelyanov, Dmitry Moscow Power Engn Inst Dept Comp Sci Ul Krasnokazarmennaya 14 Moscow 111250 Russia Moscow State Inst Elect & Math Moscow 109028 Russia CERN CH-1211 Geneva Switzerland

ISBN: (纸本)9783642231773

In this paper, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. A launch of a parallel job requires a co-allocation of a specified number of slots. the sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. this paper discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.

关键词： Scheduling co-allocation slot resource request job batch task

来源：评论

学校读者我要写书评

暂无评论

TRUSTIE: Design of a Trustworthy Software Production Environment

TRUSTIE: Design of a Trustworthy Software Production Environ...

引用

Int Joint conference of 10th IEEE Int Conf on Trust, Security and Privacy in computing and Communications (TrustCom) / 8th IEEE Int Conf on Embedded Software and Systems (ICESS) / 6th Int Conf on Frontier of Computer Science and Technology (FCST)

作者： Wang, Huaimin Natl Univ Def Technol Sch Comp Natl Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9780769546001

Internet fundamentally changes the model of software development, the demands of software quality, and the process of software resource sharing. Internetbased environment for trustworthy software production is recognized as a key topic of software engineering in both academic and software industry. In this paper, the concepts and models of trustworthy software are introduced which dominate the design of Trustie environment. Trustie provides trustworthy software components sharing by an evolving software repository, and provides collaborative software development in a customizable development platform powered by a software production line framework. Finally the layered practices of research and application based on Trustie preliminarily demonstrate the effectiveness as well as the promising future of this environment.

关键词： Collaboration Development Production Environment Trustworthy Software

来源：评论

学校读者我要写书评

暂无评论

Communication-aware task partition and voltage scaling for energy minimization on heterogeneous parallel systems

Communication-aware task partition and voltage scaling for e...

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Wang, Guibin Song, Wei National Laboratory for Parallel and Distributed Processing National University of Defense Technology China

ISBN: (纸本)9780769545646

Heterogeneous parallel systems have become popular in general purpose computing and even high performance computing fields. there are many studies focused on harnessing heterogeneous parallel processing for better performance. However the energy optimization for heterogeneous system has not been well studied. Owing to the differences in performance and energy consumption, the energy optimization technique for heterogeneous system is different from the existing methods designed for homogeneous system. Besides typical voltage scaling method, reasonable task partitioning is also an essential method for optimizing energy consumption on heterogeneous systems. through partitioning a data parallel task and mapping sub-tasks onto several processors, one could achieve better performance and reduced energy consumption. As the computation cost reduces with specific accelerators, the communication overhead becomes more prominent. therefore, the task partition optimization should holistically consider the computation improvement and communication overhead to achieve higher energy efficiency. Typically, task partition and voltage scaling are not orthogonal and influence the effect of each other in the energy optimization problem. In order to harness both two knobs efficiently, this paper proposes an integer linear programming (ILP) based energy-optimal solution designed for heterogeneous system. We present a case study of optimizing MGRID benchmark on a typical CPU-GPU heterogeneous system. the experimental results demonstrate that the proposed method could exploit the heterogeneity in different processors and achieve improved energy efficiency. © 2011 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

A distributed task migration scheme for mesh-based chip-multiprocessors

A distributed task migration scheme for mesh-based chip-mult...

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Yaghoubi, Hossein Modarresi, Mehdi Sarbazi-Azad, Hmid Department of Computer Engineering Sharif University of Technology Tehran Iran Department of Electrical and Computer Engineering University of Tehran Tehran Iran IPM School of Computer Science Tehran Iran

ISBN: (纸本)9780769545646

A task migration scheme for homogeneous chip multiprocessors (CMP) is presented in this paper. the proposed migration mechanism focuses on the communication sub-system and aims to reduce the total power consumption and latency of the network-on-chip (NoC). In this work, starting from an initial mapping, the tasks migrate to new cores in such a way that the distance between the end-point nodes of high-volume communication flows is reduced. Finding the new place for a task is done in a distributed manner by applying an iterative local search that relies on the local information of each task about its communication demand. the task migration procedure also includes a pre-migration step that aims to produce a high quality (i.e. closer to the optimum point) starting point for the main distributed algorithm. the experimental results under some synthetic and realistic CMP workloads show that this method can effectively adapt the mapping of the tasks to the on-chip communication pattern and improve the power consumption and performance of the on-chip networks. © 2011 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Power Optimization for GPU Programs Based on Software Prefetching

Power Optimization for GPU Programs Based on Software Prefet...

引用

作者： Lin, Yisong Tang, Tao Wang, Guibin Natl Univ Def & Technol Key Lab Sci & Technol Natl Def Parallel & Distrib Changsha Hunan Peoples R China

ISBN: (纸本)9780769546001

GPUs render higher computing unit density than contemporary CPUs and thus exhibit much higher power consumption despite its higher power efficiency. the power consumption has become an important issue that impacts GPU's applications, thereby necessitating the low power optimization technology for GPUs. Software prefetching is an efficient way to alleviate the memory wall problem which overlaps the computing and memory access latencies. However, software prefetching will cause some power overhead because it increases the number and density of the instructions. thus, we should consider the balance between the performance income and the power overhead when applying the optimization. To address this problem, in this paper we first analyze the multi-thread execution model of GPU and validate the potential space of software prefetching optimization. then we give the software prefetching method for GPU programs to improve the performance. Aiming at two different objects: energy optimization under performance constraint and performance optimization under power constraint, we discuss the optimization methods based on software prefetching and dynamic voltage scaling technologies. the experimental results show that our method can efficiently optimize the energy consumption(performance) under the performance(power) constraint.

关键词： GPU CUDA low power optimization software prefetching

来源：评论

学校读者我要写书评

暂无评论

Biprominer: Automatic mining of binary protocol features

Biprominer: Automatic mining of binary protocol features

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Wang, Yipeng Li, Xingjian Meng, Jiao Zhao, Yong Zhang, Zhibin Guo, Li Institute of Computing Technology Chinese Academy of Sciences Beijing China Chinese Academy of Sciences Graduate University Beijing China National Engineering Laboratory for Information Security Technologies Beijing China

ISBN: (纸本)9780769545646

Application-level protocol specifications are helpful for network security management, including intrusion detection and intrusion prevention which rely on monitoring technologies such as deep packet inspection. Moreover, detailed knowledge of protocol specifications is also an effective way of detecting malicious code. However, current methods for obtaining unknown and proprietary protocol message formats (i.e., no publicly available protocol specification), especially binary protocols, highly rely on manual operations, such as reverse engineering which is timeconsuming and laborious. In this paper, we propose Biprominer1, a tool that can automatically extract binary protocol message formats of an application from its real-world network trace. In addition, we present a transition probability model for a better description of the protocol. the chief feature of Biprominer is that it does not need to have any priori knowledge of protocol formats, because Biprominer is based on the statistical nature of the protocol format. We evaluate the efficacy of Biprominer over three binary protocols, with an average precision more than 99% and a recall better than 96.7%. © 2011 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

A new method of DDB logical structure synthesis using distributed tabu search

A new method of DDB logical structure synthesis using distri...

引用

international Workshop on Soft computing applications and Knowledge Discovery 2011, SCAKD 2011 - In Conjunction with the 4th international conference on Pattern Recognition and Machine Intelligence, PReMI 2011

作者： Babkin, Eduard Karpunina, Margarita National Research University Higher School of Economics Dept. of Information Systems and Technologies Bol. Pecherskaya 25 6030155 Nizhny Novgorod Russia

In this paper we propose a parallel tabu search algorithm based on the consecutive tabu algorithm constructed by us earlier to solve the problem of the distributed database optimal logical structure synthesis. Also we provide a reader with some information about the performance of our new parallel algorithm and the quality of the solutions obtained with help of it.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Mobile element path planning for gathering transit-time constrained data

Mobile element path planning for gathering transit-time cons...

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Almi'ani, Khaled Viglas, Anastasios Aalsalem, Mohammed Faculity of Information Technology Al Hussein Bin Talal University Maan Jordan School of Information Technologies University of Sydney NSW 2006 Australia Faculty of Computer and Information System Jazan University Saudi Arabia

ISBN: (纸本)9780769545646

In this paper we investigate the problem of gathering the data in wireless sensor network using a single Mobile Element. In particular we consider the case where the data are produced by measurements and they need to be delivered to a predefined sink within a given time interval from the time the measurement takes place. A mobile element travels the network in predefined paths, collect the data from the nodes, and deliver them to the sink by a single long-distance transmission. In this problem, the length of the mobile element path is bounded by pre-determined length. this path will visit a subset of the nodes. these selected nodes will work as caching points and will aggregate the other nodes'data. the caching point nodes are selected with the aim of reducing the energy expenditures due to multi-hop forwarding. We provide a heuristic-based solution for this problem. We evaluate the performance of our algorithm by comparing it to the optimal solution as well as the best wellknown algorithms from the literature. © 2011 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Dynamically accessing packet header fields at high-speed

Dynamically accessing packet header fields at high-speed

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Duncan, Ralph Jungck, Peder Ross, Kenneth CloudShield Technologies SAIC company Sunnyvale CA United States

ISBN: (纸本)9780769545646

A significant part of packet processing consists of detecting whether certain standard protocol headers are present, where they are located and whether they include optional information. Packet processing programs are on tight time budgets, especially to handle speeds in the gigabits per second (gbps) range. thus, high-speed mechanisms for finding and accessing headers are critical. Our approach lets users define headers as C-style structures in a highlevel language, packetC [1], and specify header locations in terms of offsets from the start of the current packet, which is treated as an array of unsigned bytes. these offsets can be expressed in terms of network layer offsets, constant values, runtime-calculated variables and combinations of all of these. this paper focuses on the principal forms these offset expressions can take and on how our FPGAs (Field Programmable Gate Arrays), compiler and interpreter collectively handle them at runtime. For simple and complex header offset scenarios we provide users with intuitive, high-level ways to describe offsets and provide effective runtime mechanisms to access header fields. © 2011 IEEE.

关键词： Network layers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 95 96 97 98 99 100 101 102 103 104 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：