Controlling power consumption and temperature is of major concern for modern computingsystems. In this work we characterize thermal behavior and power consumption of an IBM POWER6 (TM)-based system. We perform the ch...
详细信息
ISBN:
(纸本)9781450301787
Controlling power consumption and temperature is of major concern for modern computingsystems. In this work we characterize thermal behavior and power consumption of an IBM POWER6 (TM)-based system. We perform the characterization at several levels: application, operating system, and hardware level, both when the system is idle, and under load. At hardware level, we report a 25% reduction in total system power consumption by using the processor low power mode. We also study the effect of the hardware thread prioritization mechanism provided by POWER6 on different workloads and how this mechanism can be used to limit power consumption. At OS level, we analyze the power reduction techniques implemented in the Linux kernel, such as the tickless kernel and the CPU idle power manager. At application level, we characterize the power consumption and the temperature of two sets of benchmarks (METbench and SPEC CPU2006) and we study the effect of workload characteristics on power consumption and core temperature. From this characterization we derive a model based on performance counters that allows us to predict the total power consumption of the POWER6 system with an average error under 3% for CMP and 5% for SMT. To the best of our knowledge, this is the first power model of a system including CMP+SMT processors. Finally, we show that the static decision on whether to consolidate tasks into the same core/chip, as it is currently done in Linux, can be improved by dynamically considering the low-power capabilities of the underlying architecture and the characteristics of the application (up to 5X improvement in (EDP)-P-2).
Most learning algorithms assume that a training dataset is given initially. We address the common situation where data is not available initially, but can be obtained, at a cost. We focus on learning Bayesian belief n...
详细信息
ISBN:
(纸本)9781605589077
Most learning algorithms assume that a training dataset is given initially. We address the common situation where data is not available initially, but can be obtained, at a cost. We focus on learning Bayesian belief networks (BNs) over discrete variables. As such BNs are models of probabilistic distributions, we consider the "generative" challenge of learning the parameters for a fixed structure, that best match the true distribution. We focus on the budgeted learning setting, where there is a known fixed cost c, for acquiring the value of the ith feature for any specified instance, and a known total budget to spend acquiring all information. After formally defining this problem from a Bayesian perspective, we first consider non-sequential algorithmsthat must decide, before seeing any results, which features of which instances to probe. We show this is NP-hard, even if all variables are independent, then prove that the greedy allocation algorithm IGA is optimal here when the costs are uniform, but can otherwise be sub-optimal. We then show that general (sequential) policies perform better than non-sequential, and explore the challenges of learning the parameters for general belief networks in this sequential setting, describing conditions for when the obvious round-robin algorithm will, versus will not, work optimally. We also explore the effectiveness of this and various other heuristic algorithms. Copyright 2010 by the author(s)/owner(s).
the already introduced Neural Map provides a structural association for the building blocks of dynamically generated object models. Its learning and recall procedures are built upon the Growing Neural Gas algorithm, w...
详细信息
New carbon tax and carbon cap-and-trade regimes and an expected increase in energy prices in the future stand to change the way water utilities will fiscally manage new system improvements in aging systems. this is pa...
详细信息
ISBN:
(纸本)9780415548519
New carbon tax and carbon cap-and-trade regimes and an expected increase in energy prices in the future stand to change the way water utilities will fiscally manage new system improvements in aging systems. this is particularly true in large water transfer projects with large pumping and operating requirements over service lives that span 50 to 100 years. In this paper, the multi-objective non-dominated sorting genetic algorithm (NSGA-II) is applied to the Kamalsaleh water transmission pipeline to minimize the capital cost of reservoirs and the operating costs of pumping under realistic scenarios of discount rates and carbon prices. Preliminary results indicate that discount rate and carbon price have a significant impact on the shape of Pareto-optimal fronts and thus on planning decisions concerning large water transfer projects with significant pumping requirements.
Mobile users are roaming in a zone of cells in a cellular network system. the probabilities of each user residing in each cell are known, and all probabilities are independent. the task is to find any one, or all, of ...
详细信息
ISBN:
(纸本)9783642131929
Mobile users are roaming in a zone of cells in a cellular network system. the probabilities of each user residing in each cell are known, and all probabilities are independent. the task is to find any one, or all, of the users, by paging the cells in a predetermined number of rounds. In each round, any subset of the cells can be paged. When a cell is paged, the list of users in it is returned. the paging process terminates when the required user(s) are found. the objective is to minimize the expected number of paged cells. Finding any one user is known as the yellow page problem, and finding all users is known as the conference call problem. the conference call problem has been proved NP-hard, and a polynomial time approximation scheme exists. We study both problems in a unified framework. We introduce three methods for computingthe paging cost. We give a hierarchical classification of users. For certain classes of users, we either provide polynomial time optimal solutions, or provide relatively efficient exponential time solutions. We design a family of twelve fast greedy heuristics that generate competitive paging strategies. We implement optimal algorithms and non-optimal heuristics. We test the performance of our greedy heuristics on many patterns of input data with different parameters. We select the best heuristics for both problems based on our simulation. We evaluate their performances on randomly generated Zipf and uniform data and on real user data.
Today,an increasing number of organizations are certified according to international management standards,such as ISO 9001 and ISO *** is not easy,however,to identify the driving motivations given the small number of ...
详细信息
ISBN:
(纸本)9783865735935
Today,an increasing number of organizations are certified according to international management standards,such as ISO 9001 and ISO *** is not easy,however,to identify the driving motivations given the small number of studies and the wide variety of *** automation industry,for example,perceives "marketing advantage" and "customer pressure" as the most important motivations for adopting ISO *** research reveals a link between the size of organizations and the *** study shows that companies have a higher esteem for the certificates than their real efforts to obtain them.
A sparse kernel density estimator is derived based on the zero-norm constraint, in which the zero-norm of the kernel weights is incorporated to enhance model sparsity. the classical Parzen window estimate is adopted a...
详细信息
Advertising is an important aspect of the Web as many services rely on it for continued viability this paper provides insight into the effectiveness of using ant-inspired algorithms to solve the problem of Internet ad...
详细信息
ISBN:
(纸本)9783642130243
Advertising is an important aspect of the Web as many services rely on it for continued viability this paper provides insight into the effectiveness of using ant-inspired algorithms to solve the problem of Internet advertising he paper is motivated by the success of collaborative filtering systems and lie success of ant-inspired systems in solving data mining and complex classification problems Using the vector space formalism, a model is proposed that learns to associate ads with pages with no prior knowledge of users interests T model uses historical data from users' click-through pawn its in order to improve associations A test. bed and *** is described, and the proposed model evaluated using simulation the ported results clearly show that, significant improvements in ad association performance are achievable
this paper addresses two challenges in combination: learning with a very limited number of labeled training examples (active learning) and learning in the presence of multiple views for each object where the global mo...
详细信息
On-chip interconnection network has been used to connect a large number of modules in reconfigurable systems, such as FPGAs. the network topology is a crucial factor that affects the performance, cost, and power consu...
详细信息
ISBN:
(纸本)9780889868205
On-chip interconnection network has been used to connect a large number of modules in reconfigurable systems, such as FPGAs. the network topology is a crucial factor that affects the performance, cost, and power consumption of the system, and various network topologies have been proposed so far. To reveal cost- and powerefficient on-chip network structure in the reconfigurable systems, in this paper, we first estimate the performance of 2D-mesh, 2D-torus, Fat-Trees, Spidergon, Concentrated mesh, and Flattened Butterfly by using a network simulator. then, these topologies are synthesized, placed, and routed by using the Xilinx ISE in order to show the number of slices required and power consumption for each topology. Based on the evaluation results, the performanceper- cost and the performance-per-power of these network topologies are compared. We discuss the pros and cons of the high-radix topologies, such as Concentrated mesh and Flattened Butterfly, when they are used in FPGAs. We also show that the high radix topologies are suitable to FPGAs, because of their relatively small area overhead and short hop count.
暂无评论