Optimal Code Partitioning Over Time and Hierarchical Cloudlets
نویسندگان
چکیده
منابع مشابه
Optimal combination forecasts for hierarchical time series
In many applications, there are multiple time series that are hierarchically organized and can be aggregated at several different levels in groups based on products, geography or some other features. We call these “hierarchical time series”. They are commonly forecast using either a “bottom-up” or a “top-down” method. In this paper we propose a new approach to hierarchical forecasting which pro...
متن کامل“ Optimal Market Grain Over Space and Time ”
Markets facilitate the exchange of precise quantities of goods and services at particular locations and times; yet for convenience and to reduce transactions costs, these markets customarily specify the terms (e.g. the price) uniformly over a substantial interval of space and time. If customers’ tastes and producers’ costs vary continuously over these dimensions, then assessing uniform prices w...
متن کاملHierarchical Hardware/Software Partitioning
In this paper, we present a hierarchical evolutionary approach to hardware/software partitioning for real-time embedded systems. In contrast to most of previous approaches which employ a single granularity for tasks and hardware modules, we use hierarchical models and dynamically determine the granularity of tasks and hardware modules to adaptively optimize the solution while keeping the search...
متن کاملHierarchical Domain Partitioning For Hierarchical Architectures
The history of parallel computing shows that good performance is heavily dependent on data locality. Prior knowledge of data access patterns allows for optimizations that reduce data movement, achieving lower data access latencies. Compilers and runtime systems, however, have difficulties in speculating on locality issues among threads. Future multicore architectures are likely to present a hie...
متن کاملBayes-optimal Hierarchical Classification over Asymmetric Tree-Distance Loss
Hierarchical classification is supervised multi-class classification problem over the set of class labels organized according to a hierarchy. In this report, we study the work by Ramaswamy et. al. on hierarchical classification over symmetric tree distance loss. We extend the consistency of hierarchical classification algorithm over asymmetric tree distance loss. We design a $\mathcal{O}(nk\log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2018
ISSN: 1089-7798
DOI: 10.1109/lcomm.2017.2764904