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

Managing deadline-constrained bag-of-tasks jobs on hybrid clouds

KSII Transactions on Internet and Information Systems 2016年第4期48卷

作者： Wang, Bo Song, Ying Sun, Yuzhong Liu, Jun Department of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China SKL Computer Architecture ICT CAS Beijing100190 China SPKLSTN Lab Department of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China

Outsourcing jobs to a public cloud is a cost-effective way to address the problem of satisfying the peak resource demand when the local cloud has insufficient resources. In this paper, we study on managing deadline-constrained bag-of-tasks jobs on hybrid clouds. We present a binary nonlinear programming (BNP) problem to model the hybrid cloud management where the utilization of physical machines (PMs) in the local cloud/cluster is maximized when the local resources are enough to satisfy the deadline constraints of jobs, while when not, the rent cost from the public cloud is minimized. To solve the BNP problem in polynomial time, we propose the heuristic algorithm whose main idea is assigning a task to a core of a used PM (in local cloud) or a rented virtual machine (VM) (in public cloud) such that the difference between the finish time of the task and its deadline is minimal in all of assignments. If none of unassigned tasks can be completed within its deadline, the algorithm adds an available PM with most capacity or rents a new VM with highest cost-performance ratio and assigns tasks to the new PM/VM as previous step. Extensive experimental results show that our heuristic algorithm saves 16.2%-76% cost and improves 47.3%-182.8% resource utilizations for finishing jobs within their respective deadlines with comparable overheads, compared with first fit decreasing algorithm. © 2016 Society for Modeling & Simulation International (SCS)

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Codelet Scheduling by Genetic Algorithm

Codelet Scheduling by Genetic Algorithm

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Songwen Pei Jinkai Wang Wenyang Cui Linhua Jiang Tongsheng Geng Jean-Luc Gaudiot Stéphane Zuckerman Shanghai Key Lab of Modern Optical Systems University of Shanghai for Science and Technology Shanghai China Parallel Systems and Computer Architecture Lab University of California Irvine CA USA Computer Architecture & Parallel Systems Laboratory University of Delaware Newark DE

ISBN: (纸本)9781509032068

Codelet model is a fine-grained, event-driven hybrid parallel model inspired by dataflow, whose performance depends on the scheduling policy. How to design optimal codelet scheduling policy based on the features of tasks is important to the codelet-based system performance. In this paper, we propose an adaptive codelet scheduling policy by combing "pure" genetic algorithm for tasks with complex dependencies. It is verified that the policy is effective based on bunches of experimental results.

关键词： Computational modeling Schedules Genetic algorithms Scheduling Runtime Optimal scheduling Sociology

来源：评论

学校读者我要写书评

暂无评论

A technique for low power, stuck-at fault diagnosable and reconfigurable scan architecture

A technique for low power, stuck-at fault diagnosable and re...

引用

East-West Design & Test Symposium (EWDTS)

作者： Binod Kumar Boda Nehru Brajesh Pandey Virendra Singh Jaynarayan Tudu Computer Architecture and Dependable Systems Lab (CADSL) Indian Institute of Technology Bombay India Dept. of Computer Science and Automation Indian Institute of Science Bangalore

ISBN: (纸本)9781509006946

Power dissipation is a major issue with testing of designs having full scan architectures. The proposed scan technique minimizes toggle activity while scanning in test patterns. The method uses bit inversion technique to avoid toggles in scan flip-flops. The setup is dynamically configurable to one among the logic reversal structure and traditional scan while shift-in/shift-out of test patterns. Experimental results indicate that the average toggle activity is minimized substantially compared to California Scan architecture. It has features of full diagnosability of single stuck-at faults along the scan chain path.

关键词： computer architecture Silicon Circuit faults Testing Logic gates Inverters Clocks

来源：评论

学校读者我要写书评

暂无评论

Optimization of GEMV on Intel AVX processor

International Journal of Database Theory and Application

引用

International Journal of Database Theory and Application 2016年第2期9卷 47-60页

作者： Liang, Jun Zhang, Yunquan Training Center of Electronic Information Beijing Union University Beijing China State Key Lab of Computer Architecture Institute of Computing Technology CAS Beijing China

To improve the performance of BLAS 2 GEMV subroutine under the latest instruction set, Intel AVX, this paper presents a new approach to analyze the new generation instruction set and enhance the efficiency of current data-oriented math subroutines. The whole optimizing process involves memory access optimization, SIMD optimization and parallel optimization. Also, this paper shows the comparison between the traditional SSE instruction set and the AVX instruction set. Experiments show that the optimized GEMV function has obtained considerable increase on performance. Compared with the Intel MKL, GotoBLAS, ATLAS, this optimized GEMV exceeds these BLAS implementations from 5% to 10%.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Testing an evolutionary portfolio algorithm on the CEC2016 real-parameter single objective optimization

