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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
86 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,674 篇 英文
33 篇 其他
4 篇 中文
1 篇 土耳其文

检索条件"任意字段=2nd International Symposium on Parallel and Distributed Processing and Applications"

共 1711 条记录，以下是391-400 订阅

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

详细简洁

排序：

Classification Framework for the parallel Hash Join with a Performance Analysis on the GPU 15

Classification Framework for the Parallel Hash Join with a P...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Wozniak, Kinga Anna Schikuta, Erich Univ Vienna Fac Comp Sci Vienna Austria

ISBN: (纸本)9781538637906

The hash join operator is one of the most important relational operators in database applications and a prominent research topic in the domain of parallel processing. However, up to date, no consistent algorithm design guidelines for high-performance implementations on parallel platforms have been derived from the available experimental results. In this work we define a taxonomy of the parallel hash join operator landscape and categorize state of the art research accordingly. Moreover, we implement and benchmark three taxonomy types: A sequential implementation on the CPU, a hybrid CPU-GPU implementation as well as a fully parallel version on the GPU. The results show that (1) the hybrid CPU-GPU type outperforms the other two, showcasing the benefits of a good fit between algorithm type and hardware platform choice, (2) the poor end-to-end performance of the GPU-only type highlights the impact of GPU specific synchronization and contention issues that appear with an unfit design choice, (3) parallelization improves runtime by a factor of 2.2X in the end-to-end algorithm, a factor of 83X in the join phase and shows good scaling behavior with increasing number of threads. This proves that the GPU is a valuable co-processor option for computation offloading in database applications. We anticipate this classification framework to be a starting-point for design decisions for parallel big data hash join operators on other heterogeneous systems.

关键词： relational database hash join parallel processing taxonomy graphics processor performance

来源：评论

学校读者我要写书评

暂无评论

Elastic-Cache: GPU Cache Architecture for Efficient Fine- and Coarse-Grained Cache-Line Management 31

Elastic-Cache: GPU Cache Architecture for Efficient Fine- an...

引用

31st IEEE international parallel and distributed processing symposium (IPDPS)

作者： Li, Bingchao Sun, Jizhou Annavaram, Murali Kim, Nam Sung Civil Aviat Univ China Sch Comp Sci & Technol Tianjin Peoples R China Tianjin Univ Sch Comp Sci & Technol Tianjin Peoples R China Univ Southern Calif Dept Elect Engn Los Angeles CA 90089 USA Univ Illinois Dept Elect & Comp Engn Urbana IL USA

ISBN: (纸本)9781538639146

GPUs provide high-bandwidth/low-latency on-chip shared memory and L1 cache to efficiently service a large number of concurrent memory requests (to contiguous memory space). To support warp-wide accesses to L1 cache, GPU L1 cache lines are very wide. However, such L1 cache architecture cannot always be efficiently utilized when applications generate many memory requests with irregular access patterns especially due to branch and memory divergences. In this paper, we propose Elastic-Cache that can efficiently support both fine-and coarse-grained L1 cache-line management for applications with both regular and irregular memory access patterns. Specifically, it can store 32-or 64-byte words in non-contiguous memory space to a single 128-byte cache line. Furthermore, it neither requires an extra tag storage structure nor reduces the capacity of L1 cache since it stores auxiliary tags for fine-grained L1 cache-line managements in sharedmemory space that is not fully used in many applications. Our experiment shows that Elastic-Cache improves the geo-mean performance of applications with irregular memory access patterns by 58% without degrading performance of applications with regular memory access patterns.

关键词： GPU cache shared memory SIMT

来源：评论

学校读者我要写书评

暂无评论

Dynamic Beam Hopping for DVB-S2X Satellite: A Multi-Objective Deep Reinforcement Learning Approach

Dynamic Beam Hopping for DVB-S2X Satellite: A Multi-Objectiv...

引用

IEEE international symposium on parallel and distributed processing with applications and IEEE international Conference on Ubiquitous Computing and Communications (ISPA/IUCC)

作者： Yuchen Zhang Xin Hu Rong Chen Zhili Zhang Liquan Wang Weidong Wang School of Electronic Engineering Beijing University of Posts and Telecommunications Beijing China Group Corporation 54th Research Institute China Electronics Technology Beijing China

