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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

2,425 篇 工学
- 2,335 篇 计算机科学与技术...
- 1,551 篇 软件工程
- 465 篇 信息与通信工程
- 335 篇 电气工程
- 252 篇 控制科学与工程
- 185 篇 网络空间安全
- 179 篇 电子科学与技术（可...
- 41 篇 生物医学工程（可授...
- 34 篇 动力工程及工程热...
- 29 篇 机械工程
- 29 篇 建筑学
- 29 篇 生物工程
- 28 篇 安全科学与工程
- 25 篇 土木工程
- 23 篇 光学工程
- 22 篇 力学（可授工学、理...
- 20 篇 化学工程与技术
- 20 篇 交通运输工程
- 17 篇 环境科学与工程（可...
1,069 篇 理学
- 949 篇 数学
- 131 篇 统计学（可授理学、...
- 80 篇 系统科学
- 77 篇 物理学
- 37 篇 生物学
- 26 篇 化学
462 篇 管理学
- 363 篇 管理科学与工程(可...
- 231 篇 工商管理
- 123 篇 图书情报与档案管...
43 篇 经济学
- 43 篇 应用经济学
21 篇 法学
- 21 篇 社会学
15 篇 农学
14 篇 医学
11 篇 教育学
3 篇 文学
1 篇 军事学

主题

490 篇 parallel process...
381 篇 parallel process...
313 篇 concurrent compu...
294 篇 computer science
276 篇 distributed comp...
266 篇 distributed comp...
217 篇 parallel algorit...
163 篇 computer archite...
162 篇 application soft...
132 篇 computational mo...
130 篇 parallel program...
121 篇 costs
118 篇 hardware
110 篇 algorithm design...
110 篇 computer network...
108 篇 delay
107 篇 processor schedu...
88 篇 distributed proc...
84 篇 parallel archite...
78 篇 hypercubes

机构

13 篇 pacific northwes...
11 篇 ieee
9 篇 syracuse univ sy...
9 篇 georgia inst of ...
9 篇 department of co...
8 篇 new jersey inst ...
7 篇 ibm thomas j. wa...
7 篇 school of comput...
7 篇 purdue univ west...
7 篇 irisa rennes
6 篇 texas a&m univ c...
6 篇 univ of californ...
6 篇 michigan state u...
6 篇 univ of maryland...
6 篇 institute of com...
6 篇 ohio state univ ...
6 篇 carnegie mellon ...
5 篇 department of co...
5 篇 department of co...
5 篇 university of lu...

作者

14 篇 bader david a.
10 篇 li keqin
9 篇 zomaya albert y.
9 篇 prasanna viktor ...
9 篇 das sajal k.
8 篇 prasad sushil k.
8 篇 maciejewski anth...
8 篇 sussman alan
8 篇 sun xian-he
7 篇 ibarra oscar h.
7 篇 boukerche azzedi...
7 篇 casanova henri
7 篇 talbi el-ghazali
7 篇 panda dhabaleswa...
7 篇 olariu s.
7 篇 cai wentong
7 篇 ahmad ishfaq
7 篇 aluru srinivas
6 篇 pan yi
6 篇 dongarra jack

语言

3,544 篇 英文
3 篇 其他
1 篇 中文

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

共 3548 条记录，以下是411-420 订阅

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

详细简洁

排序：

Discrete min-energy scheduling on restricted parallel processors

Discrete min-energy scheduling on restricted parallel proces...

引用

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

作者： Jin, Xibo Zhang, Fa Liu, Zhiyong Institute of Computing Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769549798

Different from the previous work on energy-efficient algorithms, which focused on assumption that a task can be assigned to any processor, we study the problem of task Scheduling with the objective of Energy Minimization on Restricted parallel Processors (SEMRPP). Restriction accounts for affinities between tasks and processors, that is, a task has its own eligible processing set of processors. It assumes all tasks have a prescribed deadline on the execution time. We study the processors run at a finite number of distinct speeds, and the processors cannot change its speed during the computation of a task. Our work is motivated by the practical variable voltage processors that they cannot run at arbitrary speed and the task may be failure if the processor adjusts its speed during the computation of the task. We assess the complexity of the problem and present a polynomial time approximation algorithm with a bounded factor related to the adjacent speed ratio. © 2013 ieee.

关键词： Speed

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel and distributed algorithms for GIS polygonal overlay processing

Efficient parallel and distributed algorithms for GIS polygo...

引用

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

作者： Puri, Satish Prasad, Sushil K. Department of Computer Science Georgia State University Atlanta 30303 GA United States

ISBN: (纸本)9780769549798

Polygon overlay is one of the complex operations in Geographic Information Systems (GIS). In GIS, a typical polygon tends to be large in size often consisting of thousands of vertices. Sequential algorithms for this problem are in abundance in literature and most of the parallel algorithms concentrate on parallelizing edge intersection phase only. Our research aims to develop parallel algorithms to find overlay for two input polygons which can be extended to handle multiple polygons and implement it on General Purpose Graphics processing Units (GPGPU) which offers massive parallelism at relatively low cost. Moreover, spatial data files tend to be large in size (in GBs) and the underlying overlay computation is highly irregular and compute intensive. MapReduce paradigm is now standard in industry and academia for processing large-scale data. Motivated by MapReduce programming model, we propose to develop and implement scalable distributed algorithms to solve large-scale overlay processing in this dissertation. © 2013 ieee.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Cost Minimization for Scheduling parallel, Single-threaded, Heterogeneous, Speed-scalable Processors

Cost Minimization for Scheduling Parallel, Single-threaded, ...

引用

19th ieee International Conference on parallel and distributed Systems (ICPADS)

作者： Khogali, Rashid Das, Olivia Ryerson Univ Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781479920815

We introduce an online scheduling algorithm to optimally assign a set of arriving heterogeneous tasks to heterogeneous speed-scalable processors. The goal of our algorithm is to minimize the total cost of response time and energy consumption (TCRTEC) of the tasks. We have three contributions that constitute the algorithm. First, we propose a novel task dispatching strategy for assigning the tasks to the processors. Second, we propose a novel preemptive service discipline called Smallest remaining Computation Volume Per unit Price of response Time (SCVPPT) to schedule the tasks on the assigned processor. third, we propose a dynamic speed-scaling function that explicitly determines the optimum processing rate of each task. In our work, the processors are heterogeneous in that they may differ in their hardware specifications with respect to maximum processing rate and power functions. Tasks are heterogeneous in terms of computation volume and processing requirements. We also consider that the unit price of response time for each task is heterogeneous. Each task's unit price of response time is allowed to differ because the user may be willing to pay higher/lower unit prices for certain tasks;thereby increasing/decreasing their optimum processing rates. In our SCVPPT discipline, a task's scheduling priority is influenced by its remaining computation volume as well as its unit price of response time. Our simulation results show that SCVPPT outperforms the two known service disciplines, Shortest Remaining processing Time (SRPT) and the First Come First Serve (FCFS), in terms of minimizing the TCRTEC performance metric. The results also show that the algorithm's dispatcher outperforms the well known Round Robin dispatcher when the processors are heterogeneous. We focus on multi-buffer, single-threading where a set of tasks is allocated to a given processor, but only one task is processed at a time until completion unless preemption is dictated by the service discipline.

关键词： speed scaling parallel computing single-threaded heterogeneous processors multi-processor scheduling energy and response time cost mobile

来源：评论

学校读者我要写书评

暂无评论

Design optimization of energy-And security-critical distributed real-time embedded systems

Design optimization of energy-And security-critical distribu...

引用

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

作者： Zhang, Xia Zhan, Jinyu Jiang, Wei Ma, Yue Jiang, Ke School of Information and Software Engineering University of Electronic Science and Technology China Department of Computer and Information Science Linkoping University Sweden

ISBN: (纸本)9780769549798

In this paper, we approach the design of energy-And security-critical distributed real-time embedded systems from the early mapping and scheduling phases. Modern distributed Embedded Systems (DESs) are common to be connected to external networks, which is beneficial for various purposes, but also opens up the gate for potential security attacks. However, security protections in DESs result in significant time and energy overhead. In this work, we focus on the problem of providing the best confidentiality protection of internal communication in DESs under time and energy constraints. The complexity of finding the optimal solution grows exponentially as problem size grows. Therefore, we propose an efficient genetic algorithm based heuristic for solving the problem. Extensive experiments demonstrate the efficiency of the proposed technique. © 2013 ieee.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

parallel file download in peer-to-peer networks with random service capacities

Parallel file download in peer-to-peer networks with random ...

引用

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

作者： Li, Keqin Department of Computer Science State University of New York New Paltz NY 12561 United States

ISBN: (纸本)9780769549798

It is well known that the method of parallel downloading can be used to reduce file download times in a peer-to-peer (P2P) network. There has been little investigation on parallel download and chunk allocation for source peers with random service capacities. The main contribution of this paper is to address the problem of efficient parallel file download in P2P networks with random service capacities. A precise analysis of the expected download time is given when the service capacity of a source peer is a random variable. A general framework is developed for analyzing the expected download time of a parallel download and chunk allocation algorithm, and is applied to the analysis of several algorithms. Two chunk allocation algorithms for parallel download are proposed. It is observed that the performance of parallel download can be significantly improved by using the method of probing high-capacity peers. One such algorithm is proposed and its expected parallel download time is analyzed. The performance of these parallel file download algorithms in P2P networks with random service capacities are compared. © 2013 ieee.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Patterns and exemplars: Compelling strategies for teaching parallel and distributed computing to CS undergraduates

Patterns and exemplars: Compelling strategies for teaching p...

引用

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

作者： Adams, Joel Brown, Richard Shoop, Elizabeth Calvin College United States St. Olaf College United States Macalester College United States

ISBN: (纸本)9780769549798

parallel programming patterns provide enduring principles that serve as a conceptual framework to orient students when they set out to solve problems. Learning patterns enables students to quickly gain the intellectual and coding skills they will need to embrace the future of parallel and distributed computing (PDC). Exemplars consisting of representative and compelling applied problems, together with implementations in different parallel technologies, constitute a valuable resource for learning and teaching. parallel programming patterns and exemplar applications naturally complement each other, and together provide a unified and practical strategy for PDC education at multiple course levels. We present two strategies we have used for incorporating patterns into undergraduate CS courses, examine the potential of exemplars, and indicate how patterns and exemplars reinforce each other. © 2013 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Sequential and parallel restart policies for constraint-based local search

Sequential and parallel restart policies for constraint-base...

引用

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

作者： Caniou, Yves Codognet, Philippe JFLI CNRS University of Tokyo Tokyo Japan

ISBN: (纸本)9780769549798

We study in this paper the influence of the restart policy on the sequential and parallel performance of combinatorial search problems. Our evaluation relies on several experiments using a constraint-based local search method, named Adaptive Search, and a few combinatorial problems such as Magic Square and Costas Array Problems. © 2013 ieee.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

Teaching parallel and distributed computing to undergraduate computer science students

Teaching parallel and distributed computing to undergraduate...

引用

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

作者： Arroyo, Marcelo Departamento de Computación Universidad Nacional de Río Cuarto Río-Cuarto Argentina

ISBN: (纸本)9780769549798

parallel and distributed systems programming skills has become a common requirement in the development of modern applications. It is imperative that any updated curriculum in computer science must include these topics not only as advanced (often elective) programming courses. There is a general consensus that parallel programming topics should be spread throughout the undergraduate *** this paper we describe how parallel and distributed computing and, specifically concurrent and parallel programming topics, are being included in the updated computer science curriculum of the degree in computer science at the Río Cuarto National University, Argentina. Also, we cover some suggested approaches for teaching parallel programming topics in a set of core courses to achieve a consistent, increasing and complete training in high performance computing. To achieve these goals, we propose a set of modules which includes basic and advanced high performance computing and some parallel and distributed systems programming topics, to be included in core courses. Finally, we describe the use of existing tools and the development of new high level tools, as parallel patterns, useful for teaching parallel programming which can be used in different courses. The aim of using these tools and techniques is to reduce the gap between sequential and parallel programming. © 2013 ieee.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

distributed loop scheduling schemes for cloud systems

Distributed loop scheduling schemes for cloud systems

引用

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

作者： Han, Yiming Chronopoulos, Anthony T. Department of Computer Science University of Texas at San Antonio San Antonio TX United States

ISBN: (纸本)9780769549798

Cloud computing infrastructure offers the computing resources as a homogeneous collection of virtual machine instances by different hardware on figurations, which is transparent to end users. In fact, the computational powers of these virtual machine instances are different and behaves as a heterogeneous environment. Thus, scheduling and load balancing for high performance computations become challenging on such systems. In this paper, we propose a hierarchical distributed scheduling scheme suitable for parallel loops with independent iterations on a cloud computing system. We also evaluate various performance aspects associated with our distributed scheduling scheme. © 2013 ieee.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Variability-Aware and Fault-tolerant Self-Adaptive applications for Many-Core chips

Variability-Aware and Fault-tolerant Self-Adaptive applicati...

引用

ieee 19th International On-Line Testing symposium (IOLTS)

作者： Bizot, Gilles Chaix, Fabien Zergainoh, Nacer-Eddine Nicolaidis, Michael INP UJF CNRS TIMA LabARIS Grp Grenoble France

ISBN: (纸本)9781479906642

The coining era of chips consisting of billions of gates foreshadows processors containing thousands of unreliable cores. In this context, high energy efficiency will be available, under the constraint that applications leverage the large amount. of computing cores, while masking frequent faults of the chip. In this paper, an high-level method is proposed to map and manage a parallel application on an unreliable many-cores processor System on Chip. The approach takes into account versatile constraints relative to these processors (e.g. variability, core-level DVFS) and a generic algorithm is proposed. The distributed mapping process is based on the dynamic search of the best-suited processing node, upon task creation or node defect. An adaptive stop criteria is defined in order to balance the mapping impact and application efficiency gains. The validity of the proposition is assessed with high-level simulations, under different variability and application conditions.

关键词： Self-Adaptive Self-Mapping distributed applications Multiprocessor Systems Many-cores Processor System on Chip Variability-Aware Energy-aware systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共355页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：