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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

900 篇 会议
22 册 图书
22 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

356 篇 工学
- 335 篇 计算机科学与技术...
- 255 篇 软件工程
- 50 篇 信息与通信工程
- 34 篇 电气工程
- 32 篇 控制科学与工程
- 23 篇 电子科学与技术（可...
- 14 篇 网络空间安全
- 10 篇 动力工程及工程热...
- 7 篇 机械工程
- 5 篇 交通运输工程
- 5 篇 生物工程
- 5 篇 安全科学与工程
- 4 篇 力学（可授工学、理...
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 环境科学与工程（可...
- 4 篇 生物医学工程（可授...
- 3 篇 建筑学
93 篇 理学
- 65 篇 数学
- 19 篇 系统科学
- 8 篇 统计学（可授理学、...
- 7 篇 物理学
- 7 篇 生物学
- 4 篇 化学
87 篇 管理学
- 71 篇 管理科学与工程(可...
- 31 篇 工商管理
- 17 篇 图书情报与档案管...
5 篇 法学
- 5 篇 社会学
4 篇 教育学
- 4 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 医学

主题

267 篇 application soft...
123 篇 computer science
114 篇 hardware
102 篇 concurrent compu...
99 篇 distributed comp...
84 篇 computer archite...
77 篇 parallel process...
59 篇 computer network...
58 篇 computational mo...
56 篇 processor schedu...
54 篇 delay
53 篇 software enginee...
51 篇 resource managem...
51 篇 large-scale syst...
50 篇 costs
48 篇 runtime
48 篇 real time system...
42 篇 software systems
41 篇 operating system...
40 篇 parallel program...

机构

8 篇 ibm thomas j. wa...
5 篇 school of electr...
5 篇 school of comput...
5 篇 department of co...
5 篇 department of co...
4 篇 software school ...
4 篇 department of co...
4 篇 department of el...
4 篇 institute of com...
4 篇 department of co...
3 篇 department of en...
3 篇 department of el...
3 篇 cncert/cc
3 篇 research centre ...
3 篇 department of el...
3 篇 school of electr...
3 篇 department of el...
3 篇 department of el...
3 篇 school of softwa...
3 篇 institute for pa...

作者

7 篇 l.r. welch
6 篇 m. parashar
6 篇 gao guang r.
5 篇 h. casanova
5 篇 jack dongarra
5 篇 zimeo eugenio
5 篇 hong jiang
5 篇 s. hariri
5 篇 wei-keng liao
4 篇 j.-l. gaudiot
4 篇 suzhen wu
4 篇 b. pfarr
4 篇 m. kandemir
4 篇 g.r. gao
4 篇 alok choudhary
4 篇 l. welch
4 篇 p. sobe
4 篇 bo mao
4 篇 wentong cai
4 篇 minyi guo

语言

935 篇 英文
8 篇 其他
1 篇 中文

检索条件"任意字段=PDSE 2000: International Symposium on Software Engineering for Parallel and Distributed Systems"

共 944 条记录，以下是511-520 订阅

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

详细简洁

排序：

Reducing power with performance constraints for parallel sparse applications

Reducing power with performance constraints for parallel spa...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： G. Chen K. Malkowski M. Kandemir P. Raghavan Department of Computer Science and Engineering Pennsylvania State University University Park PA USA

Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational workload in such computations across parallel processors, achieving sustained near machine-peak performance with close-to-ideal load balanced computation-to-processor mapping is inherently difficult. As a result, most of the time, the loads assigned to parallel processors can exhibit significant variations. While there have been numerous past efforts that study this imbalance from the performance viewpoint, to our knowledge, no prior study has considered exploiting the imbalance for reducing power consumption during execution. Power consumption in large-scale clusters of workstations is becoming a critical issue as noted by several recent research papers from both industry and academia. Focusing on sparse matrix computations in which underlying parallel computations and data dependencies can be represented by trees, this paper proposes schemes that save power through voltage/frequency scaling. Our goal is to reduce overall energy consumption by scaling the voltages/frequencies of those processors that are not in the critical path; i.e., our approach is oriented towards saving power without incurring performance penalties.

关键词： Concurrent computing Energy consumption Application software Computational modeling Sparse matrices Large-scale systems Voltage Power engineering and energy Workstations Frequency

来源：评论

学校读者我要写书评

暂无评论

BondFlow: a system for distributed coordination of workflows over Web services

BondFlow: a system for distributed coordination of workflows...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Janaka Balasooriya Mohini Padhye S.K. Prasad S.B. Navathe Georgia State University Atlanta USA Georgia Institute of Technology Atlanta USA

Today's collaborative applications over the Web span domains as diverse as enterprise e-commerce applications and biomedical applications. We have previously developed and formally investigated "Web Coordination Bonds," a theoretically powerful artifact for interconnecting autonomous Web objects for control and data flows, and for enforcing dependencies. Here, we describe BondFlow, a system that enables the configuration and execution of workflows using Web bonds over heterogeneous Web objects. The system automatically generates lightweight proxy wrapper objects to enable encapsulated Web services to be interconnected through Web bonds. The small footprint wrappers (less than 10 KB) can reside on Java-enabled handheld devices. We describe the design, architecture and performance of the BondFlow system. Our initial performance results indicate that both wrapper creation time and Web bond related execution time are small. In contrast to our BondFlow system, existing systems need expert programming to create workflows, do not easily allow distributed coordination of workflows, and usually do not support heterogeneity of device, data and network. The system is preliminary, and further research is ongoing to extend its configuration and execution platforms.

关键词： Bonding Web services Collaborative work Scalability Power system interconnection Automatic control Java Handheld computers software engineering Application software

来源：评论

学校读者我要写书评

暂无评论

A cost-effective main memory organization for future servers

A cost-effective main memory organization for future servers

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M. Ekman P. Stenstrom Department of Computer Science and Engineering Chalmers University of Technology Goteborg Sweden

Today, the amount of main memory in mid-range servers is pushing practical limits with as much as 192 GB memory in a 24 processor system. Further, with the onset of multi-threaded, multi-core processor chips, it is likely that the number of memory chips per processor chip will start to increase, making DRAM cost and size an even larger burden. We investigate in this paper an alternative main memory organization - a two-level non-inclusive memory hierarchy - where the second level is substantially slower than the first level, with the aim of reducing total system cost and spatial requirements of servers of today and the future. We quantitatively investigate how big and how slow the second level can be. Surprisingly, we find that only 30% of the entire memory resources typically needed must be accessed at DRAM speed whereas the rest can be accessed at a speed that is an order of magnitude slower with a negligible (1.2% on average) performance impact. We also present a cost-effective implementation of how to manage such a hierarchy and how it can bring down memory cost by leveraging memory compression and sharing of memory resources among servers.

关键词： Computer science Delay Memory management Fault detection distributed processing Technology management engineering management Associative memory Operating systems software algorithms

来源：评论

学校读者我要写书评

暂无评论

A high performance distributed-parallel-processor architecture for 3D IIR digital filters

A high performance distributed-parallel-processor architectu...

引用

IEEE international symposium on Circuits and systems (ISCAS)

作者： A.U. Madanayake L. Bruton Department of Electrical and Computer Engineering University of Calgary Calgary AB Canada

Real-time spatio-temporal VLSI 3D IIR digital filters may be used for imaging or beamforming applications employing 3D input signals from synchronously-sampled multi-sensor arrays. Such filters have high computational complexity and often require arithmetic throughputs of hundreds of millions of floating point operations per second, especially in the case of potential radio frequency beamforming applications. A novel high-throughput distributed parallel processor (DPP) architecture is proposed that is suitable for on-chip real-time VLSI/FPGA direct-form 3D IIR digital filter implementations. Using the proposed architecture and Matlab/Simulink and Xilinx simulation software, the design and bit-level simulation of a first-order highly-selective FPGA-based 3D IIR frequency-planar filter circuit is reported for 3D plane-wave filtering.

关键词： Digital filters Computer architecture IIR filters Very large scale integration Array signal processing Circuit simulation Computational complexity Floating-point arithmetic Throughput Radio frequency

来源：评论

学校读者我要写书评

暂无评论

Robust resource allocations in parallel computing systems: model and heuristics

Robust resource allocations in parallel computing systems: m...

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： V. Shestak H.J. Siegel A.A. Maciejewski S. Ali Department of Electrical & Computer Engineering Colorado State University Fort Collins CO USA Department of Electrical and Computer Engineering University of Missouri Rolla Rolla MO USA

The resources in parallel computer systems (including heterogeneous clusters) should be allocated to the computational applications in a way that maximizes some system performance measure. However, allocation decisions and associated performance prediction are often based on estimated values of application and system parameters. The actual values of these parameters may differ from the estimates; for example, the estimates may represent only average values, the models used to generate the estimates may have limited accuracy, and there may be changes in the environment. Thus, an important research problem is the development of resource management strategies that can guarantee a particular system performance given such uncertainties. To address this problem, we have designed a model for deriving the degree of robustness of a resource allocation-the maximum amount of collective uncertainty in system parameters within which a user-specified level of system performance (QoS) can be guaranteed. The model is presented and we demonstrate its ability to select the most robust resource allocation from among those that otherwise perform similarly (based oh the primary performance criterion). The model's use in allocation heuristics is also demonstrated. This model is applicable to different types of computing and communication environments, including parallel, distributed, cluster; grid, Internet, embedded, and wireless.

关键词： Robustness Resource management parallel processing Concurrent computing System performance Application software Uncertainty Computer applications distributed computing Embedded computing

来源：评论

学校读者我要写书评

暂无评论

The WK-recursive pyramid: an efficient network topology

The WK-recursive pyramid: an efficient network topology

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： M.H. Farahabady H. Sarbazi-Azad IPM School of Computer Science Tehran Iran Department of Computer Engineering Sharif University of Technology Tehran Iran

In this paper, we present and evaluate a new topology for interconnection networks which we refer to as WK-pyramid. This network has a recursive definition quite similar to that of conventional pyramid networks, but is based on the WK-recursive mesh. The traditional pyramid, a desirable network topology, was employed as both software data structure and hardware architecture. However, the new network topology which we propose has, in addition to almost all the properties of the pyramid, a number of superior properties, such as expandability to any base size. We show that this hierarchical topology is of interesting topological characteristics, making it suitable for utilization as the base topology of large-scale multicomputer systems.

关键词： Network topology Multiprocessor interconnection networks Hardware Computer architecture Costs Computer science Data structures Large-scale systems distributed computing Tree graphs

来源：评论

学校读者我要写书评

暂无评论

Production scheduling by reachability analysis - a case study

Production scheduling by reachability analysis - a case stud...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： G. Behrmann E. Brinksma M. Hendriks A. Mader University of Aalborg Aalborg Denmark University of Twente Enschede Netherlands Radboud University Nijmegen Netherlands

Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness of timed automata allows - unlike many classical approaches - the modelling of scheduling problems of very different kinds. Furthermore, the models are robust against changes in the parameter setting and against changes in the problem specification. This paper presents a case study that was provided by Axxom, an industrial partner of the AMETIST project. It consists of a scheduling problem for lacquer production, and is treated with the timed automata approach. A number of problems have to be addressed for the modelling task: the information transfer from the industrial partner, the derivation of timed automaton model for the case study, and the heuristics that have to be added in order to reduce the search space. We try to isolate the generic problems of modelling for model checking, and suggest solutions that are also applicable for other scheduling cases. Model checking experiments and solutions are discussed.

关键词： Production Reachability analysis Computer aided software engineering Automata Job shop scheduling Control system synthesis Real time systems Robustness Automatic control Clocks

来源：评论

学校读者我要写书评

暂无评论

A case study of instant workbench for InterProScan by Knoppix high throughput computing edition 05

A case study of instant workbench for InterProScan by Knoppi...

引用

international symposium on High Performance distributed Computing

作者： F. Konishi S. Ohki Y. Hamano M. Ishii RlKEN GSC Advanced Genome Information Technology Research Group VSN Inc Tokyo Metropolitan Institute of Technology

ISBN: (纸本)9780780390379

We have developed an instant environment for protein sequence profile scanning application by re-mastering Knoppix distribution as high throughput computing edition. This is an integrated environment with bioinformatics applications, parallel file system and scheduler. The integrated environment allows biology researchers to perform scanning applications immediately on their computational pool without any system configuration changed.

关键词： Computer aided software engineering Throughput Bioinformatics File systems Biology computing Proteins Genomics Sequences Databases Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Collective caching: application-aware client-side file caching 05

Collective caching: application-aware client-side file cachi...

引用

international symposium on High Performance distributed Computing

作者： Wei-keng Liao K. Coloma A. Choudhary L. Ward E. Russell S. Tideman Electrical and Computer Engineering Department Northwestern University USA Scalable Computing Systems Department Sandia National Laboratories

ISBN: (纸本)9780780390379

parallel file subsystems in today's high-performance computers adopt many I/O optimization strategies that were designed for distributed systems. These strategies, for instance client-side file caching, treat each I/O request process independently, due to the consideration that clients are unlikely related with each other in a distributed environment. However, it is inadequate to apply such strategies directly in the high-performance computers where most of the I/O requests come from the processes that work on the same parallel applications. We believe that client-side caching could perform more effectively if the caching subsystem is aware of the process scope of an application and regards all the application processes as a single client. In this paper, we propose the idea of "collective caching" which coordinates the application processes to manage cache data and achieve cache coherence without involving the I/O servers. To demonstrate this idea, we implemented a collective caching subsystem at user space as a library, which can be incorporated into any message passing interface implementation to increase its portability. The performance evaluation is presented with three I/O benchmarks on an IBM SP using its native parallel file system, GPFS. Our results show significant performance enhancement obtained by collective caching over the traditional approaches.

关键词： Concurrent computing Application software File servers File systems Laboratories Message passing parallel processing Data structures Libraries

来源：评论

学校读者我要写书评

暂无评论

A realistic network/application model for scheduling divisible loads on large-scale platforms

A realistic network/application model for scheduling divisib...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： L. Marchal Y. Yang H. Casanova Y. Robert Laboratoire LIP École Normale Supérieure de Lyon CNRS-INRIA France Department of Computer Science and Engineering University of California San Diego USA San Diego Supercomputer Center University of California San Diego USA

Divisible load applications consist of an amount of data and associated computation that can be divided arbitrarily into any number of independent pieces. This model is a good approximation of many real-world scientific applications, lends itself to a natural master-worker implementation, and has thus received a lot of attention. The issue of divisible load scheduling has been studied extensively. However, only a few authors have explored the simultaneous scheduling of multiple such applications on a distributed computing platform. We focus on this increasingly relevant scenario and make the following contributions. We use a novel and more realistic platform model that captures some of the fundamental network properties of grid platforms. We formulate the steady-state multi-application scheduling problem as a linear program that expresses a notion of fairness between applications. This scheduling problem is NP-complete and we propose several heuristics that we evaluate and compare via extensive simulation experiments. Our main finding is that some of our heuristics can achieve performance close to optimal and we quantify the trade-offs between achieved performance and heuristic complexity.

关键词： Large-scale systems Processor scheduling Grid computing Application software Computer networks Steady-state Bandwidth Computer science Data engineering Supercomputers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共95页 << < 48 49 50 51 52 53 54 55 56 57 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：