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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,286 篇 会议
47 篇 期刊文献
3 册 图书

馆藏范围

4,336 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,433 篇 工学
- 2,168 篇 计算机科学与技术...
- 1,079 篇 软件工程
- 608 篇 电气工程
- 586 篇 信息与通信工程
- 185 篇 仪器科学与技术
- 138 篇 控制科学与工程
- 119 篇 电子科学与技术（可...
- 64 篇 生物工程
- 59 篇 机械工程
- 43 篇 动力工程及工程热...
- 38 篇 交通运输工程
- 31 篇 生物医学工程（可授...
- 27 篇 安全科学与工程
- 26 篇 网络空间安全
- 24 篇 光学工程
- 23 篇 土木工程
- 22 篇 材料科学与工程（可...
- 20 篇 建筑学
- 19 篇 航空宇航科学与技...
418 篇 理学
- 253 篇 数学
- 86 篇 物理学
- 72 篇 生物学
- 51 篇 系统科学
- 42 篇 统计学（可授理学、...
262 篇 管理学
- 180 篇 管理科学与工程(可...
- 97 篇 图书情报与档案管...
- 66 篇 工商管理
35 篇 医学
- 30 篇 临床医学
33 篇 法学
- 19 篇 社会学
18 篇 经济学
- 18 篇 应用经济学
11 篇 农学
7 篇 教育学
7 篇 文学
2 篇 军事学

主题

545 篇 parallel process...
259 篇 computer archite...
240 篇 computational mo...
207 篇 distributed comp...
186 篇 concurrent compu...
180 篇 computer network...
164 篇 network topology
157 篇 hardware
157 篇 graphics process...
148 篇 routing
131 篇 bandwidth
124 篇 application soft...
120 篇 protocols
119 篇 neural networks
107 篇 scalability
104 篇 throughput
104 篇 multicore proces...
102 篇 algorithm design...
102 篇 kernel
101 篇 computer science

机构

15 篇 institute of inf...
14 篇 institute of com...
14 篇 science and tech...
13 篇 college of compu...
13 篇 school of cyber ...
13 篇 shandong fundame...
12 篇 school of comput...
10 篇 science and tech...
9 篇 univ chinese aca...
9 篇 university of ch...
9 篇 natl univ def te...
9 篇 natl univ def te...
8 篇 shenyang aerospa...
8 篇 beijing univ pos...
8 篇 nanjing univ aer...
8 篇 beijing universi...
7 篇 shanghai jiao to...
7 篇 college of compu...
7 篇 chinese acad sci...
7 篇 national key lab...

作者

17 篇 bagherzadeh nade...
16 篇 kotenko igor
14 篇 j. duato
12 篇 wang yijie
11 篇 daneshtalab maso...
10 篇 ebrahimi masoume...
10 篇 yijie wang
10 篇 nader bagherzade...
10 篇 igor kotenko
10 篇 lexi xu
9 篇 li dongsheng
9 篇 marco aldinucci
9 篇 matsutani hiroki
8 篇 hiroki matsutani
8 篇 masoumeh ebrahim...
8 篇 plosila juha
8 篇 marco danelutto
8 篇 wang huaimin
7 篇 tenhunen hannu
7 篇 xinzhou cheng

语言

4,092 篇 英文
235 篇 其他
11 篇 中文
1 篇 乌克兰文

检索条件"任意字段=Euromicro Conference on Parallel, Distributed and Network-Based Processing"

共 4336 条记录，以下是1381-1390 订阅

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

详细简洁

排序：

3D-AMAP: A Latency-Aware Task Mapping onto 3D Mesh-based NoCs with Partially-Filled TSVs 25

3D-AMAP: A Latency-Aware Task Mapping onto 3D Mesh-Based NoC...

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Ziaeeziabari, Hesamedin Patooghy, Ahmad Islamic Azad Univ Sci & Res Branch Comp Dept Tehran Iran Iran Univ Sci & Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781509060580

This paper proposes a latency-aware task mapping algorithm called 3D-AMAP for 3D mesh-based NoCs with partially-filled TSVs. The 3D-AMAP algorithm divides communications of a given application graph into Low-volume (LV) and High-Volume (HV) communications. The 3D-AMAP algorithm bypasses the LV communications to partition the given application graph to some subgraphs. Then, 3D-AMAP algorithm fairly assigns 4-neighbor cores of the mesh topology between the high traffic rate tasks of the application graph to reach the best mapping. The proposed mapping algorithm maps application subgraphs one by one based on their total intra communications considering where the vertical channels are located in the network. Evaluations of the 3D-AMAP mapping algorithm are done in a wide range of working conditions using Access Noxim NoC simulator in terms of network latency. Results show that 3D-AMAP algorithm offers at least 5% and at most 76% in network latencywith respect to NMAP algorithm.

关键词： network on chip Mapping algorithm Hop count Latency Three dimensional Partially-filled TSVs

来源：评论

学校读者我要写书评

暂无评论

A Peer to Peer Approach To Efficient High Performance Computing 25

A Peer to Peer Approach To Efficient High Performance Comput...

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Cassavia, Nunziato Flesca, Sergio Ianni, Michele Masciari, Elio Papuzzo, Giuseppe Pulice, Chiara ICAR CNR Arcavacata Di Rende CS Italy Univ Calabria Arcavacata Di Rende CS Italy Univ Maryland UMIACS College Pk MD 20742 USA

ISBN: (纸本)9781509060580

Nowadays, many applications call for collaborative solutions in order to accomplish complex projects requiring huge amounts of computing resources, e.g., physical science simulation. Many approaches have been proposed in order to design a task partitioning strategy able to assign pieces of execution to the appropriate workers. In this paper, we describe our peer to peer solution for solving complex works by using the idling computational resources of users connected to our network. More in detail, we designed a framework that allows users to share their CPU and memory in a secure and efficient way. By doing this, users help each others by asking the network available computational resources when they face high computing demanding tasks. Differently from many proposal available for volunteer computing, users providing their resources are rewarded with tangible credits, i.e., they can redeem their credits by asking computation power to solve their own task or/and they can redeem them earning coins. As we do not require to power additional resources for solving tasks (we better exploit unused resources already powered instead).

关键词： H.5.3.b Collaborative computing H.3.5.a Commercial services H.3.5.e Web-based services

来源：评论

学校读者我要写书评

暂无评论

Softening Up the network for Scientific Applications 25

Softening Up the Network for Scientific Applications

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Trois, Celio Bona, Luis C. Del Fabro, Marcos D. Martinello, Magnos Bidkar, Sarvesh Nejabati, Reza Simeonidou, Dimitra Univ Fed Parana Comp Sci Dept Curitiba Parana Brazil Univ Fed Espirito Santo Comp Sci Dept Espirito Santo Brazil Univ Bristol High Performance Networks Grp Bristol Avon England

ISBN: (纸本)9781509060580

Scientific applications demand huge computational power connected through fast networks. They are developed using parallel kernel methods, usually implemented with the Message Passing Interface (MPI), presenting well-behaved communication patterns across computing nodes. The current network technologies do not allow defining traffic forwarding policies considering the different application traffic, resulting in an unbalanced load on the network links. Moreover, the devices are not concerned if the traffic is latency-sensitive or bandwidth-intensive. To handle this, we present NetSA, a framework exploiting the communication patterns of scientific applications, considering latency and bandwidth constraints, as the key logic for evenly placing the application flows on the network available paths. Through NetSA, the scientific application developer can easily modify the network behavior to best fit the application communication requirements. We have performed experiments for optimizing the MPI communication primitives and applied our solution to speed up scientific applications, obtaining an execution time reduction up to 27%.

关键词： Communication Patterns network Management Scientific Application Software-Defined networking

来源：评论

学校读者我要写书评

暂无评论

A Region-based Approach to Pipeline parallelism in Java Programs on Multicores 25

A Region-Based Approach to Pipeline Parallelism in Java Prog...

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Wang, Yang Kent, Kenneth B. Chinese Acad Sci Shenzhen Inst Adv Technol Beijing Peoples R China Univ New Brunswick Fac Comp Sci CAS Atlantic Fredericton NB Canada

ISBN: (纸本)9781509060580

As multicore architectures dominate mainstream computing platforms, migrating legacy applications into their parallel representation becomes a viable approach to reaping the benefits of multicore computing. In this paper we present a dataflow analysis tool that assists programmers to exploit the coarse-grained pipeline parallelism in stream-like Java applications on multicores. With this tool, programmers can partition a source Java program into a set of regions, which as pipeline stages, are connected via data channels to execute on multicores. To this end, we propose a simple yet effective framework that leverages JVMTI (JVM Tool Interface) and Javaagent techniques to track the data communication patterns among different regions, whereby a stream graph of the program is constructed. The graph is further used by the framework and programmers to re-factor the Java application into a pipelined program so that the potential of the multicores can be fully utilized. This procedure can be repeated in several rounds to progressively improve the performance. By applying this tool to several selected benchmarks, we demonstrate the effectiveness of the approach in terms of the performance improvements of some stream-like Java applications.

关键词： Java Multicore processing Pipelines Pipeline processing Data communication Tuning

来源：评论

学校读者我要写书评

暂无评论

A distributed Content Placement Strategy based on Popularity for ICN

A Distributed Content Placement Strategy Based on Popularity...

引用

IEEE International conference on Big Data and Cloud Computing (BdCloud)

作者： Yingqi Li Ru Li Meiju Yu College of Computer Science Inner Mongolia University Hohhot China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

In most distributed systems such as ICN, proper content placement can improve network performance, reduce response time, and reduce source server load. Most ICN cache deployment strategies focus on selecting the appropriate node for caching on the content return path, regardless of the popularity of the content. This paper proposes a distributed content placement strategy based on popularity for ICN. The scheme not only considers the distance between the node on the content return path and the request node, but also considers the content popularity trend, predicts the future popularity of the content with the Markov Chain, and pushes the content with the local popular trend to the network in advance. This paper implements the cache placement strategy on the ndnSIM simulator and performs simulation experiments on the real network topology. At the same time, the comparison scheme greedy scheme is also implemented, and two indicators of network delay and hit rate are evaluated. The experimental results show that the network performance of this scheme is higher than that of the greedy scheme in the network stationary phase, with an average delay of 3% and an increase of 8% cache hit rate.

关键词： Market research Delays Servers Markov processes network topology Topology Filtering

来源：评论

学校读者我要写书评

暂无评论

A Rapid Data Communication Exploration Tool for Hybrid CPU-FPGA Architectures 25

A Rapid Data Communication Exploration Tool for Hybrid CPU-F...

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Makni, Mariem Niar, Smail Baklouti, Mouna Zhong, Guanwen Mitra, Tulika Abid, Mohamed Univ Valenciennes LAMIH Valenciennes France Natl Engn Sch Sfax Sfax Tunisia Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9781509060580

Modern System-on-Chip (SoC) designs face many challenges. Choosing the best communication protocol among the different processing nodes is one of the most important design decisions. On-chip communication architectures can have a significant impact on the performance of SoC designs. However, in most of the existing design tools, only the computation cost is accurately estimated. To address this challenge, we present a high-level analytical tool to estimate the data communication cost for hybrid CPU-FPGA architectures. The proposed model allows to estimate, rapidly and accurately, both computation and communication cost of applications containing multiple nested loops. This paper also explores the benefits of applying various optimization pragmas including dataflow and loop pipelining, at the compilation phase. Experimental results show that the proposed model provides accurate data communication estimation for hybrid CPUFPGA architectures.

关键词： Kernel Data communication Estimation Computational modeling Pipeline processing Analytical models Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

parallel Satisfiability Solver based on Hybrid Partitioning Method 25

Parallel Satisfiability Solver Based on Hybrid Partitioning ...

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Menouer, Tarek Baarir, Souheib Paris Ouest Nanterre La Def Univ Lab LIP6 CNRS UMR 7606 Paris France LRDE Lab Le Kremlin Bicetre France

ISBN: (纸本)9781509060580

This paper presents a hybrid partitioning method used to improve the performance of solving a Satisfiability ( SAT) problem. The principle of our approach consist firstly to apply a static partitioning to decompose the search tree in finite set of disjoint sub-trees, than assign each sub-tree to one computing core. However it is not easy to choose the relevant branching variables to partition the search tree. We propose in this context to partition the search tree according to the variables that occur more frequently then others. The advantage of this method is that it gives a good disjoint sub-trees. However, the drawback is the imbalance load between all computing cores of the system. To overcome this drawback, we propose as novelty to extend the static partitioning by combining with a new dynamic partitioning that assures a good load balancing between cores. Each time a new waiting core is detected, the dynamic partitioning selects automatically using an estimation function the computing core which has the most work to do in order to partition dynamically its sub-tree in two parts. It keeps one part and gives the second part to the waiting core. Preliminary result show that a good speedup is achieved using our hybrid method.

关键词： parallelism Satisfiability Load balancing Scheduling

来源：评论

学校读者我要写书评

暂无评论

TEMPORAL PYRAMID RELATION network FOR VIDEO-based GESTURE RECOGNITION 25

TEMPORAL PYRAMID RELATION NETWORK FOR VIDEO-BASED GESTURE RE...

引用

25th IEEE International conference on Image processing (ICIP)

作者： Yang, Ke Li, Rongchun Qiao, Peng Wang, Qiang Li, Dongsheng Dou, Yong Natl Univ Def Technol Coll Comp Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China

ISBN: (纸本)9781479970612

Gesture recognition in video is an important application of computer vision. However, there are few works talked about the temporal order or relation of the frames in video, which is important for model gestures. In this paper, we propose Temporal Pyramid Relation network (TPRN) which can model the temporal relation of video frames effectively and efficiently. First, we use Temporal Pyramid Pooling (TPP) layer to get temporal feature sequences of multiple scale pyramids. Then, a Temporal Relation network (TRN) is stacked on the feature sequence of each scale respectively to model the temporal relations of video frames at multiple scales. At last, representations of all scales are aggregated to get the final prediction. TPRN can take video clips of various length as input and is scalable for video length. We evaluate TPRN on a recently released very large video-based gesture recognition dataset 20BN-Jester dataset v1, and TPRN achieves competitive performance.

关键词： Gesture recognition temporal relation network temporal pyramid pooling

来源：评论

学校读者我要写书评

暂无评论

network-Aware VM Migration Heuristics for Improving the SLA Violation of Multi-tier Web Applications in the Cloud 25

Network-Aware VM Migration Heuristics for Improving the SLA ...

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Borhani, Amir Hossein Hung, Terence Lee, Bu-sung Qin, Zheng Bagheri, Zahra Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore Rolls Royce Pte Ltd Singapore Singapore IHPC Singapore 138632 Singapore Univ Isfahan Fac Comp Engn Esfahan Iran

ISBN: (纸本)9781509060580

The virtualization technology enables multi-tier web application to be hosted in the Cloud. But the Service Level Agreement (SLA) is likely to be negatively affected when the network traffic is high as they may quickly overload the data center network and increase the response time of the system. Additionally, data centers experience high operational costs due to their considerable amount of energy consumption. The Virtual Machine (VM) technology and VM migration have been widely utilized to deal with such challenges. In this paper, we present design and implementation of an adaptive network-aware VM migration algorithm. The VM and target selection policies are based on the steady state network traffic in the system to minimize the negative effect of migration on other flows on the network. Moreover, we address the high energy consumption of the data center by employing an energy-aware VM placement algorithm. The effectiveness of our proposed VM migration algorithm is evaluated by extensive simulations in CloudSim using real workload traces. We compared two overloading detection policies in our experiments. The results show that our algorithm is able to improve the SLA violation (SLAV) and energy consumption up to 73% and 81%, respectively.

关键词： Resource Management Energy Efficient and Management Service Level Agreement Multi-tier Web Applications network-Aware VM Migration Energy-Aware VM Migration

来源：评论

学校读者我要写书评

暂无评论

Efficient Bottleneck Detection in Stream Process System Using Fuzzy Logic Model 25

Efficient Bottleneck Detection in Stream Process System Usin...

引用

25th euromicro International conference on parallel, distributed and network-based processing (PDP)

作者： Zhai, Yanlong Xu, Wu Beijing Inst Technol Sch Comp Sci Beijing Engn Res Ctr Mass Language Informat Proc Beijing Peoples R China

ISBN: (纸本)9781509060580

Big Data has shown lots of potential in numerous domain and becomes one of the emerging technologies that are bringing revolution in some real world industry. It has the power to provide insights into the unseen aspects of immense volume of data. Some applications are processing the data using a store-then-process paradigm, whereas other applications, like telecommunications and large-scale sensor networks, have to analyze continuous data flow online. Stream processing Engines(SPEs) are designed to support applications which require timely analysis of high volume data streams. The dynamic nature of data stream requires SPEs to have high scalability. However, current SPEs mostly adopt a static configuration and can not scale out/in flexibly along with the changing of the data stream. In this paper, we proposed a fuzzy logic based runtime bottleneck operator detection approach to improve the scalability of SPEs by providing resources in the cloud environment. Our experimental results show that the fuzzy logic component developed in this work could detect bottleneck operators efficiently. Compared with other bottleneck detection methods, the decision results generated by our approach is more flexible and will not scale out/in the system when the workload change instantly.

关键词： Stream processing System Fuzzy Logic Scalability Big Data

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共434页 << < 135 136 137 138 139 140 141 142 143 144 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：