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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

748 篇 工学
- 678 篇 计算机科学与技术...
- 313 篇 软件工程
- 245 篇 信息与通信工程
- 243 篇 电气工程
- 154 篇 仪器科学与技术
- 41 篇 电子科学与技术（可...
- 26 篇 控制科学与工程
- 10 篇 生物医学工程（可授...
- 9 篇 生物工程
- 8 篇 机械工程
- 7 篇 动力工程及工程热...
- 5 篇 网络空间安全
- 4 篇 力学（可授工学、理...
- 4 篇 建筑学
- 4 篇 土木工程
- 3 篇 光学工程
- 3 篇 环境科学与工程（可...
102 篇 理学
- 71 篇 数学
- 13 篇 生物学
- 13 篇 系统科学
- 11 篇 物理学
- 7 篇 统计学（可授理学、...
32 篇 管理学
- 19 篇 管理科学与工程(可...
- 15 篇 图书情报与档案管...
- 11 篇 工商管理
10 篇 医学
- 8 篇 临床医学
- 3 篇 基础医学(可授医学...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 3 篇 法学
2 篇 文学
- 2 篇 外国语言文学
1 篇 农学
1 篇 军事学

主题

142 篇 parallel process...
110 篇 computer archite...
74 篇 computational mo...
69 篇 concurrent compu...
69 篇 multicore proces...
64 篇 computer network...
60 篇 distributed comp...
58 篇 application soft...
56 篇 hardware
53 篇 graphics process...
50 篇 network topology
48 篇 routing
48 篇 graphics process...
48 篇 instruction sets
48 篇 kernel
42 篇 parallel program...
41 篇 bandwidth
41 篇 protocols
40 篇 scalability
40 篇 delay

机构

5 篇 sharif univ tech...
4 篇 school of comput...
4 篇 department of el...
3 篇 national institu...
3 篇 state key labora...
3 篇 bauhaus univ wei...
3 篇 departamento de ...
3 篇 shenzhen univ pe...
3 篇 services computi...
3 篇 department of co...
3 篇 department matem...
3 篇 faculty of media...
3 篇 cnr ist informat...
3 篇 college of compu...
3 篇 tech univ berlin
3 篇 pontifical catho...
3 篇 russian acad sci...
3 篇 abo akad univ fa...
3 篇 pontifical catho...
3 篇 univ fed rio gra...

作者

13 篇 kotenko igor
12 篇 bagherzadeh nade...
7 篇 nader bagherzade...
7 篇 griebler dalvan
6 篇 mencagli gabriel...
6 篇 schepke claudio
6 篇 marco danelutto
6 篇 mauricio marin
6 篇 gross tom
6 篇 saenko igor
6 篇 marco aldinucci
6 篇 danelutto marco
5 篇 ortega julio
5 篇 fernandes luiz g...
5 篇 j. duato
5 篇 julio ortega
5 篇 igor kotenko
5 篇 jin hai
5 篇 daneshtalab maso...
5 篇 m. danelutto

语言

1,297 篇 英文
1 篇 其他
1 篇 中文

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

共 1299 条记录，以下是151-160 订阅

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

详细简洁

排序：

Static load distribution for communication intensive parallel computing in multiclusters

Static load distribution for communication intensive paralle...

引用

16th euromicro International conference on parallel, distributed and network-based processing

作者： Heien, Eric M. Fujimoto, Noriyuki Hagihara, Kenichi Osaka Univ Grad Sch Informat Sci & Technol Osaka 5608531 Japan

ISBN: (纸本)9780769530895

In this paper, we examine load distributions to minimize total run time in multi-cluster parallel computing algorithms by applying divisible load theory techniques. Even with homogeneous processor speeds, parallel computations in multi-clusters that evenly assign load can run at less than maximum efficiency due to communication heterogeneity. Using a modified version of the LogP parallel computing model, we propose a general technique of assigning load among multiple clusters to minimize the time each processor spends waiting. this technique is used to determine optimal load distribution for spin glass simulation and parallel bucket sort in multi-cluster systems. It also allows fast analysis of the effects of adding processors or clusters to the computation. We experimentally demonstrate the accuracy of our model, and show how it eliminates wait time in multi-cluster parallel computations. Using load distributions derived from our technique results in an execution time decrease of up to 50%, depending on the degree of heterogeneity among clusters and communication characteristics of the computation.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling Metric-Space Queries processing on Multi-Core Processors

Scheduling Metric-Space Queries Processing on Multi-Core Pro...

引用

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

作者： Gil-Costa, Veronica Barrientos, Ricardo J. Marin, Mauricio Bonacic, Carolina Univ San Luis DCC San Luis Argentina Yahoo Res Latin Amer Santa Clara CA USA Univ Chile DCC Santiago Chile Univ Complutense Madrid ArTeCS Grp Madrid Spain

ISBN: (纸本)9780769539393

this paper proposes a strategy to organize metric-space query processing in multi-core search nodes as understood in the context of search engines running on clusters of computers. the strategy is applied in each search node to process all active queries visiting the node as part of their solution which, in general, for each query is computed from the contribution of each search node. When query traffic is high enough, the proposed strategy assigns one thread to each query and lets them work in a fully asynchronous manner. When query traffic is moderate or low, some threads start to idle so they are put to work on queries being processed by other threads. the strategy solves the associated synchronization problem among threads by switching query processing into a bulk-synchronous mode of operation. this simplifies the dynamic re-organization of threads and overheads are very small with the advantage that the overall work-load is evenly distributed across all threads.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

DSPG: Decentralized Simultaneous Perturbations Gradient Descent Scheme 28

DSPG: Decentralized Simultaneous Perturbations Gradient Desc...

引用

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

作者： Ramaswamy, Arunselvan Paderborn Univ Dept Elect & Comp Sci Engn D-33098 Paderborn Germany

ISBN: (纸本)9781728165820

distributed descent-based methods are an essential toolset to solving optimization problems in multi-agent system scenarios. Here the agents seek to optimize a global objective function through mutual cooperation. Oftentimes, cooperation is achieved over a wireless communication network that is prone to delays and errors. there are many scenarios wherein the objective function is either non-differentiable or merely observable. In this paper, we present a cross-entropy based distributed stochastic approximation algorithm (SA) that finds a minimum of the objective, using only samples. We call this algorithm Decentralized Simultaneous Perturbation Stochastic Gradient, with Constant Sensitivity Parameters (DSPG). this algorithm is a two fold improvement over the classic Simultaneous Perturbation Stochastic Approximations (SPSA) algorithm. Specifically, DSPG allows for (i) the use of old information from other agents and (ii) easy implementation through the use simple hyper-parameter choices. We analyze the biases and variances that arise due to these two allowances. We show that the biases due to communication delays can be countered by a careful choice of algorithm hyper-parameters. the variance of the gradient estimator and its effect on the rate of convergence is studied. We present numerical results supporting our theory. Finally, we discuss an application to the stochastic consensus problem.

关键词： distributed optimization distributed approximate gradient method cross-entropy based gradient approximation optimization over networks with unbounded delays

来源：评论

学校读者我要写书评

暂无评论

SAWS: Simple and Adaptive Warp Scheduling for Improved Performance in throughput Processors 26

SAWS: Simple and Adaptive Warp Scheduling for Improved Perfo...

引用

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

作者： Munoz-Martinez, Francisco Acacio, Manuel E. Univ Murcia Dpto Ingn & Tecnol Computadores Murcia Spain

ISBN: (纸本)9781538649756

In this work, we address the challenge of designing an efficient warp scheduler for throughput processors by proposing SAWS (Simple and Adaptive Warp Scheduler). Differently from previous approaches which target a particular type of applications, SAWS considers several simple scheduling algorithms and tries to use the one that best fits each application or phase within an application. through detailed simulations we demonstrate that a practical implementation of SAWS can obtain IPC values that closely match the best scheduling algorithm in each case.

关键词： Surface acoustic waves Benchmark testing Round robin Graphics processing units throughput

来源：评论

学校读者我要写书评

暂无评论

parallelizing Soft-Synths with Soft Real-Time Requirements 25

Parallelizing Soft-Synths with Soft Real-Time Requirements

引用

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

作者： Cameron, Ede Goswami, Dhrubajyoti Concordia Univ Dept Comp Sci & Software Engn Montreal PQ Canada

ISBN: (纸本)9781509060580

though parallel processing of applications related to video processing and rendering are widespread, parallel processing of audio synthesis software (also known as soft-synths) is not much researched. this paper addresses our research and experiments in parallelizing digital audio synthesizers on a commodity multicore platform where these synthesizers are most commonly used. Soft real-time requirements and overheads of parallelization are two of the competing forces in this research. As a case study, the ALSA (Advanced Linux Sound Architecture) Modular audio Synthesizer (AMS) is evaluated. AMS employs a modular approach to digital music synthesis, is often part of a standard Linux installation package, has a GUI for user interactions, and like other audio synthesizers it has a soft real-time requirement. the main intentions of parallelization are for enhancing throughput and hence stability, whereby more complex and higher quality audio can be generated. the GUI based interactive approach adds an extra challenge of a dynamic call graph that can change on-the-fly. the paper compares the pros and cons of the different techniques adopted, and highlights the advantages of parallelization. the lessons learnt can also be used in parallelizing other existing audio synthesizers and designing new parallel synthesizers from scratch.

关键词： digital audio synthesizers ALSA modular synthesizer synthesized digital music parallel processing

来源：评论

学校读者我要写书评

暂无评论

Inter-Server RSS: Extending Receive Side Scaling for Inter-Server Workload Distribution 28

Inter-Server RSS: Extending Receive Side Scaling for Inter-S...

引用

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

作者： Oeldemann, Andreas Biersack, Franz Wild, thomas Herkersdorf, Andreas Tech Univ Munich Chair Integrated Syst Munich Germany

ISBN: (纸本)9781728165820

network Function Virtualization enables operators to schedule diverse network processing workloads on a general-purpose hardware infrastructure. However, short-lived processing peaks make an efficient dimensioning of processing resources under stringent tail latency constraints challenging. To reduce dimensioning overheads, several load balancing approaches, which either adaptively steer network traffic to a group of servers or to their internal CPU cores, have separately been investigated. In this paper, we present Inter-Server RSS (isRSS), a hardware mechanism built on top of Receive Side Scaling in the network interface card, which combines intra- and inter-server load balancing. In a first step, isRSS targets a balanced utilization of processing resources by steering packet bursts to CPU cores based on per-core load feedback. If all local CPU cores are highly loaded, isRSS avoids high queueing delays by redirecting newly arriving packet bursts to other servers, which execute the same network functions, exploiting that processing peaks are unlikely to occur at all servers at the same time. Our evaluation based on real-world network traces shows that compared to Receive Side Scaling, the joint intra- and inter-server load balancing approach is able to reduce the processing capacity dimensioned for network function execution by up to 38.95% and limit packet reordering to 0.0589% while maintaining tail latencies.

关键词： network function virtualization load balancing receive side scaling

来源：评论

学校读者我要写书评

暂无评论

Improving dynamic web servers by affinity-based network interfaces

Improving dynamic web servers by affinity-based network inte...

引用

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

作者： Ortiz, Andres Ortega, Julio Diaz, Antonio F. Prieto, Alberto Univ Malaga Dept Ingn Comunicac Malaga Spain Univ Granada Dept Arquitectura & Tecnol Computadores Granada Spain

ISBN: (纸本)9780769543284

Present trend towards multiprocessor and multicore architectures as well as programmable NICs (network Interface Cards) provides new opportunities to exploit the available parallelism in the network interface design and implementation to cope with the high communication overhead required to take advantage of a multi-gigabit links. In this paper we have used dynamic web servers to evaluate several alternatives to distribute the network interface work among the different cores available in the node. these alternatives have been devised according to the affinity of the work to be done with the location (proximity to the memories where the different data structures are stored) and characteristics of the processing core. Improvements in the throughput (up to 110%), the response time (up to 500%) and the requests attended per second (up to 85%) have been observed in our experiments on dynamic web servers.

关键词： Interrupt affnity Full system simulation network interface Processor affinity Simics Web server evaluation

来源：评论

学校读者我要写书评

暂无评论

A parallel implementation of the Hestenes-Jacobi-One-Sides method using GPU-CUDA 26

A parallel implementation of the Hestenes-Jacobi-One-Sides m...

引用

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

作者： Cuomo, Salvatore Marcellino, Livia Navarra, Guglielmo Univ Naples Federico II DMA Naples Italy Univ Naples Parthenope DIST Naples Italy Univ Naples Federico II DEEIT Naples Italy

ISBN: (纸本)9781538649756

In this work, we present a parallel implementation of Hestenes-Jacobi-One-sided method exploiting the CUDA environment of Graphics processing Units (GPUs). Our approach is based on a scheme which performs multiple orthogonalization processes in parallel, across multiple rows and columns. Driven by an outer loop, executed on the CPU, the algorithm configures the CUDA grid with threads and blocks in order to allow the CUDA-kernels to use the shared memory and avoid multiple accesses to global memory. We use this GPU-parallel algorithm in order to accelerate the Singular Value Decomposition (SVD) process which has a variety of applications in scientific computing, signal processing, automatic control and many other areas. Preliminar experiments show a significant improvements in terms of performances with respect to the CPU version and our previuos GPU version.

关键词： Hestenes-Jacobi-One-sided method SVD GP-GPU CUDA

来源：评论

学校读者我要写书评

暂无评论

parallelization of security event correlation based on accounting of event type links 26

Parallelization of security event correlation based on accou...

引用

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

作者： Kotenko, Igor Fedorchenko, Andrey Saenko, Igor Kushnerevich, Alexey Russian Acad Sci SPIIRAS St Petersburg Inst Informat & Automat St Petersburg Russia ITMO Univ St Petersburg Natl Res Univ Informat Technol Mech St Petersburg Russia

ISBN: (纸本)9781538649756

the paper proposes a novel approach to parallel data processing for solving security event correlation problems based on Big Data technologies. Different security event correlation methods and problems, as well as big data technologies applicable for security monitoring are considered. the main attention is paid to the problems of identifying the links between security event types and assessing the dependence of the link strength on event distribution in time. Implementation of correlation problem solutions on the Spark platform is described, and the results of experimental assessment of security event correlation processes are given.

关键词： security event correlation Pearson correlation coefficient SIEM system Big Data parallel data processing

来源：评论

学校读者我要写书评

暂无评论

A distributed Algorithm for Reconfiguration of Lattice-based Modular Self-Reconfigurable Robots 24

A Distributed Algorithm for Reconfiguration of Lattice-based...

引用

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

作者： Piranda, Benoit Bourgeois, Julien UFC UBFC UMR CNRS 6174 FEMTO ST Inst Montbeliard France

ISBN: (纸本)9781467387767

A modular robots is composed of many independent connected modules which are able to achieve common goals through communications. A modular self-reconfigurable robot can move and reorganize its modules to modify its shape. In this paper, we consider a modular self-reconfigurable robot made from cubic modules (blocks) that are able to slide along their faces. Sliding motions imply complex cooperations, for example, crossing an angle needs at least three synchronized blocks. based on this kind of hardware, we propose a distributed rule-based algorithm which plans and moves the blocks to reach a final configuration. We propose the use of motion rules that drastically simplify the complexity of the sliding movements and we define a special kind of metamodule to fasten the reconfiguration. We evaluate our algorithm in a simulator in order to study its behavior in the case of large modular robots composed of more than 10,000 modules. We test its robustness with more than 120 different kinds reconfigurations scenarii, representing more than 338 millions of movements for the blocks without any problem.

关键词： distributed algorithm modular robots self-reconfiguration

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共130页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：