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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

269 篇 会议
7 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

138 篇 工学
- 129 篇 计算机科学与技术...
- 75 篇 软件工程
- 37 篇 电气工程
- 9 篇 电子科学与技术（可...
- 9 篇 控制科学与工程
- 7 篇 信息与通信工程
- 6 篇 机械工程
- 2 篇 光学工程
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 2 篇 网络空间安全
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 纺织科学与工程
25 篇 理学
- 16 篇 数学
- 6 篇 物理学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 生物学
24 篇 管理学
- 15 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 8 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 3 篇 作物学
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 医学

主题

30 篇 peer to peer com...
26 篇 servers
21 篇 cloud computing
20 篇 parallel process...
19 篇 algorithm design...
19 篇 distributed comp...
18 篇 concurrent compu...
14 篇 computer archite...
13 篇 processor schedu...
13 篇 computational mo...
12 篇 bandwidth
12 篇 resource managem...
12 篇 protocols
12 篇 delay
11 篇 application soft...
11 篇 high performance...
10 篇 scalability
10 篇 routing
10 篇 streaming media
9 篇 hardware

机构

4 篇 equipe runtime i...
4 篇 equipe hiepacs i...
4 篇 institute of com...
3 篇 china univ geosc...
2 篇 institute of inf...
2 篇 pervasive techno...
2 篇 icar-cnr napoli
2 篇 school of comput...
2 篇 karlsruhe inst t...
2 篇 department of co...
2 篇 brookhaven natl ...
2 篇 computer science...
2 篇 natl univ def te...
2 篇 university of st...
2 篇 department of en...
2 篇 second universit...
2 篇 indiana univ per...
2 篇 shenzhen institu...
2 篇 department of co...
2 篇 univ texas dept ...

作者

4 篇 jean roman
4 篇 emmanuel jeannot
4 篇 raymond namyst
3 篇 lizhe wang
3 篇 wang lizhe
2 篇 sens pierre
2 篇 jesper larsson t...
2 篇 michael alexande...
2 篇 feng wu-chun
2 篇 divitini monica
2 篇 sergio bernabe
2 篇 pinki pinki
2 篇 huang bormin
2 篇 li chen
2 篇 wang d
2 篇 nagalingam sv
2 篇 gianni francesco
2 篇 wang yijie
2 篇 tao jie
2 篇 ernst m.

语言

279 篇 英文
1 篇 其他
1 篇 中文

检索条件"任意字段=17th International Conference on Parallel and Distributed Computing Systems, PDCS 2004"

共 281 条记录，以下是171-180 订阅

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

详细简洁

排序：

A Method for Improving Concurrent Write Performance by Dynamic Mapping Virtual Storage System Combined with Cache Management

A Method for Improving Concurrent Write Performance by Dynam...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Fen Li Qingzhong Bu Weiwei Li Xiaoxuan Meng Lu Xu Jiangang Zhang Graduate University of Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China Eletrical and Computer Engineering Department University of Delaware USA

the paper presents a new dynamic mapping virtual storage system, which is characterized by: (a) distribute storage resources according to need, thus improving storage resource utilization, (b) more fundamentally, through write-anywhere pattern to sequentialize concurrent write requests by dynamic address mapping mechanism, thus improving concurrent write performance for applications. Meanwhile, taking into account imperfection small size write requests handling and the negative impact on read performance, we combine the system with CBD system which is responsible for optimizing cache management. We have implemented our virtual storage system in Linux kernel 2.6.18 as a pseudo device driver. the experiment results show that concurrent write bandwidth approaches raw disk write performance. And in 64-stream concurrent write case, E-ASD can outperform concurrent write bandwidth of LVM by up to 160%, and its max single-stream read loss is less than 25% compared to LVM, with concur-rent read performance close to each other. Read performance still has space to be improved given larger cache and proper prefetching.

关键词： Performance evaluation Bandwidth Resource management Aggregates Linux Variable speed drives Layout

来源：评论

学校读者我要写书评

暂无评论

PADS: A Pattern-Driven Stencil Compiler-Based Tool for Reuse of Optimizations on GPGPUs

PADS: A Pattern-Driven Stencil Compiler-Based Tool for Reuse...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Dongni Han Shixiong Xu Li Chen Lei Huang Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China Computer Science Department Prairie View A&M University USA

