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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

197 篇 会议
6 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

154 篇 工学
- 150 篇 计算机科学与技术...
- 67 篇 软件工程
- 24 篇 电气工程
- 20 篇 信息与通信工程
- 13 篇 控制科学与工程
- 9 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 5 篇 电子科学与技术（可...
- 5 篇 交通运输工程
- 5 篇 安全科学与工程
- 4 篇 网络空间安全
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 生物医学工程（可授...
- 1 篇 冶金工程
- 1 篇 水利工程
- 1 篇 化学工程与技术
33 篇 理学
- 23 篇 数学
- 6 篇 化学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
30 篇 管理学
- 22 篇 管理科学与工程(可...
- 17 篇 工商管理
- 14 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学
- 1 篇 临床医学

主题

21 篇 cloud computing
9 篇 parallel process...
9 篇 distributed comp...
8 篇 peer to peer com...
8 篇 distributed comp...
7 篇 concurrent compu...
7 篇 grid computing
7 篇 computational mo...
7 篇 scheduling
6 篇 message passing
6 篇 computer archite...
6 篇 distributed syst...
5 篇 computer science
5 篇 mobile agents
5 篇 bandwidth
5 篇 genetic algorith...
5 篇 data models
4 篇 parallel algorit...
4 篇 application soft...
4 篇 fault tolerance

机构

2 篇 high-performance...
2 篇 parallel and dis...
2 篇 institut univers...
2 篇 ibm t.j. watson ...
2 篇 department of co...
2 篇 beihang univ sch...
2 篇 parallel and dis...
1 篇 faculty of infor...
1 篇 department of co...
1 篇 department of co...
1 篇 rechen- und komm...
1 篇 institut für inf...
1 篇 cicese ensenada ...
1 篇 faculty of infor...
1 篇 univ utah sci co...
1 篇 tech univ berlin...
1 篇 high-performance...
1 篇 simula research ...
1 篇 chongqing univ k...
1 篇 swiss fed inst t...

作者

3 篇 kuan-ching li
3 篇 chao-tung yang
3 篇 li xiaorong
2 篇 park woo-chan
2 篇 bouamama sadok
2 篇 dieter mey
2 篇 kim il-san
2 篇 han tack-don
2 篇 lee kil-whan
2 篇 yoon duk-ki
2 篇 domenico talia
2 篇 li kuan-ching
2 篇 akl selim g.
2 篇 plale beth
2 篇 chen peng
2 篇 yang chao-tung
1 篇 nandi asoke k.
1 篇 han biao
1 篇 ortiz aurélien
1 篇 hillhouse bob

语言

205 篇 英文

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

共 205 条记录，以下是81-90 订阅

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

详细简洁

排序：

A user-level extension scheme for a task-parallel script language

A user-level extension scheme for a task-parallel script lan...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Sakaguchi, Yusuke Ohno, Kazuhiko Sasaki, Takahiro Kondo, Toshio Nakashima, Hiroshi Department of Information Engineering Mie University 1577 Kurimamachiya-cho Tsu Mie 514-8507 Japan Academic Center for Computing and Media Studies Kyoto University Yoshida-Honmachi Sakyo-ku Kyoto 606-8501 Japan

ISBN: (纸本)9780889867048

We are developing a task parallel script language named MegaScript for mega-scale parallel processing. MegaScript regards sequential/parallel programs as tasks, and controls them for massively parallel execution. Although MegaScript programs require optimizations and extensions specific to the application and the computing environment, modifying the runtime system or task programs greatly reduces portability and reusability. To satisfy these conflicting requirements, we propose a user-level dynamic extension scheme named Adapter. In this scheme, the user defines a customization code and hooks to it a specific event. the runtime system calls back the code for the event locally, enabling it to extend or optimize system behavior without modifying the runtime or task programs. the results of our evaluation of the scheme show that the overhead and programming cost are both small enough for practical use.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerant parallel Data-Intensive Algorithms

Fault Tolerant Parallel Data-Intensive Algorithms

引用

19th international conference on High Performance computing (HiPC)

作者： Kutlu, Mucahid Agrawal, Gagan Kurt, Oguz Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Ohio State Univ Dept Math Columbus OH 43210 USA

ISBN: (纸本)9781467323703;9781467323727

Fault-tolerance is rapidly becoming a crucial issue in high-end and distributed computing, as increasing number of cores are decreasing the mean-time to failure of the systems. While checkpointing, including checkpointing of parallel programs like MPI applications, provides a general solution, the overhead of this approach is becoming increasingly unacceptable. thus, algorithm-based fault-tolerance provides a nice practical alternative, though it is less general. Although this approach has been studied for many applications, there is no existing work for algorithm-based fault-tolerance for the growing class of data-intensive parallel applications. In this paper, we present an algorithm-based fault tolerance solution that handles fail-stop failures for a class of data intensive algorithms. We divide the dataset into smaller data blocks and in replication step, we distribute the replicated blocks with the aim of keeping the maximum data intersection between any two processors minimum. this allows us to have minimum data loss when multiple failures occur. In addition, our approach enables better load balance after failure, and decreases the amount of re-processing of the lost data. We have evaluated our approach by using two popular parallel data mining algorithms, which are k-means and apriori. We show that our approach has negligible overhead when there are no failures, and allows us to gracefully handle different number of failures, and failures at different points of processing. We also provide the comparison of our approach with the MapReduce based solution for fault tolerance, and show that we outperform Hadoop both in absence and presence of failures.

关键词： checkpointing data mining message passing parallel processing software fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Adaptive speculative locking protocol for distributed real-time database systems

Adaptive speculative locking protocol for distributed real-t...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Haque, Waqar Stokes, Paul R. University of Northern British Columbia 3333 University Way Prince George BC V2N 4Z9 Canada

ISBN: (纸本)9780889867048

Speculative Locking protocol (SL) is a concurrency control protocol that allows for parallel execution of conflicting transactions through a method of multilevel lending and versioning. the SL protocol shows performance improvements over the standard two-phase locking (2PL) protocol, but relies on several assumptions that would make it unsuitable in real-world scenarios. In this paper, we have proposed an adaptive speculative locking (ASL) protocol that improves performance of real-time distributed database systems by augmenting the SL protocol with four features: distributed real-time database system support;simultaneous multi-threading or page execution;control of transaction execution through transaction queue management;and restricting system memory through the use of virtual memory. the simulation results demonstrate the superiority of the ASL protocol over the SL protocols through the reduction of data contention caused by finite memory and the overall increase in transaction throughput.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

A dependency based bandwidth aware dynamic job grouping grid scheduler with deadline based network-ToS

A dependency based bandwidth aware dynamic job grouping grid...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Singh, Vivek Sheel Misra, Manoj Department of Electronics and Computer Engineering Indian Institute of Technology Roorkee India

ISBN: (纸本)9780889867048

the past decade has witnessed a boost in the acceptance of Grid computing as an alternative to traditional supercomputing environments. the evolution of Computers, Networks and the Internet has boosted the growth of Grid computing. However applications with fine grained jobs tend to be unfavorable for this environment. Further applications that possess jobs that are dependent upon each other need to be grouped together and represented in a coarse-grained manner to lower the overheads involved with fine grained jobs, and rescheduling of dependent jobs. Also, there is a need to impose ordering on resource selection based on their processing capabilities and dynamic bandwidth scenarios. Users with different priorities must be provided differentiated Network ToS to ensure high Success Rates of job completion. In this paper, we investigate a dependency based, Network Aware, dynamic job grouping scheduler, which provides Network ToS to Users based on their deadlines.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Processor partitioning: An experimental performance analysis of parallel applications on SMP cluster systems

Processor partitioning: An experimental performance analysis...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Wu, Xingfu Taylor, Valerie Department of Computer Science Texas A and M University College Station TX 77843 United States

ISBN: (纸本)9780889867048

Currently, clusters of shared memory symmetric multiprocessors (SMPs) are one of the most common parallel computing systems, for which some existing environments have between 8 to 32 processors per node. Examples of such environments include some supercomputers: DataStar p655 (P655 and P655m) and P690 at the San Diego Supercomputing Center, and Seaborg and Bassi at the DOE National Energy Research Scientific computing Center. In this paper, we quantify the performance gap resulting from using different number of processors per node for application execution (for which we use the term processor partitioning), and conduct detailed performance experiments to identify the major application characteristics that affect processor partitioning. We use the STREAM memory benchmarks and Intel's MPI benchmarks to explore the performance impact of different application characteristics. the results are then utilized to explain the performance results of processor partitioning using three NAS parallel Application benchmarks. the experimental results indicate that processor partitioning can have a significant impact on performance of a parallel scientific application as determined by its communication and memory requirements.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

An automatic code generation tool for partitioned software in distributed systems

An automatic code generation tool for partitioned software i...

引用

19th international conference on VLSI Design held jointly with 5th international conference on Embedded systems Design

作者： Sairaman, Viswanath Ranganathan, Nagarajan Singh, Neeta S. Department of Computer Science and Engineering University of South Florida Tampa

ISBN: (纸本)0769525024

In distributed heterogeneous systems, the target application is partitioned and the partitions are executed in different computing units while satisfying the dependencies between the code partitions. Code generation is the process of converting the code partitions into individually executable code clusters and satisfying the code dependencies by adding communication primitives to send and receive data between dependent the code clusters. In this work, we describe a code generation tool that is applicable to procedural language based applications for distributed processing. the application programs along with the partition primitives are converted into independently executable concrete implementations. the process consists of two steps, first translating the primitives of the application program into equivalent code clusters, and then scheduling the implementations of these code clusters according to the inherent data dependencies. Further, the original source code needs to be reverse engineered in order to create a meta-data table describing the program elements and dependency trees. this data gathered, is used along with parallel Virtual Machine (PVM) primitives for enabling the communication between the partitioned programs in the distributed environment. the proposed code generation model has been implemented using C and tested for various application programs for functional verification. © 2006 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

the impact of error in user-provided bandwidth estimates on multi-site parallel job scheduling performance

The impact of error in user-provided bandwidth estimates on ...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Jones, William M. Electrical and Computer Engineering Department United States Naval Academy Mail Stop 14B 105 Maryland Avenue Annapolis MD 21402-5025 United States

ISBN: (纸本)9780889867048

Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully mapping jobs across potentially many clusters, jobs that would otherwise wait in the queue for local cluster resources can begin execution much earlier;thereby improving system utilization and reducing average queue waiting time. Recent research in this area leverages user-provided estimates of job communication characteristics to effectively partition the job across cluster boundaries. In this paper, we address the impact of inaccuracies in these estimates on overall system performance. Furthermore, we demonstrate that multi-site job scheduling techniques benefit from these estimates, even in the presence of considerable inaccuracy.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Measuring causal propagation of overhead of inefficiencies in parallel applications

Measuring causal propagation of overhead of inefficiencies i...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Jafri, Hassan M. National Center for Supercomputing Applications University of Illinois Urbana-Champaign United States

ISBN: (纸本)9780889867048

parallel applications are notorious for their intractability to performance debugging. Automatic performance analysis techniques, such as those used by Kojak and KappaPI, are promising in alleviating the difficulty of discovering performance inefficiencies in parallel applications. However, as we show in this paper, the results produced by these tool can be potentially misleading and sometimes, outright incorrect. the reason is that the overhead due to performance inefficiencies originating at a certain point in the program can causally propagate and manifest itself at other points. Current techniques perform a flat analysis, i.e., they do not account for causal propagation. In this paper, we present a method of causal analysis that current analysis techniques can be retrofitted with to account for causal propagation of overhead to arrive at a more accurate description of performance bottlenecks. We also show various advantages rendered by this technique to improving the effectiveness of automatic performance analysis. In this paper, we only tackle overhead related to communication operations in MPI parallel application. In general, however, our technique can be used for non-communication related overhead for any parallel programming paradigm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Online scheduling of malleable parallel jobs

Online scheduling of malleable parallel jobs

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Dutton, Richard A. Mao, Weizhen Department of Computer Science College of William and Mary P.O. Box 8795 Williamsburg VA 23187-8795 United States

ISBN: (纸本)9780889867048

In this paper, we study a parallel job scheduling model which takes into account both computation time and the overhead from communication between processors. Assuming that a job Jj has a processing requirement pj and is assigned to kj processors for parallel execution, then the execution time will be modeled by tj = p j / kj+ (kj - 1) c, where c is the constant overhead cost associated with each processor other than the master processor. In this model, (kj - 1)c represents the cost for communication and coordination among the processors. this model attempts to accurately portray the actual execution time for jobs running in parallel on multiple processors. Using this model, we will study the online algorithm Earliest Completion Time (ECT) and show a lower bound for the competitive ratio of ECT for m ≥ 2 processors. For m ≤ 4, we show the matching upper bound to complete the competitive analysis for m = 2,3,4. For large m, we conjecture that the ratio approaches 30/13 ≈ 2.30769.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：