ISBN: (纸本)9781728152103

Dynamic Beam Hopping (DBH) is a crucial technology for adapting to the flexibility of different service configurations in the multi-beam satellite communications market. The conventional beam hopping method, which ignores the intrinsic correlation between decisions, only obtains the optimal solution at the current time, while deep reinforcement learning (DRL) is a typical algorithm for solving sequential decision problems. Therefore, to deal with the DBH problem in the scenario of Differentiated Services (DIFFSERV), this paper designs a multiobjective deep reinforcement learning (MO-DRL) algorithm. Besides, as the demand for the number of beams increases, the complexity of system implementation increase significantly. This paper innovatively proposes a time division multi-action selectionmethod(TD-MASM) tosolvethecurseofdimensionality problem. Under the real condition, the MO-DRL algorithm with the low complexity can ensure the fairness of each cell, improve the throughput to about 5540Mbps, and reduce the delay to about 0.367ms. The simulation results show that when the GA is used to achieve similar effects, the complexity of GA is about 110 times that of the MO-DRL algorithm.

关键词： DiffServ networks digital video broadcasting learning (artificial intelligence) optimisation satellite communication telecommunication computing differentiated network service Satellite communication digital video broadcasting telecommunication computing learning (artificial intelligence) Beams and girders Learning Gallium system implementation Time division

来源：评论

学校读者我要写书评

暂无评论

Examining the Reproducibility of Using Dynamic Loop Scheduling Techniques in Scientific applications 31

Examining the Reproducibility of Using Dynamic Loop Scheduli...

引用

31st IEEE international parallel and distributed processing symposium Workshops (IPDPS)

作者： Hoffeins, Franziska Ciorba, Florina M. Banicescu, Ioana Tech Univ Dresden Ctr Informat Serv & High Performance Comp D-01062 Dresden Germany Univ Basel Dept Math & Comp Sci CH-4051 Basel Switzerland Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS 39762 USA

ISBN: (纸本)9780769561493

Reproducibility of the execution of scientific applications on parallel and distributed systems is a growing concern, underlying the trustworthiness of the experiments and the conclusions derived from experiments. Dynamic loop scheduling (DLS) techniques are an effective approach towards performance improvement of scientific applications via load balancing. These techniques address algorithmic and systemic sources of load imbalance by dynamically assigning tasks to processing elements. The DLS techniques have demonstrated their effectiveness when applied in real applications. Complementing native experiments, simulation is a powerful tool for studying the behavior of parallel and distributed applications. In earlier work, the scalability [1], robustness [2], and resilience [3] of the DLS techniques were investigated using the MSG interface of the SimGrid simulation framework [4]. The present work complements the earlier work and concentrates on the verification via reproducibility of the implementation of the DLS techniques in SimGrid-MSG. This work describes the challenges of verifying the performance of using DLS techniques in earlier implementations of scientific applications. The verification is performed via reproducibility of simulations based on SimGrid-MSG. To simulate experiments selected from earlier literature, the reproduction process begins by extracting the information needed from the earlier literature and converting it into the input required by SimGrid- MSG. The reproducibility study is carried out by comparing the performance of SimGrid-MSG-based experiments with those reported in two selected publications in which the DLS techniques were originally proposed. While the reproduction was not successful for experiments from one of the selected publications, it was successful for experiments from the other. This successful reproduction implies the verification of the DLS implementation in SimGrid- MSG for the considered applications and systems, and th

关键词： Verification via Reproducibility Simulation Scheduling Dynamic Loop Scheduling Scientific applications SimGrid-MSG

来源：评论

学校读者我要写书评

暂无评论

Transparent Caching for RMA Systems 31

Transparent Caching for RMA Systems

引用

31st IEEE international parallel and distributed processing symposium (IPDPS)

作者： Di Girolamo, Salvatore Vella, Flavio Hoefler, Torster Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland Sapienza Univ Roma Dept Comp Sci Rome Italy

ISBN: (纸本)9781538639146