Stencil computations are core of wide range of scientific and engineering applications. A lot of efforts have been put into improving efficiency of stencil calculations on different platforms, but unfortunately it is not easy to reuse. In this paper we present a PAttern-Driven Stencil compiler-based tool and a simple tuning system to reuse those well optimized methods and codes. We also suggest extensions to OpenMP, depicting high-level data structures in order to facilitate recognition of various stencil computation patterns. the PADS allows programmers to rewrite kernel of stencils or reuse source-to-source translator outputs as optimized stencil template codes with related tuning parameters, In addition, PADS consists of a OpenMP to CUDA translator and code generator using optimized template codes. It also obtains architecture-specific parameters to tune stencils across different GPU platforms. To demonstrate our system flexibility and performance portability, we illustrate four different stencil computations, Laplacian operator with Jacobi iterative method, divergence operator, 3 dimension 25 point stencil and a 2D heat equation using ADI method with periodic boundary conditions. PADS succeeds in generating all these four stencil codes using different optimization strategies and delivers a promising performance improvement.

关键词： Pattern matching Kernel Tuning Libraries Optimization Generators

来源：评论

学校读者我要写书评

暂无评论

An Optimal Topology for a Static P2P Live Streaming Network with Limited Resources

An Optimal Topology for a Static P2P Live Streaming Network ...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Jonathan Stern Omer Luzzatti Raphael Goldberg Eran Weiss Mira Gonen RayV research RayV Inc. Tel-Aviv Israel Computer Science Department Barilan University Ramat-Gan Israel

In this paper we propose a P2P live streaming topology, prove its optimality under common constraints, and match the analytical research with results from a running commercial network. We assume two types of nodes: viewers that consume the entire media, and amplifiers which are non-viewing nodes utilized for their upstream bandwidth. We analytically derive the minimum needed server upload capacity, for any topology, under the following assumptions: the amount of amplifiers and buffer time are limited, dynamics are low, and the total bandwidth required by the viewers exceeds the total upstream bandwidth of all peers. then, we present a two-level topology and prove that it achieves the minimum possible server upload, up to a small fraction. Finally, the assumptions and derivation are supported by performing several experiments on RayV's real-world commercial system, with varying network parameters. Namely, we show our predictions are valid while varying the viewers to amplifiers ratio, the stream bit-rate, and the country of the peers. these results not only verify the analytical static predictions, but also evaluate the dynamic costs during the `flash crowd', the initial time when peers are joining the system.

关键词： Peer to peer computing Servers Topology USA Councils Equations Network topology Delay

来源：评论

学校读者我要写书评

暂无评论

Scheduling Mixed Real-Time and Non-real-Time Applications in MapReduce Environment

Scheduling Mixed Real-Time and Non-real-Time Applications in...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Xicheng Dong Ying Wang Huaming Liao Institute of Computing Technology Chinese Academy of Sciences China

MapReduce scheduling is becoming a hot topic as MapReduce attracts more and more attention from both industry and academia. In this paper, we focus on the scheduling of mixed real-time and non-real-time applications in MapReduce environment, which is a challenging problem but receives only limited attention. To solve this problem, we present a two-level MapReduce scheduler built on previous techniques and make two key contributions. First, to meet the performance goal of real-time applications, we propose a deadline scheduler which adopts (1) a sampling based approach-Tasks Forward Scheduling (TFS) to predict map/reduce task execution time(unlike prior work that requires users to input an estimated value). (2) a resource allocation model-Approximately Uniform Minimum Degree of parallelism (AUMD) to dynamically control each realtime job to execute with minimum tasks assignment in any time so as to maximize the number of concurrent real-time jobs. Second, through integrating this deadline scheduler into existing MapReduce scheduler, we develop a two-level scheduler with resource preemption supported, and it could schedule mixed real-time and non-real-time jobs according to their respective performance demands. We implement our scheduler in Hadoop system and experiments running on a real, small-scale cluster demonstrate that it could schedule mixed real-time and nonreal-time jobs to meet their different quality-of-service (QoS) demands.

关键词： Real time systems Schedules Processor scheduling Manganese Quality of service Resource management

来源：评论

学校读者我要写书评

暂无评论

FPGA Design of an Automatic Target Generation Process for Hyperspectral Image Analysis

FPGA Design of an Automatic Target Generation Process for Hy...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Sergio Bernabe Sebasti´n Lopez Antonio Plaza Roberto Sarmiento Pablo Garcia Rodriguez Hyperspectral Computing Laboratory Department of Technology of Computers and Communications University of Extremadura Caceres Spain Institute for Applied Microelectronics (IUMA) University of Las Palmas de Gran Canaria Tafira Baja Spain Grupo de Ingeniería de Medios (GIM) University of Extremadura Caceres Spain