Testing an evolutionary portfolio algorithm on the CEC2016 r...

引用

Congress on Evolutionary Computation

作者： Junyan Yi He Zheng Gang Yang Department of Computer Science and Technology Beijing University of Civil Engineering and Architecture Beijing China Department of Information Renmin University of China Multimedia Computing Lab Beijing China

ISBN: (纸本)9781509006243

In order to take advantages of evolutionary algorithms inspired by different biological evolutions, varieties of approaches have been proposed to combine them together. One of them is the portfolio approach, which keeps choosing a component algorithm from a portfolio of evolutionary algorithms (EAs) to run during the optimizing process. In our approach, each component algorithm has its own population and runs independently without information exchange. At the beginning of each generation, only the component algorithm with the best predicted performance is allowed to run. The proposed portfolio approach is tested on the CEC2016 real-parameter single objective optimization benchmarks. The results show that it is competitive.

关键词： Prediction algorithms Convergence Portfolios Sociology Statistics Iron Optimization

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap

An Evolutionary Robotics Approach to the Control of Plant Gr...

引用

International Conference on Self-Adaptive and Self-Organizing Systems (SASO)

作者： Mostafa Wahby Daniel Nicolas Hofstadler Mary Katherine Heinrich Payam Zahadat Heiko Hamann Department of Computer Science University of Paderborn Germany Artijicial Life Lab of the Department of Zoology Karl-Franzens University Graz Austria Centre for IT and Architecture Royal Danish Academy Copenhagen Denmark Department of Computer Science Chemnitz University of Technology Germany

ISBN: (纸本)9781509035359

The self-organizing bio-hybrid collaboration ofrobots and natural plants allows for a variety of interestingapplications. As an example we investigate how robots can beused to control the growth and motion of a natural plant, using LEDs to provide stimuli. We follow an evolutionaryrobotics approach where task performance is determined bymonitoring the plant's reaction. First, we do initial plantexperiments with simple, predetermined controllers. Then weuse image sampling data as a model of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve robot controllers in simulation. The task is to makethe plant approach three predetermined, distinct points in anxy-plane. Finally, we test the evolved controllers in real plantexperiments and find that we cross the reality gap successfully. We shortly describe how we have extended from plant tipto many points on the plant, for a model of the plant stemdynamics. Future work will extend to two-axes image samplingfor a 3-d approach.

关键词： Light sources Robot sensing systems Light emitting diodes Data models Strips Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Memory bandwidth optimization of SpMV on GPGPUs

引用

Frontiers of computer Science 2015年第3期9卷 431-441页

作者： Chenggang Clarence YAN Hui YU Weizhi XU Yingping ZHANG Bochuan CHEN Zhu TIAN Yuxuan WANG Jian YIN Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Institute of Microelectronics Tsinghua University Beijing 100084 China Automation Department Tsinghua University Beijing 100084 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China State Grid Information & Communication Company of Hunan EPC Changsha 410007 China Department of Computer Shandong University Weihai 250101 China

It is an important task to improve performance for sparse matrix vector multiplication （SpMV）, and it is a difficult task because of its irregular memory access. Gen- eral purpose GPU （GPGPU） provides high computing abil- ity and substantial bandwidth that cannot be fully exploited by SpMV due to its irregularity. In this paper, we propose two novel methods to optimize the memory bandwidth for SpMV on GPGPU. First, a new storage format is proposed to exploit memory bandwidth of GPU architecture more effi- ciently. The new storage format can ensure that there are as many non-zeros as possible in the format which is suitable to exploit the memory bandwidth of the GPU. Second, we pro- pose a cache blocking method to improve the performance of SpMV on GPU architecture. The sparse matrix is partitioned into sub-blocks that are stored in CSR format. With the block- ing method, the corresponding part of vector x can be reused in the GPU cache, so the time to access the global memory for vector x is reduced heavily. Experiments are carried out on three GPU platforms, GeForce 9800 GX2, GeForce GTX 480, and Tesla K40. Experimental results show that both new methods can efficiently improve the utilization of GPU mem- ory bandwidth and the performance of the GPU.

关键词： GPGPU performance tuning SpMV cacheblocking memory bandwidth

来源：评论

学校读者我要写书评

暂无评论

Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures

Self-Organized Construction with Continuous Building Materia...

引用

IEEE International Workshops on Foundations and Applications of Self Systems

