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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

3,536 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3536 条记录，以下是561-570 订阅

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

详细简洁

排序：

HPC system software for regular and irregular parallel applications

HPC system software for regular and irregular parallel appli...

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Morari, Alessandro Valero, Mateo Barcelona Supercomputing Center Barcelona Spain Universitat Politecnica de Catalunya Barcelona Spain

ISBN: (纸本)9780769549798

the upcoming generation of system software for High Performance Computing is expected to provide a richer set of functionalities without compromising application performance. this Ph.D. thesis addresses the problem of designing scalable system software for both regular and irregular applications. the contributions are two-fold. First, we evaluate the drawbacks of current HPC system software for regular applications. We describe a methodology to precisely measure jitter on a general-purpose OS. Considering a lightweight operating system (IBM CNK), we analyze the overhead of adding support for a missing feature such as dynamic memory management. Second, we focus on irregular applications and build a specialized runtime system to enhance this kind of applications on common HPC flop intensive systems. the proposed runtime system provides a global address space abstraction of a distributed memory machine combined with a transparent fork/join execution model and it also includes lightweight multithreading and network message aggregation. © 2013 ieee.

关键词： Jitter

来源：评论

学校读者我要写书评

暂无评论

A High-throughput FPGA Architecture for parallel Connected Components Analysis Based on Label Reuse

A High-Throughput FPGA Architecture for Parallel Connected C...

引用

12th International Conference on Field-Programmable Technology (FPT)

作者： Klaiber, Michael J. Bailey, Donald G. Ahmed, Silvia Baroud, Yousef Simon, Sven Univ Stuttgart Inst Parallel & Distributed Syst Stuttgart Germany Massey Univ Sch Engn & Adv Technol Palmerston North New Zealand

ISBN: (纸本)9781479921980;9781479921997

A memory efficient architecture for single-pass connected components analysis suited for high throughput embedded image processing systems is proposed which achieves a high throughput by partitioning the image into several vertical slices processed in parallel. the low latency of the architecture allows reuse of labels associated with the image objects. this reduces the amount of memory by a factor of more than 5 compared to previous work. this is significant, since memory is a critical resource in embedded image processing on FPGAs.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for graph optimization using tree decompositions

Parallel algorithms for graph optimization using tree decomp...

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Sullivan, Blair D. Weerapurage, Dinesh Groer, Chris Oak Ridge National Laboratory P.O. Box 2008 Oak Ridge TN 37831-6015 United States Link Analytics 1050 Crown Pointe Pkwy Atlanta GA 30338 United States

ISBN: (纸本)9780769549798

Although many NP-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the dynamic programming tables and excessive runtimes of sequential implementations. this work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task based runtime, and computational results demonstrate scaling. this work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques. © 2013 ieee.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Multiobjective evolutionary approach to silicon solar cell design optimization

Multiobjective evolutionary approach to silicon solar cell d...

引用

5th Asia symposium on Quality Electronic Design, ASQED 2013

作者： Huang, Wen-Tsung Chen, Chieh-Yang Chen, Yu-Yu Hsu, Sheng-Chia Li, Yiming Parallel and Scientific Computing Laboratory Department of Electrical and Computer Engineering National Chiao Tung University 1001 Ta-Hsueh Road Hsinchu 300 Taiwan

ISBN: (纸本)9781479913145

In this study, we implement a device simulation-based multi-objective evolutionary algorithm (MOEA) for the optimal design of silicon solar cells. the short-circuited current, the open-circuited voltage, and the conversion efficiency are calculated and used to evaluate the fitness score and access the evolutionary quality of designing parameters via the implemented non-dominating sorting genetic algorithm in the unified optimization framework. Designing parameters, the material and structural parameters are simultaneously optimized for the explored solar cells. Our device simulation-based MOEA methodology is useful, compared with the conventional genetic algorithm, in the solar cell design optimization. © 2013 ieee.

关键词： thin film solar cells

来源：评论

学校读者我要写书评

暂无评论

Network delay-Aware load balancing in selfish and cooperative distributed systems

