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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

32 篇 会议
3 篇 期刊文献
2 册 图书

馆藏范围

37 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

13 篇 工学
- 10 篇 计算机科学与技术...
- 5 篇 软件工程
- 4 篇 电子科学与技术（可...
- 2 篇 动力工程及工程热...
- 2 篇 电气工程
- 2 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 控制科学与工程
- 1 篇 交通运输工程
- 1 篇 生物工程
3 篇 理学
- 3 篇 数学
- 1 篇 生物学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 公共管理
1 篇 医学
- 1 篇 公共卫生与预防医...

主题

16 篇 parallel process...
13 篇 laboratories
11 篇 computer science
5 篇 bandwidth
4 篇 concurrent compu...
4 篇 computer archite...
4 篇 cache memory
4 篇 delay
3 篇 memory managemen...
3 篇 process design
3 篇 computational mo...
3 篇 performance eval...
3 篇 hardware
2 篇 runtime
2 篇 information syst...
2 篇 theory of comput...
2 篇 libraries
2 篇 operating system...
2 篇 scheduling algor...
2 篇 throughput

机构

12 篇 parallel process...
3 篇 science and tech...
2 篇 artificial intel...
2 篇 college of compu...
2 篇 national laborat...
2 篇 national laborat...
2 篇 college of syste...
2 篇 information and ...
2 篇 chongqing liangj...
2 篇 dept. of cs geor...
2 篇 college of infor...
2 篇 national laborat...
2 篇 services computi...
2 篇 chongqing guanyi...
2 篇 cluster and grid...
2 篇 department of co...
2 篇 national laborat...
1 篇 software school ...
1 篇 science and tech...
1 篇 computer system ...

作者

14 篇 shin-dug kim
9 篇 sung-bong yang
9 篇 tack-don han
4 篇 kim shin-dug
3 篇 won-kee hong
3 篇 youngsik kim
3 篇 jang-soo lee
2 篇 jianhua sun
2 篇 mi-jung noh
2 篇 yi pan
2 篇 han tack-don
2 篇 chun-mok chung
2 篇 nong xiao
2 篇 gi-ho park
2 篇 oh-young kwon
2 篇 hai jin
2 篇 jie liu
2 篇 yang sung-bong
1 篇 ye yuan
1 篇 zhang tao

语言

37 篇 英文

检索条件"机构=Parallel Processing System Laboratory"

共 37 条记录，以下是21-30 订阅

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

详细简洁

排序：

An efficient local address generation for the block-cyclic distribution

An efficient local address generation for the block-cyclic d...

引用

IEEE International Conference on Algorithms and Architectures for parallel processing (ICAP)

作者： Oh-Young Kwon Tae-Geun Kim Tack-Don Han Sung-Bong Yang Shin-Dug Kim Distributed Computing Laboratory Systems Engineering Research Institute Taejon South Korea Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time /spl Delta/M table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a /spl Delta/M table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time /spl Delta/M table generation method is faster than other algorithms in /spl Delta/M table generation time and access time for 10,000 array elements.

关键词： Runtime Equations Distributed computing systems engineering and theory parallel processing Laboratories Computer science parallel languages Upper bound Automata

来源：评论

学校读者我要写书评

暂无评论

A Heterogeneous Processor Design for CNN-Based AI Applications on IoT Devices 8

A Heterogeneous Processor Design for CNN-Based AI Applicatio...

引用

8th International Conference on Identification, Information and Knowledge in the Internet of Things, IIKI 2019

作者： Liu, Zhiqiang Jiang, Jingfei Lei, Guoqing Chen, Kai Qin, Buyue Zhao, Xiaoqiang Artificial Intelligence Research Center National Innovation Institute of Defense Technology Beijing China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China College of System Engineering National University of Defense Technology Changsha China

This paper proposes a heterogeneous processor design for CNN-based AI applications on IoT devices. The heterogeneous processor contains an embedded RISC-V CPU that works as a general processor and an efficient CNN-accelerator that supports a variety of CNN models with a list of macro instructions. For demonstration, we implement a prototype on an FPGA platform with the RISC-V CPU working under 20 MHz and the CNN accelerator working under 100 MHz. As a case study, we run a CNN-based face detection and recognition application on this prototype. The prototype can process one image in 0.72 seconds and an ASIC implementation working under 400 MHz can process one image in less than 0.15 seconds by estimation, which can satisfy the needs for many IoT scenarios such as access control systems and check-in systems. © 2020 The Authors. Published by Elsevier B.V.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

A Java Internet computing environment with effective configuration method

A Java Internet computing environment with effective configu...

引用

International Symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Chun-Mok Chung Pil-Sup Shin Shin-Dug Kim Software Laboratory Information OBU LG Information and Communications Limited Seoul South Korea Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