The constantly increasing gap between communication and computation performance emphasizes the importance of communication-avoidance techniques. Caching is a well-known concept used to reduce accesses to slow local memories. In this work, we extend the caching idea to MPI3 Remote Memory Access (RMA) operations. Here, caching can avoid inter-node communications and achieve similar benefits for irregular applications as communication-avoiding algorithms for structured applications. We propose CLaMPI, a caching library layered on top of MPI-3 RMA, to automatically optimize code with minimum user intervention. We demonstrate how cached RMA improves the performance of a Barnes Hut simulation and a Local Clustering Coefficient computation up to a factor of 1.8x and 5x, respectively. Due to the low overheads in the cache miss case and the potential benefits, we expect that our ideas around transparent RMA caching will soon be an integral part of many MPI libraries.

关键词： barnes hut caching irregular applications local clustering coefficient MPI nbody remote transfer RMA

来源：评论

学校读者我要写书评

暂无评论

HDSVM: A High Efficiency distributed SVM Framework over Data Stream 15

HDSVM: A High Efficiency Distributed SVM Framework over Data...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Hou, Yan Wang, Yijie Ma, Xingkong Cheng, Li Natl Univ Def Technol Coll Comp Natl Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781538637906

The application of Support Vector Machine (SVM) over data stream is growing with the increasing real-time processing requirements in classification field, like anomaly detection and real-time image processing. However, the dynamic live data with high volume and fast arrival rate in data streams make it challenging to apply SVM in data stream processing. Existing SVM implementations are mostly designed for batch processing and hardly satisfy the efficiency requirement of stream processing for its inherent complexity. To address the challenges, we propose a high efficiency distributed SVM framework over data stream (HDSVM), which consists of two main algorithms, incremental learning algorithm and distributed algorithm. Firstly, we propose a partial support vectors reserving incremental learning algorithm (PSVIL). By selecting a subset of support vectors based on their distances to classification hyperplane instead of the universal set to update SVM, the algorithm achieves lower time overhead while ensuring accuracy. Secondly, we propose a distribution remaining partition and fast aggregation distributed algorithm (DRPFA) for SVM. The real-time data is partitioned based on the original distribution with clustering instead of random partition, and historical support vectors are partitioned based on their distances to the classification hyperplane. The global hyperplane can be obtained by averaging the parameters of local hyperplanes due to the above partition strategy. Extensive experiments on Apache Storm show that the proposed HDSVM achieve lower time overhead and similar accuracy compared with the state-of-art. Speed-up ratio is increased by 2-8 times within 1% accuracy deviation.

关键词： distributed SVM Incremental learning Data stream Support vector selection Distance distribution

来源：评论

学校读者我要写书评

暂无评论

A Load-Balanced parallel and distributed Sorting Algorithm Implemented with PGX.D 31

A Load-Balanced Parallel and Distributed Sorting Algorithm I...

引用

31st IEEE international parallel and distributed processing symposium Workshops (IPDPS)

作者： Khatami, Zahra Hong, Sungpack Lee, Jinsoo Depner, Siegfried Chafi, Hassan Ramanujam, J. Kaiser, Hartmut Oracle Labs Belmont CA 94002 USA Louisiana State Univ Ctr Computat & Technol Baton Rouge LA 70803 USA

ISBN: (纸本)9780769561493

Sorting has been one of the most challenging studied problems in different scientific researches. Although many techniques and algorithms have been proposed on the theory of having efficient parallel sorting implementation, however achieving desired performance on different types of the architectures with large number of processors is still a challenging issue. Maximizing parallelism level in applications can be achieved by minimizing overheads due to load imbalance and waiting time due to memory latencies. In this paper, we present a distributed sorting algorithm implemented in PGX.D, a fast distributed graph processing system, which outperforms the Spark's distributed sorting implementation by around 2x-3x by hiding communication latencies and minimizing unnecessary overheads. Furthermore, it shows that the proposed PGX.D sorting method handles dataset containing many duplicated data entries efficiently and always results in keeping balanced workloads for different input data distribution types.

关键词： distributed sorting method PGX.D distributed graph framework Graph

来源：评论

学校读者我要写书评

暂无评论

A Service Scheduling Policy for Improving Playback Quality of Mesh-based P2P VoD Systems 15

A Service Scheduling Policy for Improving Playback Quality o...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Huang, Guowei Kong, Lingjing Wu, Keke Chen, Zhi Shenzhen Inst Informat Technol Comp Coll Shenzhen Peoples R China Tianjin Polytech Univ Comp Coll Tianjin Peoples R China