Network delay-Aware load balancing in selfish and cooperativ...

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Skowron, Piotr Rzadca, Krzysztof Faculty of Mathematics Informatics and Mechanics University of Warsaw Warsaw Poland

ISBN: (纸本)9780769549798

We consider a geographically distributed request processing system composed of various organizations and their servers connected by the Internet. the latency a user observes is a sum of communication delays and the time needed to handle the request on a server. the handling time depends on the server congestion, i.e. the total number of requests a server must handle. We analyze the problem of balancing the load in a network of servers in order to minimize the total observed latency. We consider both cooperative and selfish organizations (each organization aiming to minimize the latency of the locally-produced requests). the problem can be generalized to the task scheduling in a distributed cloud;or to content delivery in an organizationally-distributed CDNs. In a cooperative network, we show that the problem is polynomially solvable. We also present a distributed algorithm iteratively balancing the load. We show how to estimate the distance between the current solution and the optimum based on the amount of load exchanged by the algorithm. During the experimental evaluation, we show that the distributed algorithm is efficient, therefore it can be used in networks with dynamically changing loads. In a network of selfish organizations, we prove that the price of anarchy (the worst-case loss of performance due to selfishness) is low when the network is homogeneous and the servers are loaded (the request handling time is high compared to the communication delay). After relaxing these assumptions, we assess the loss of performance caused by the selfishness experimentally, showing that it remains low. Our results indicate that a set of servers handling requests, connected in a heterogeneous network, can be efficiently managed by a distributed algorithm. Additionally, even if the network is organizationally distributed, with individual organizations optimizing performance of their requests, the network remains efficient. © 2013 ieee.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

HadoopCL: MapReduce on distributed heterogeneous platforms through seamless integration of hadoop and OpenCL

HadoopCL: MapReduce on distributed heterogeneous platforms t...

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Grossman, Max Breternitz, Mauricio Sarkar, Vivek Department of Computer Science Rice University United States AMD United States

ISBN: (纸本)9780769549798

As the scale of high performance computing systems grows, three main challenges arise: the programmability, reliability, and energy efficiency of those systems. Accomplishing all three without sacrificing performance requires a rethinking of legacy distributed programming models and homogeneous clusters. In this work, we integrate Hadoop MapReduce with OpenCL to enable the use of heterogeneous processors in a distributed system. We do this by exploiting the implicit data parallelism of mappers and reducers in a MapReduce system. Combining Hadoop and OpenCL provides 1) an easy-to-learn and flexible application programming interface in a high level and popular programming language, 2) the reliability guarantees and distributed file system of Hadoop, and 3) the low power consumption and performance acceleration of heterogeneous processors. this paper presents HadoopCL: an extension to Hadoop which supports execution of user-written Java kernels on heterogeneous devices, optimizes communication through asynchronous transfers and dedicated I/O threads, automatically generates OpenCL kernels from Java byte code using the open source tool APARAPI, and achieves nearly 3x overall speedup and better than 55x speedup of the computational sections for example MapReduce applications, relative to Hadoop. © 2013 ieee.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

HyCache: A user-level caching middleware for distributed file systems

HyCache: A user-level caching middleware for distributed fil...

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Zhao, Dongfang Raicu, Ioan Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States Mathematics and Computer Science Division Argonne National Laboratory Argonne IL 60439 United States

ISBN: (纸本)9780769549798

One of the bottlenecks of distributed file systems deals with mechanical hard drives (HDD). Although solid-state drives (SSD) have been around since the 1990's, HDDs are still dominant due to large capacity and relatively low cost. Hybrid hard drives with a small built-in SSD cache does not meet the need of a large variety of workloads. this paper proposes a middleware that manages the underlying heterogeneous storage devices in order to allow distributed file systems to leverage the SSD performance while leveraging the capacity of HDD. We design and implement a user-level file system, HyCache, that can offer SSD-like performance at a cost similar to a HDD. We show how HyCache can be used to improve performance in distributed file systems, such as the Hadoop HDFS. Experiments show that HyCache achieves up to 7X higher throughput and 76X higher IOPS than Linux Ext4 file system, and can accelerate HDFS by 28% at 32-node scales (compared to vanilla HDFS). © 2013 ieee.