For an effective Internet based distributed parallel computing platform, Java-Internet Computing Environment (JICE) is designed and implemented with multithreading and remote method invocation mechanisms provided in Java. Specifically, JICE supports a shared memory system model for communication between any two nodes. Under the JICE, communication time is a major candidate of performance bottleneck. To reduce this communication overhead, a method of grouping is designed based on the optimal communication time. Communication performance given by grouping is evaluated through the analysis of execution time and verified via experiments. The results show that communication time can be reduced about 80% from executing some Java benchmarks on JICE.

关键词： Java Internet parallel processing Concurrent computing Computer networks Computer interfaces Power engineering computing Local area networks Computer science Magnetic heads

来源：评论

学校读者我要写书评

暂无评论

Optimizing All-to-All Collective Communication on Tianhe Supercomputer

Optimizing All-to-All Collective Communication on Tianhe Sup...

引用

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

作者： Jintao Peng Jie Liu Yi Dai Min Xie Chunye Gong National University of Defense Technology ChangSha China Science and Technology on Parallel and Distributed Processing Laboratory NUDT Changsha China Changsha and Laboratory of Software Engineering for Complex System NUDT Changsha China

All-to-all communication has a wide range of ap-plications in parallel applications like FFT. On most supercom-puters, there are multiple cores in a node. Message aggregation is an efficient method for smaller messages. Using multi-leader to aggregate message show significant improvement in intra-node overhead. However, compared to one-leader aggregation, existing multi-leader design incurs more message count and less aggregated message size. This paper proposes an Overlapped Multi-worker Multi-port all-to-all (OVALL) to scale the message size and parallelism of the aggregation algorithm. The algorithm exploits the all-to-all multi-core parallelism, concurrent commu-nication, and overlapping capabilities. Experiment results show that, compared to systems built-in MPI, OVALL'implementation achieves up to 5.9x or 18x speedup compared to MPI on different HPC systems. For the Fast Fourier Transform (FFT) application, OVALL is up to 2.7x (8192 cores, system A) or 5.6x (4800 cores, system B) faster compared to built-in MPI on peak performance.

关键词： Multicore processing Fast Fourier transforms Scalability Aggregates Supercomputers Libraries Pipeline processing

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling algorithm for sporadic real-time tasks in multiprocessor systems

An energy-efficient scheduling algorithm for sporadic real-t...

引用

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Zhang, Dong-Song Chen, Fang-Yuan Li, Hong-Hua Jin, Shi-Yao Guo, De-Ke National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China School of Computing Science Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769545387

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. The experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

A continuous stream service and high service availability mechanism for continuous media servers

A continuous stream service and high service availability me...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Sung-In Jung Cheol-Hoon Lee Computer System Division Electronics and Telecommunications Research Institute Daejeon South Korea Parallel Processing Laboratory Department of Computer Engineering Chungnam National University Daejeon South Korea

ISBN: (纸本)8955191197

Due to the explosive growth of the Internet, stream services are becoming more popular. The large media servers supporting thousands of concurrent media streams have to satisfy us with both good throughout and high availability. Although they are reciprocal from the viewpoint of system performance, the stream service continuity, as well as throughput, should be considered in clustered media servers. This is because media stream services should be continuously available to the clients even on the event of system failure. In this paper, we introduce service availability as the gauge of service degree on media servers, and present the basic scheme for guaranteeing continuous stream service. To do this, we propose LSS(Log Stream Status) and RRD(Ready Resource for instant Delivery) mechanisms. They are classified according to the status management method of stream service and the resumption method of closed service. Although these mechanisms require additional overhead, we found that they can be applied to clustered media servers with minimum overhead. Additionally, we concluded that they can provide higher quality of service availability on traditional clustered media servers.

关键词： Availability Streaming media Web server Concurrent computing Telecommunication computing Quality of service Network servers Monitoring parallel processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

A selective temporal and aggressive spatial cache system based on time interval

A selective temporal and aggressive spatial cache system bas...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Jung Hoon Lee Jang-Soo Lee Shin-Dug Kim Dept. of Comput. Sci. Yonsei Univ. Seoul South Korea Department of Computer Science Parallel Processing System Laboratory Yonsei University Seoul South Korea

This paper proposes a new cache system that can increase the effect by temporal and spatial locality by using only simple hardware control without any locality detection hardware or compiler aid. The proposed cache system consists of two caches with different associativities and different block sizes, i.e., a direct-mapped cache with small block size and a fully associative spatial buffer with large block size as a multiple of small blocks. Therefore, the spatial locality can be exploited by aggressively fetching large blocks including any missed small block into the buffer, and the temporal locality can also be exploited by selectively storing small blocks that were referenced at the spatial buffer in the past. To determine the blocks to be stored at the direct-mapped cache, the proposed cache system uses a time interval-based selection mechanism. According to the simulation results, similar performance can be achieved by using four times smaller cache size compared with the conventional direct-mapped cache.

关键词： Buffer storage Hardware parallel processing Laboratories Computer science Control systems Computational modeling Cache memory Delay Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Maximizing Uniform Multicast Throughput in Multi-Channel Dense Wireless Sensor Networks 12

