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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

42 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

28 篇 工学
- 27 篇 计算机科学与技术...
- 7 篇 软件工程
- 2 篇 网络空间安全
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 电气工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
17 篇 管理学
- 17 篇 管理科学与工程(可...
3 篇 理学
- 2 篇 数学
- 1 篇 物理学
- 1 篇 化学

主题

5 篇 grid computing
5 篇 quality of servi...
3 篇 wimax
3 篇 servers
3 篇 mapreduce
3 篇 makespan
3 篇 cloud computing
2 篇 collaborative fi...
2 篇 component
2 篇 recommender syst...
2 篇 distributed comp...
2 篇 encryption
2 篇 scheduling
2 篇 sufferage
1 篇 multi-objective ...
1 篇 fuzzy logic
1 篇 massive image
1 篇 reliability
1 篇 parallel process...
1 篇 differential evo...

机构

2 篇 indian inst tech...
2 篇 natl inst techno...
2 篇 college of compu...
2 篇 department of co...
1 篇 beijing key labo...
1 篇 sikkim manipal i...
1 篇 paderborn center...
1 篇 sikkim manipal i...
1 篇 department of ec...
1 篇 iitm dept comp s...
1 篇 siemens corporat...
1 篇 amirkabir univ t...
1 篇 chinese acad sci...
1 篇 johannes gutenbe...
1 篇 state key labora...
1 篇 center for infor...
1 篇 department of ch...
1 篇 mody institute o...
1 篇 department of cs...
1 篇 indian institute...

作者

2 篇 chakraborty sand...
2 篇 renfa li
2 篇 panda sanjaya ku...
2 篇 sanjaya kumar pa...
2 篇 xiaohan tu
2 篇 khilar pabitra m...
2 篇 pabitra mohan kh...
2 篇 karmakar sushant...
2 篇 siping liu
1 篇 mazloomzadeh a.
1 篇 ankit khare
1 篇 roy diptendu sin...
1 篇 salimi reza
1 篇 hemant kumar red...
1 篇 goudar r. h.
1 篇 sens pierre
1 篇 rodrigues m.
1 篇 yang bo
1 篇 baghaee h.r.
1 篇 p deepa shenoy

语言

43 篇 英文

检索条件"任意字段=2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing, PDGC 2012"

共 43 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings of 2012 2nd ieee international conference on parallel, distributed and grid computing, pdgc 2012

Proceedings of 2012 2nd IEEE International Conference on Par...

引用

2012 2nd ieee international conference on parallel, distributed and grid computing, pdgc 2012

ISBN: (纸本)9781467329255

The proceedings contain 168 papers. The topics discussed include: a new DAG scheduling algorithm for heterogeneous platforms;implementation of parallel algorithms on cluster of workstations;distributed arithmetic multiplier based artificial neural network architecture for image compression;TiledRenderer - an object oriented framework for MPI based parallel rendering;PAPR reduction using cooperative PTS for space frequency block code MIMO-OFDM signal;an efficient ORR protocol for wireless mesh networks;breast cancer detection using backpropagation neural network with comparison between different neuron;evolutionary algorithm - based solutions to maximum lifetime coverage problem in wireless sensor networks;a novel framework and policies for on-line block of cores allotment for multiple DAGs on NoC;level based task duplication strategy to minimize the job turnaround time;and BER analysis of quasi and rotated quasi STBC MIMO systems under effects of Doppler shifts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

QoS-aware Replica Placement for Data grid Considering Economic Benefit

QoS-aware Replica Placement for Data Grid Considering Econom...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Xu, Heyang Yang, Bo Hu, Yanmei Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 610054 Peoples R China

ISBN: (纸本)9781467329255;9781467329224

Replica placement is an important technology in data grid to increase data availability and reduce access cost. Existing methods to resolve QoS-aware replica placement problem are only based on obtaining the minimal system cost. This paper further investigates the influence of economic benefit to QoS-aware replica placement problem and proposes a multi-objective optimization model. Also, an optimization algorithm based on genetic algorithm is presented. At last, a numerical experiment is given, and the result indicates that multi-objective optimization model presented in this paper can find better solution than the signal-objective optimization model.

关键词： replica placement QoS economic benefit multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

Task scheduling through limited duplication with processor utilization in grid computing system

Task scheduling through limited duplication with processor u...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Agarwal, Neha Gupta, Chhavi Khare, Ankit Jaypee Univ Informat Technol Dept CSE & ICT Solan 173234 Himachal Prades India

ISBN: (纸本)9781467329255;9781467329224

In dependent task scheduling algorithms, task duplication is the finest scheduling technique for minimizing the response time of workflow application in grid computing system. When we apply task duplication scheduling algorithm on workflow application, we get shorter schedules (makespan) but it has one limitation that grid node can be overloaded due to duplications of tasks. In this paper we are proposing an algorithm in which we are focusing on three points (1) reducing makespan (2) reducing tasks duplication, and (3) achieving better processor utilization. For this we have suggested an algorithm (TLD-P) which is achieving good results for considered parameters as compared to the existing HLD and EDS-G algorithm.

关键词： grid computing Duplication task scheduling Processor utilization DAG Workflow applications

来源：评论

学校读者我要写书评

暂无评论

Competent Routing protocol in Wireless Sensor Networks

Competent Routing protocol in Wireless Sensor Networks

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Bhadoria, Robin Singh Chandra, Deka Ganesh IITM Dept Comp Sci & Engg Gwalior MP India DGE & T MoLE New Delhi India

ISBN: (纸本)9781467329255;9781467329224

Wireless Sensor Networks (WSN) consist of spatially distributed sensor to monitor physical or environmental conditions and cooperatively pass their data to a central location. Such networks become importance due to its potential to transform many segments of our life from ecological monitoring and maintenance to computerization in traffic surveillance and health-care commerce. The design, implementation and operation of a sensor network requires the assemblage of various disciplines including embedded systems, hardware, networking, information management and distributed algorithms. Most applications of WSNs require deployment in unattended remote locations. Therefore, power awareness is fundamental to data dissemination and routing in a WSN. In this paper, we focus on consumption of power by each node.

关键词： WSN SPIN LEACH grid Based Routing Protocol

来源：评论

学校读者我要写书评

暂无评论

Deterministic 1-2 Skip List in distributed System

Deterministic 1-2 Skip List in Distributed System

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Mandal, Subhrangsu Chakraborty, Sandip Karmakar, Sushanta Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati Assam India

ISBN: (纸本)9781467329255;9781467329224

Searching data efficiently in distributed applications like peer-to-peer system is a challenging task due to the random distribution of data among several participating nodes. Efficient data structures are designed and implemented to reduce the complexity of data searching in such an environment. In this paper a data structure called deterministic 1-2. skip list has been proposed as a solution for search problems In distributed environment. The data structure has three main operations viz. search, insert, and delete. The detailed description of the insertion, deletion and search operations are given in this paper. It is found that the message complexity of the insertion, deletion and search algorithm is O(logn) where n is the total number of nodes in the skip-list.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Task Scheduling with Load Balancing for Computational grid Using NSGA II with Fuzzy Mutation

Task Scheduling with Load Balancing for Computational Grid U...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Salimi, Reza Motameni, Homayun Omranpour, Hesam Tabari Inst Higher Educ Coll Comp Sci Babol Sar Iran Islamic Azad Univ Dept Comp Engn Sari Branch Sari Iran Amirkabir Univ Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781467329255;9781467329224

The resources management in a grid computing is a complicated problem. Scheduling algorithms play important role in the parallel distributed computing systems for scheduling jobs, and dispatching them to appropriate resources. An efficient task scheduling algorithm is needed to reduce the total Time and Cost for job execution and improve the Load balancing between resources in the grid. In grid computing, load balancing is a technique to distribute workload fairly across computational resources, in order to obtain optimal resource utilization with minimum response time, and avoid overload. Load balancing is a crucial problem to grid computing. In this paper, we address scheduling problem of independent tasks in the market-based grid. In market grids, resource providers can request payment from users based on the amount of computational resource that used by them. Beside we consider Makespan and Load balancing. In this paper, NSGA II with Fuzzy Adaptive Mutation Operator is used to address independent task assignments problems in parallel distributed computing systems. Results obtained proved that our innovative algorithm converges to Pareto-optimal solutions faster and with more quality.

关键词： Task scheduling grid computing Non-dominated Sorting Genetic Algorithm (II) Adaptive Mutation Operator fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Load Balanced Static grid Scheduling Using Max-Min Heuristic

Load Balanced Static Grid Scheduling Using Max-Min Heuristic

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Ghosh, Tarun Kumar Goswami, Rajmohan Bera, Sumit Barman, Subhabrata Haldia Inst Technol Haldia W Bengal India Pailan Coll Management & Technol Comp Applicat W Bengal India

ISBN: (纸本)9781467329255;9781467329224

grid computing, inspired by electrical power grid, is an emerging trend for making easy access to computing resources. Its main objective is to solve computationally hard problems which otherwise cannot be solved by single CPU. This extremely high computing power is achieved by optimal utilization of geographically distributed heterogeneous resources which are lying idle. Load balanced task scheduling is very important problem in complex grid environment. So task scheduling which is one of the NP-Complete problems becomes a focus of research scholars in grid computing area. The traditional Min-Min and Max-Min algorithms are simple algorithms that produces a schedule that minimizes the makespan than the other traditional algorithms in the literature. In real scenario of Min-Min and Max-Min failed to produce a load balanced schedule. The proposed method has two-phases. In the first phase the traditional Max-Min algorithm is executed and in the second phase the tasks are rescheduled to use the unutilized resources effectively.

关键词： grid computing grid Scheduling Makespan Max-Min Heuristic gridSim

来源：评论

学校读者我要写书评

暂无评论

A Two-Step QoS Priority for Scheduling in grid

A Two-Step QoS Priority for Scheduling in Grid

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Panda, Sanjaya Kumar Khilar, Pabitra Mohan Natl Inst Technol Dept Comp Sci & Engn Rourkela India

ISBN: (纸本)9781467329255;9781467329224

Quality of Service (QoS) is an important property of Scheduling. Demand of QoS is varying from application to application. In the case of scheduling, it is nothing but task and processor requirements. Task requirement refers to bandwidth, speed, operating system, architecture and many more of the processor. But, processor requirement refers to data size, location, deadline, trust level and many more of the task. Our goal is to match and schedule the task-processor pair which leads to reduction in Makespan. In this paper, we propose a two-step QoS priority for scheduling in grid. Bounded and unbounded priorities are introduced as a two-step priority. Based on the priority, tasks are schedule to the processor. Our experiment case shows optimum result than previous scheduling algorithms like Min-Min, QoS guided Min-Min algorithm.

关键词： Quality of Service scheduling makespan priority sufferage

来源：评论

学校读者我要写书评

暂无评论

Resource Pricing Strategy in Wireless grid Using Non-cooperative Bargaining Game

Resource Pricing Strategy in Wireless Grid Using Non-coopera...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： Birje, Mahantesh N. Manvi, Sunilkumar S. Das, Sajal K. Basaveshwar Engn Coll Dept ISE Bagalkot 587102 India REVA ITM Dept ECE Bangalore 560064 Karnataka India Univ Texas Arlington TX 76019 USA

ISBN: (纸本)9781467329255;9781467329224

The consumers in a wireless grid will prefer reliable and cost optimal resources for job execution, while the grid service providers prefer efficient utilization of their resources. Hence brokering of resources that meet the requirements of consumers and providers is a challenging task in presence of unstable (wireless) network connections, market dynamics and rational users. This paper models a resource pricing strategy using a non-cooperative bargaining game for resource allocation considering dynamics in the grid market. The proposed scheme is simulated to evaluate the performance parameters like offered price, surplus, negotiation time and job completion time. We observed that our scheme performs better than existing scheme in terms of negotiation time and job completion time.

关键词： Wireless grid resource allocation game theory non-cooperative bargaining game

来源：评论

学校读者我要写书评

暂无评论

Hierarchical composition of coordinated checkpoint with pessimistic message logging

Hierarchical composition of coordinated checkpoint with pess...

引用

2nd ieee international conference on parallel, distributed and grid computing (pdgc)

作者： ndiaye, ndeye Massata Sens, Pierre Thiare, Ousmane Gaston Berger Univ Dept Comp Sci BP 234 St Louis Senegal

ISBN: (纸本)9781467329255;9781467329224

grid computing mutualizes more computing resources working in a calculation or a common task. The increase in the number of components in the system leads also increases the number of fault. These failures result in a loss of several cycles of running applications. It is therefore essential to be able to tolerate faults so that the computation can continue to execute and finish despite failures, all while maintaining maximum performance. One advantage of coordinated checkpoint is its capacity to have a very low overhead as long as the execution stays fault free. On the contrary, due to the fact that uncoordinated checkpoint requires being complemented by a message log protocol, this adds a significant penalty for all message transfers, even in case of fault-free execution. With message log, these problems do not arise simply because it processes checkpoint and restart autonomously. These differences suggest that the best approach depend on the fault frequency. In this paper, we propose a hierarchical composition of algorithms: Chandy-Lamport protocol and pessimistic message logging protocol. We have implemented and compared the performance of these protocols in grid computing using the Omnet++ simulator [3].

关键词： grid computing coordinated checkpointing chandy-lamport pessimistic message logging

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：