Onboard processing of remotely sensed hyper spectral data is a highly desirable goal in many applications. For this purpose, compact reconfigurable hardware modules such as field programmable gate arrays (FPGAs) are widely used. In this paper, we develop a new implementation of an automatic target generation process (ATGP) for hyper spectral images. Our implementation is based on a design methodology that starts from a high-level description in Matlab (or alternative C/C++) and obtains a register transfer level (RTL) description that can be ported to FPGAs. In order to validate our new implementation, we develop a quantitative and comparative study using two different FPGA architectures: Xilinx Virtex-5 and Altera Stratix-III Altera. Experimental results have been obtained in the context of a real application focused on the detection of mineral components over the Cup rite mining district (Nevada), using hyper spectral data collected by NASA's Airborne Visible Infra-Red Imaging Spectrometer (AVIRIS). Our experimental results indicate that the proposed implementation can achieve peak frequency designs above 200MHz in the considered FPGAs, in addition to satisfactory results in terms of target detection accuracy and parallel performance. this represents a step forward towards the design of real-time onboard implementations of hyper spectral image analysis algorithms.

关键词： Field programmable gate arrays Hyperspectral imaging Algorithm design and analysis Hardware Vectors Image analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient Hybrid Push-Pull Based P2P Media Streaming System

Efficient Hybrid Push-Pull Based P2P Media Streaming System

引用

international conference on parallel and distributed systems (ICPADS)

作者： Chee Yik Keong Poo Kuan Hoong Choo-Yee Ting Faculty of Information Technology Multimedia University Cyberjaya Selangor Darul Ehsan Malaysia

Peer-to-Peer (P2P) communication is a popular protocol that has significant impacted and also changed the way for files being distributed over the large networks. Variants of P2P protocols are also applied for other media distribution such as audio and video streaming. the P2P protocol is widely adapted by researchers as a method to handle larger group of users. Cool streaming, the first large scale P2P streaming experiment till today, applied a mesh-based streaming system which has slowly evolved from a pure pull system to a hybrid push-pull system. In this paper, we present our proposed push-pull scheduling for P2P streaming that can heuristically select the most optimal frame to be pushed based on the rules that we designed. Our proposed solution incorporates the fast content distribution characteristic of both Push and Pull approaches. For performance evaluation, we compare our scheduling algorithm with the pure pull Cool streaming scheduling and Random push-pull scheduling where both scheduling serve as a benchmark in three main criteria - end-to-end delay, frame miss-ratio and frame redundancy. Simulation results showed that our proposed heuristic push-pull overall outperformed the other scheduling schemes, where our proposed scheduling algorithm demonstrates as a better solution towards reducing mesh delay in P2P streaming.

关键词： Peer to peer computing Delay Redundancy Streaming media Scheduling Scheduling algorithm Protocols

来源：评论

学校读者我要写书评

暂无评论

Scalable and Reliable Live Streaming Service through Coordinating CDN and P2P

Scalable and Reliable Live Streaming Service through Coordin...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Zhi Hui Lu Xiao Hong Gao Si Jia Huang Yi Huang School of Computer Science Fudan University Shanghai China Department of Media Communication Donghua University Shanghai China

In order to fully utilize CDN network edge nearby transmission capability and P2P scalable end-to-end transmission capability, while overcoming CDN's limited service capacity and P2P's dynamics, we need to combine the CDN and P2P technologies together. In recent years, some researchers have begun to focus on CDN-P2P-hybrid architecture and ISP-friendly P2P content delivery technology. In this paper, we firstly make an analysis on main problems of CDN-P2P-hybrid technology, and we compare some current existing solutions. And then we propose a novel scalable and reliable live streaming service scheme through coordinating CDN and P2P. In this scheme, different overlay hybrid methods, we design a smoother CDN and P2P overlay hybrid approach. After that we design a new peer node buffer structure for consuming media block from both CDN and P2P sources. And then we propose a novel algorithm for identifying and serving super node. the simulation experiment results show that our CDN-P2P-hybrid based live streaming scheme has better performance and reliability than pure P2P. Finally, we make a conclusion and analyze future research directions.

关键词： Peer to peer computing Servers Reliability Media Bandwidth Tin Streaming media