Maximizing Uniform Multicast Throughput in Multi-Channel Den...

引用

12th International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2016

作者： Jiao, Xianlong Chen, Guirong Wang, Xiaodong Chen, Yuli Yang, Li Information and Navigation College Air Force Engineering University Xi'an710077 China College of Information System and Management National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Chongqing Guanyinqiao Elementary School Chongqing400020 China Chongqing Liangjiangxinqu Renhe Experimental School Chongqing400021 China

ISBN: (纸本)9781509056965

This paper investigates the problem of maximizing uniform multicast throughput (MUMT) for multi-channel dense wireless sensor networks, where all nodes locate within one-hop transmission range and can communicate with each other on multiple orthogonal channels. This kind of networks show wide application in the real world, and maximizing uniform multicast throughput for these networks is worth deep studying. Previous researches have proved MUMT problem is NP-hard. However, previous researches are either hard to implement, or use too many relay nodes to complete the multicast task, and thus incur high overhead or poor performance. To efficiently solve MUMT problem, we adopt the concept of the maximum independent set with the size constraint, and present one novel Single-Broadcast based Multicast algorithm called SBM based on the concept. We prove that SBM algorithm achieves a constant ratio to the theoretical throughput upper bound. Extensive experimental results demonstrate that, SBM performs better than existing work in terms of both the uniform multicast throughput and the total number of transmissions. © 2016 IEEE.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Grid and Cooperative Computing - GCC 2004 Workshops 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Hai Jin Yi Pan Nong Xiao Jianhua Sun

ISBN: (数字)9783540302070

ISBN: (纸本)9783540235781

Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computer science and the GCC conference has become one of the premier forums for presentation of new and exciting research in all aspectsofgridandcooperativecomputing. Theprogramcommitteeispleasedtopresent the proceedings of the 3rd International Conference on Grid and Cooperative Comp- ing (GCC2004), which comprises a collection of excellent technical papers, posters, workshops, and keynote speeches. The papers accepted cover a wide range of exciting topics, including resource grid and service grid, information grid and knowledge grid, grid monitoring,managementand organizationtools, grid portal, grid service, Web s- vices and their QoS, service orchestration, grid middleware and toolkits, software glue technologies, grid security, innovative grid applications, advanced resource reservation andscheduling,performanceevaluationandmodeling,computer-supportedcooperative work, P2P computing, automatic computing, and meta-information management. The conference continues to grow and this year a record total of 581 manuscripts (including workshop submissions) were submitted for consideration. Expecting this growth, the size of the program committee was increased from 50 members for GCC 2003 for 70 in GCC 2004. Relevant differences from previous editions of the conf- ence: it is worth mentioning a signi?cant increase in the number of papers submitted by authors from outside China; and the acceptance rate was much lower than for p- vious GCC conferences. From the 427 papers submitted to the main conference, the program committee selected only 96 regular papers for oral presentation and 62 short papers for poster presentation in the program.

关键词： Theory of Computation Computer Communication Networks Operating systems Information systems Applications (incl. Internet) Information Storage and Retrieval User Interfaces and Human Computer Interaction

来源：评论

学校读者我要写书评

暂无评论

RPSim: A Rapid Prototyping Full-system Simulator for SoC Software Development

RPSim: A Rapid Prototyping Full-System Simulator for SoC Sof...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Haojun Wang Qinghao Min Yi Li Weihua Zhang Software School Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China State Key Laboratory of ASIC & System Fudan University Shanghai China Parallel Processing Institute Fudan University Shanghai China

Nowadays, the release of SoC products has come to a burst. Time-to-market of these products has been shortened to an extreme, nearly 8 to 12 months. To reduce production period, hardware architects generally combine well-tuned IP cores in their designs. To guarantee the process of SoC software development, which will finally decide the release time of products, a fast prototyping simulation platform for SoC software development should be available as soon as possible after hardware design. However, state-of-the-art SoC simulators lack the support for fast integration of IP core and require time-consuming compiler chain modifications for new instructions. In this paper, we present Prism, an extensible and easy-to-use full-system SoC simulation platform for SoC software development. Two mechanisms are designed and implemented to support fast prototyping for new IP core simulation or new instruction extension without compiler tool chain modifications. First, a hardware and software hybrid mechanism is proposed for IP core fast prototyping. A seamless interface is used to eliminate the differences among IP cores. Second, a configurable library mechanism is designed for new instruction extension. Register dependence can be maintained for detailed timing simulation without compiler tool chain modification. In such a design, the major effort for extension is to specify the elaborate common customization interface. Experimental results show these mechanisms only involve about 0.36% runtime overhead. Based on RPSim, a graduate student only needs write about 40 lines of code and takes less than half an hour to extend a new IP core simulation in RPSim.

关键词： IP networks Frequency modulation Field programmable gate arrays system-on-chip Timing Libraries Software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：