关键词： Hard disk storage

来源：评论

学校读者我要写书评

暂无评论

parallel macro pipelining on the intel SCC many-core computer

Parallel macro pipelining on the intel SCC many-core compute...

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Suss, Tim Schoenrock, Andrew Meisner, Sebastian Plessl, Christian Johannes Gutenberg-University Mainz Zentrum fur Datenverarbeitung Mainz Germany Carleton University School of Computer Science Ottawa Canada University of Paderborn Paderborn Center for Parallel Computing Paderborn Germany

ISBN: (纸本)9780769549798

In this paper we present how Intel's Single-Chip-Cloud processor behaves for parallel macro pipeline applications. Subsets of the SCC's available cores can be arranged as a pipeline where each core processes one stage of the overall workload. Each of the independent cores processes a small part of a larger task and feeds the following core with new data after it finishes its work. Our case-study is a parallel rendering system which renders successive images and applies different filters on them. On normal graphics adapters this is usually done in multiple cycles, we do this in a single pipeline pass. We show that we can achieve a significant speedup by using multiple parallel pipelines on the SCC. We show that we can further improve performance by using SCC's controlling PC in conjunction with the SCC. We also identify aspects of the SCC that hinder the overall performance, mainly the lack of local memory banks for each core on the SCC. the results presented in this paper are not limited to only image processing, but users could expect similar experiences where macro pipelining is used in other applications on the SCC. © 2013 ieee.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Accelerating distributed workflows with edge resources

Accelerating distributed workflows with edge resources

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Ramakrishnan, Siddharth Reutiman, Robert Chandra, Abhishek Weissman, Jon Dept. of Computer Science and Engineering University of Minnesota Twin Cities Minneapolis United States

ISBN: (纸本)9780769549798

distributed data-intensive workflow applications are increasingly relying on and integrating remote resources including community data sources, services, and computational platforms. Increasingly, these are made available as data, SAAS, and IAAS clouds. the execution of distributed data-intensive workflow applications can exposé network bottlenecks between clouds that compromise performance. In this paper, we focus on alleviating network bottlenecks by using a proxy network. In particular, we show how proxies can eliminate network bottlenecks by smart routing and perform in-network computations to boost workflow application performance. A novel aspect of our work is the inclusion of multiple proxies to accelerate different workflow stages optimizing different performance metrics. We show that the approach is effective for workflow applications and broadly applicable. Using Montage1 as an exemplar workflow application, results obtained through experiments on Planet Lab showed how different proxies acting in a variety of roles can accelerate distinct stages of Montage. Our microbenchmarksalso show that routing data through select proxies can accelerate network transfer for TCP/UDP bandwidth, delay, and jitter, in general. © 2013 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Tolerating packet losses in wireless mesh networks

Tolerating packet losses in wireless mesh networks

引用

2013 ieee 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Engelhardt, Frank Lindhorst, Timo Nett, Edgar University of Magdeburg Institute for Distributed Systems Universiẗatsplatz 2 39106 Magdeburg Germany

ISBN: (纸本)9780769549798

Wireless Mesh Networks (WMNs) provide a promising foundation for a flexible and reliable communication infrastructure in industrial environments. Meeting the QoS demands of real-time applications, though, requires the deployment of various advanced mechanisms. Compared to wired networks, applications face higher packet loss rates in wireless networks due to the inherent unreliability of wireless communication. Furthermore, if mobile stations are involved, links that fail due to node movement frequently cause packet losses. In this paper, we present an approach to tolerate those specific losses by locally recovering lost packets and transiently re-routing them over an alternative path. the evaluation in real-world experiments shows that we can completely prevent packet loss without significantly increasing the end-to-end latency. this allows the deployment of WMNs for real-time applications without explicitly considering the increased error-proneness of wireless communication and station mobility. © 2013 ieee.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：