ISBN: (纸本)9781538637906

In recent years, the peer-to-peer (P2P) assisted video-on-demand (VoD) system has achieved tremendous success among the Internet users. In academic, a number of research efforts have focused on the effective use of such system in providing large scale video streaming services. However, there are still a number of fundamental open problems in designing P2P VoD systems. In this paper, we consider a mesh-based P2P VoD system and focus on the service scheduling problem that how should a node serve the received requests in its serving queue. The problem is crucial to the playback quality of the system. We analytically study the service scheduling problem and model it as a Multi-Knapsack Problem (MKP). Based on the analysis, we propose a Playback-Quality-Aware Scheduling (PQAS) policy which takes the diversity among requests in impacting the playback quality of system into consideration. We perform extensive simulations and the experimental results conform the effectiveness of PQAS in improving the playback quality of system.

关键词： Peer-to-peer computing Streaming media Bandwidth Servers Analytical models Probabilistic logic Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Fine-Grained Secure Control of Smart Actuators in Internet of Things 15

Distributed Fine-Grained Secure Control of Smart Actuators i...

引用

15th IEEE international symposium on parallel and distributed processing with applications (ISPA) / 16th IEEE international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Kouicem, Djamel Eddine Bouabdallah, Abdelmadjid Lakhlef, Hicham Univ Technol Compiegne Sorbonne Univ HEUDIASYC UMR 7253 CNRS CS 60319 F-60203 Compiegne France

ISBN: (纸本)9781538637906

Internet of Things is a new emerging technology that promises a new era of Internet through encompassing seamlessly physical and digital worlds in one single intelligent ecosystem. This goal is achieved by interconnecting a large number of smart objects from the physical word such as smartphones, sensors, robots, connected cars, etc., to Internet. Nowadays, with the advent of Internet of Things, we need efficient mechanisms to remotely control IoT smart actuators by users and controllers using smartphones and IoT devices. This arises particularly in industrial Cyber-Physical Systems to supervise industrial processes. However, the complex environment of IoT systems makes this task very difficult to achieve regarding the number of connected objects and their resource limitation. In this paper, we tackle the problem of remote secure control of IoT actuators. We propose a distributed lightweight fine-grained access control based on Attribute Based Encryption mechanism and one way hash chain. We conducted security analysis and formal verification using AVISPA. The results demonstrated that our scheme is secure against various attacks. Moreover, the simulation results demonstrated the scalability and the efficiency of our solution, which saves substantially energy consumption and computation costs.

关键词： Secure control Internet of Things Attribute Based Encryption Smart Actuators

来源：评论

学校读者我要写书评

暂无评论

A Design of a Programmable Impedance Scaling Circuit for Low Frequency applications

A Design of a Programmable Impedance Scaling Circuit for Low...

引用

IEEE international symposium on Intelligent Signal processing and Communication Systems (ISPACS)

作者： Takeshi Ohbuchi Koutarou Fujishiro Fujihiko Matsumoto National Defense Academy 1-10-20 Hashirimizu Yokosuka Japan

A large capacitor is needed for low-frequency active filters to process biomedical signals. The large capacitor is implemented by an impedance scaling circuit. However, the apparent capacitance of the conventional impedance scaling circuit cannot be tuned because that the scaling factor of the impedance scaling circuit is designed by the size of transistors of a negative current feedback circuit. This paper presents a digitally programmable impedance scaling circuit using electrical switches. The proposed circuit is realized by controlling the number of parallel MOS devices which compose the negative current feedback circuit using electrical switches. The validity of the proposed method is confirmed by simulations using HSPICE. The frequency characteristics of the proposed impedance scaling circuits using ideal switches are not deteriorated as compared with one of the conventional impedance scaling circuit. If the capacitor varies from -22% to +49.5%, the tuning error of the proposed impedance scaling circuit is within 0.5%. The proposed circuit can be applied to a 2nd order Butterworth filter whose cutoff frequency is 100 Hz.

关键词： Impedance Capacitors Capacitance Transistors MOS devices Switches Logic gates

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 36 37 38 39 40 41 42 43 44 45 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：