来源：评论

学校读者我要写书评

暂无评论

A space-efficient parallel algorithm for computing betweenness centrality in distributed memory

A space-efficient parallel algorithm for computing betweenne...

引用

17th international conference on High Performance computing, HiPC 2010

作者： Edmonds, Nick Hoefler, Torsten Lumsdaine, Andrew Open Systems Laboratory Indiana University Bloomington IN 47405 United States National Center of Supercomputing Applications University of Illinois at Urbana-Champaign Urbana IL 61801 United States

ISBN: (纸本)9781424485185

Betweenness centrality is a measure based on shortest paths that attempts to quantify the relative importance of nodes in a network. As computation of betweenness centrality becomes increasingly important in areas such as social network analysis, networks of interest are becoming too large to fit in the memory of a single processing unit, making parallel execution a necessity. parallelization over the vertex set of the standard algorithm, with a final reduction of the centrality for each vertex, is straightforward but requires Ω(|V|2) storage. In this paper we present a new parallelizable algorithm with low spatial complexity that is based on the best known sequential algorithm. Our algorithm requires O(|V| + |E|) storage and enables efficient parallel execution. Our algorithm is especially well suited to distributed memory processing because it can be implemented using coarse-grained parallelism. the presented time bounds for parallel execution of our algorithm on CRCW PRAM and on distributed memory systems both show good asymptotic performance. Experimental results with a distributed memory computer show the practical applicability of our algorithm. ©2010 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Study of Solid State Drives performance in PROOF distributed analysis system

Study of Solid State Drives performance in PROOF distributed...

引用

17th international conference on computing in High Energy and Nuclear Physics (CHEP)

作者： Panitkin, S. Y. Ernst, M. Petkus, R. Rind, O. Wenaus, T. Brookhaven Natl Lab Upton NY 11973 USA

Solid State Drives (SSD) is a promising storage technology for High Energy Physics parallel analysis farms. Its combination of low random access time and relatively high read speed is very well suited for situations where multiple jobs concurrently access data located on the same drive. It also has lower energy consumption and higher vibration tolerance than Hard Disk Drive (HDD) which makes it an attractive choice in many applications raging from personal laptops to large analysis farms. the parallel ROOT Facility-PROOF is a distributed analysis system which allows to exploit inherent event level parallelism of high energy physics data. PROOF is especially efficient together with distributed local storage systems like Xrootd, when data are distributed over computing nodes. In such an architecture the local disk subsystem I/O performance becomes a critical factor, especially when computing nodes use multi-core CPUs. We will discuss our experience with SSDs in PROOF environment. We will compare performance of HDD with SSD in I/O intensive analysis scenarios. In particular we will discuss PROOF system performance scaling with a number of simultaneously running analysis jobs.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

distributed analysis with PROOF in ATLAS collaboration

Distributed analysis with PROOF in ATLAS collaboration

引用

17th international conference on computing in High Energy and Nuclear Physics (CHEP)

作者： Panitkin, S. Y. Benjamin, D. Montoya, G. Carillo Cranmer, K. Ernst, M. Guan, W. Ito, H. Maeno, T. Majewski, S. Mellado, B. Rind, O. Shibata, A. Tarrade, F. Wenaus, T. Xu, N. Ye, S. Brookhaven Natl Lab Upton NY 11973 USA Duke Univ Durham NC 27708 USA Univ Wisconsin Madison Madison WI 53706 USA NYU New York NY 10003 USA

the parallel ROOT Facility - PROOF is a distributed analysis system which allows to exploit inherent event level parallelism of high energy physics data. PROOF can be configured to work with centralized storage systems, but it is especially effective together with distributed local storage systems - like Xrootd, when data are distributed over computing nodes. It works efficiently on different types of hardware and scales well from a multi-core laptop to large computing farms. From that point of view it is well suited for both large central analysis facilities and Tier 3 type analysis farms. PROOF can be used in interactive or batch like regimes. the interactive regime allows the user to work with typically distributed data from the ROOT command prompt and get a real time feedback on analysis progress and intermediate results. We will discuss our experience with PROOF in the context of ATLAS Collaboration distributed analysis. In particular we will discuss PROOF performance in various analysis scenarios and in multi-user, multi-session environments. We will also describe PROOF integration with the ATLAS distributed data management system and prospects of running PROOF on geographically distributed analysis farms.

关键词： High energy physics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：