作者： Mary Katherine Heinrich Mostafa Wahby Mohammad Divband Soorati Daniel Nicolas Hofstadler Payam Zahadat Phil Ayres Kasper Støy Heiko Hamann Centre for IT and Architecture Royal Danish Academy Copenhagen Denmark Heinz Nixdorf Institute University of Paderborn Germany Universitat Paderborn Paderborn Nordrhein-Westfalen DE Artificial Life Lab of the Department of Zoology Karl-Franrens University Graz Austria Robotics Evolution and Art Lab IT University of Copenhagen Denmark Department of Computer Science Chemnitz University of Technology Germany

Self-organized construction with continuous, structured building material, as opposed to modular units, offers new challenges to the robot-based construction process and lends the opportunity for increased flexibility in constructed artifact properties, such as shape and deformation. As an example investigation, we look at continuous filaments organized into braided structures, within the context of bio-hybrids constructing architectural artifacts. We report the result of an early swarm robot experiment. The robots successfully constructed a braid in a self-organized process. The construction process can be extended by using different materials and by embedding sensors during the self-organized construction directly into the braided structure. In future work, we plan to apply dedicated braiding robot hardware and to construct sophisticated 3-d structures with local variability in patterns of filament interlacing.

关键词： Robot sensing systems Context Mobile robots Switches Carbon

来源：评论

学校读者我要写书评

暂无评论

HAFNI-enabled largescale platform for neuroimaging informatics (HELPNI)

引用

Brain Informatics 2015年第4期2卷 225-238页

作者： Makkie, Milad Zhao, Shijie Jiang, Xi Lv, Jinglei Zhao, Yu Ge, Bao Li, Xiang Han, Junwei Liu, Tianming Cortical Architecture Imaging and Discovery Lab Department of Computer Science and Bioimaging Research Center The University of Georgia AthensGA United States School of Automation Northwestern Polytechnical University Xi’an China School of Physics & Information Technology Shaanxi Normal University Xi’an China

Tremendous efforts have thus been devoted on the establishment of functional MRI informatics systems that recruit a comprehensive collection of statistical/computational approaches for fMRI data analysis. However, the state-of-the-art fMRI informatics systems are especially designed for specific fMRI sessions or studies of which the data size is not really big, and thus has difficulty in handling fMRI ‘big data.’ Given the size of fMRI data are growing explosively recently due to the advancement of neuroimaging technologies, an effective and efficient fMRI informatics system which can process and analyze fMRI big data is much needed. To address this challenge, in this work, we introduce our newly developed informatics platform, namely, ‘HAFNI-enabled largescale platform for neuroimaging informatics (HELPNI).’ HELPNI implements our recently developed computational framework of sparse representation of whole-brain fMRI signals which is called holistic atlases of functional networks and interactions (HAFNI) for fMRI data analysis. HELPNI provides integrated solutions to archive and process large-scale fMRI data automatically and structurally, to extract and visualize meaningful results information from raw fMRI data, and to share open-access processed and raw data with other collaborators through web. We tested the proposed HELPNI platform using publicly available 1000 Functional Connectomes dataset including over 1200 subjects. We identified consistent and meaningful functional brain networks across individuals and populations based on resting state fMRI (rsfMRI) big data. Using efficient sampling module, the experimental results demonstrate that our HELPNI system has superior performance than other systems for large-scale fMRI data in terms of processing and storing the data and associated results much faster. © 2015, The Author(s).

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Minimax regret 1-sink location problem in dynamic path networks

引用

Theoretical computer Science 2015年 588卷 24-36页

作者： Higashikawa, Yuya Augustine, John Cheng, Siu-Wing Golin, Mordecai J. Katoh, Naoki Ni, Guanqun Su, Bing Xu, Yinfeng Department of Architecture and Architectural Engineering Kyoto University Japan Department of Computer Science and Engineering Indian Institute of Technology Madras India Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Business School Sichuan University Chengdu610065 China School of Economics and Management Xi'an Technological University Xi'an710032 China School of Management Xi'an Jiaotong University Xi'an710049 China State Key Lab for Manufacturing Systems Engineering Xi'an710049 China

This paper considers the minimax regret 1-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths and uniform edge capacity, and each vertex supply which is nonnegative value is unknown but only the interval of supply is known. A particular assignment of supply to each vertex is called a scenario. Under any scenario, the cost of a sink location is defined as the minimum time to complete the evacuation for all supplies (evacuees), and the regret of a sink location x is defined as the cost of x minus the cost of the optimal sink location. Then, the problem is to find a point as a sink such that the maximum regret for all possible scenarios is minimized. We propose an O(nlog n) time algorithm for the minimax regret 1-sink location problem in dynamic path networks with uniform capacity, where n is the number of vertices in the network. © 2014 Elsevier B.V.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：