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

Joint program partitioning and Resource Allocation for Completion Time Minimization in Multi-MEC Systems

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2022年第3期9卷 1932-1948页

作者： Yi, Taizhou Zhang, Guopeng Wang, Kezhi Yang, Kun China Univ Min & Technol Sch Comp Sci & Technol Xuzhou 221116 Jiangsu Peoples R China Northumbria Univ Dept Comp & Informat Sci Newcastle Upon Tyne NE2 1XE Tyne & Wear England Univ Elect Sci & Technol China UESTC Zhongshan Coll Zhongshan 528400 Peoples R China Univ Elect Sci & Technol China UESTC Sch Commun & Informat Engn Chengdu 611731 Peoples R China Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ Essex England

This paper considers a practical mobile edge computing (MEC) system, where edge server does not pre-install the program required to perform user offloaded computing tasks. A partial program offloading (PPO) scheme is proposed, which can divide a user program into two parts, where the first part is executed by the user itself and the second part is transferred to an edge server for remote execution. However, the execution of the latter part requires the results of the previous part (called intermediate result) as the input. We aim to minimize the overall time consumption of a multi-server MEC system to complete all user offloaded tasks. It is modeled as a mixed integer nonlinear programming (MINLP) problem which considers user-and-server association, program partitioning, and communication resource allocation in a joint manner. An effective algorithm is developed to solve the problem by exploiting its structural features. First, the task completion time of a single server is minimized given the computing workload and available resource. Then, the working time of the edge servers are balanced by updating user-and-server association and communication resource allocation. Numerical results show that significant performance improvement can be achieved by the proposed scheme.

关键词： Servers Task analysis Resource management Delays Computational modeling Minimization Smart glasses Mobile edge computing partial program offloading program partitioning resource allocation

来源：评论

学校读者我要写书评

暂无评论

A heuristic approach to improve a branch and bound based program partitioning algorithm

A heuristic approach to improve a branch and bound based pro...

引用

International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems

作者： Takata, M Kunieda, Y Joe, K Nara Womens Univ Grad Sch Human Culture Nara 630 Japan

ISBN: (纸本)076950650X

In this paper we propose several heuristics that improve the branch and bound based program partitioning algorithm proposed by Girkar et. al., and evaluate the effectiveness by experiments. The heuristic depends heavily on the element order of edges of a given task graph. Therefore, it is necessary to sort the edges carefully to make effective use of the heuristic. Different sorting methods are investigated and experimentally evaluated. Approximate solutions that provide a sufficient practical partitioning were obtained using the accelerated heuristic, and execution times and error compared to the optimal solutions decreased considerably by sorting the edges of the task graph.

关键词： task graphs Heuristics branches program partitioning optimal solution sorting programs Bound

来源：评论

学校读者我要写书评

暂无评论

AutoSlicer: Automatic program partitioning for Securing Sensitive Data Based-on Data Dependency Analysis and Code Refactoring 21

AutoSlicer: Automatic Program Partitioning for Securing Sens...

引用

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

作者： Qiang, Weizhong Luo, Hao Huazhong Univ Sci & Technol Hubei Key Lab Distributed Syst Secur Hubei Engn Res Ctr Big Data Secur Sch Cyber Sci & Engn Wuhan 430074 Peoples R China

ISBN: (纸本)9781665494250

Legacy programs are normally monolithic (that is, all code runs in a single process and is not partitioned), and a bug in a program may result in the entire program being vulnerable and therefore untrusted. program partitioning can be used to separate a program into multiple partitions, so as to isolate sensitive data or privileged operations. Manual program partitioning requires programmers to rewrite the entire source code, which is cumbersome, error-prone, and not generic. Automatic program partitioning tools can separate programs according to the dependency graph constructed based on data or programs. However, programmers still need to manually implement remote service interfaces for inter-partition communication. Therefore, in this paper, we propose AutoSlicer, whose purpose is to partition a program more automatically, so that the programmer is only required to annotate sensitive data. AutoSlicer constructs accurate data dependency graphs (DDGs) by enabling execution flow graphs, and the DDG-based partitioning algorithm can compute partition information based on sensitive annotations. In addition, the code refactoring toolchain can automatically transform the source code into sensitive and insensitive partitions that can be deployed on the remote procedure call framework. The experimental evaluation shows that AutoSlicer can effectively improve the accuracy (13%-27%) of program partitioning by enabling EFG, and separate real-world programs with a relatively smaller performance overhead (0.26%-9.42%).

关键词： Execution flow Dependency analysis program partitioning Code refactoring

来源：评论

学校读者我要写书评

暂无评论

Fine-grained program partitioning for Security 14

Fine-grained Program Partitioning for Security

引用

14th European Workshop on Systems Security (EuroSec)

作者： Huang, Zhen Jaeger, Trent Tan, Gang Depaul Univ Chicago IL 60604 USA Penn State Univ State Coll PA USA

ISBN: (纸本)9781450383370

Complex software systems are often not designed with the principle of least privilege, which requires each component be given the minimum amount of privileges to function. As a result, software vulnerabilities in less privileged code can lead to privilege escalation, defeating security and privacy. Privilege separation is the process of automatically partitioning a software system into least privileged components, and we argue that it is effective at reducing the attack surface. However, previous privilege-separation systems do not provide fine-grained separation of privileged code and non-privileged code co-existing in the same function for C/C++ applications. We propose a fine-grained partitioning technique for supporting fine-grained separation in automatic program partitioning. The technique has been applied to a set of security-sensitive networking and interactive programs. Results show that it can automatically generate executable partitions for C applications;further, partitioned programs incur acceptable runtime overheads.

关键词： software security program partitioning principle of least privilege program analysis

来源：评论

学校读者我要写书评

暂无评论

A multi-objective genetic algorithm for program partitioning and data distribution using TVRG

A multi-objective genetic algorithm for program partitioning...

引用

International Conference on Parallel and Distributed Processing Techniques and Applications

作者： Takata, M Yamaguchi, T Watanabe, C Nakamura, Y Joe, K Kyoto Univ Japan Sci & Technol Agcy PRESTO Kyoto Japan

ISBN: (纸本)1932415262

We propose an algorithm that performs data distribution and parallelization simultaneously. The objectives of the simultaneous algorithm are to reduce the length of critical path and the total memory size. Regardless to say, memory usage for each processor must be balanced. To obtain an optimal solution, we first adopted a branch and bound method. Since the branch and bound method often fails in the case of a large task graph, we adopt a multi-objective genetic algorithm, that provides a near optimal solution. For effective simultaneous partitionings, we employ some edge sorting and ordering methods. The effectiveness of our simultaneous partitioning algorithms is shown by experimental results.

关键词： data distribution program partitioning parallel program TVRG genetic algorithm multi-objective

来源：评论

学校读者我要写书评

暂无评论

C program partitioning with Fine-Grained Security Constraints and Post-Partition Verification

C Program Partitioning with Fine-Grained Security Constraint...

引用

IEEE Military Communications Conference (MILCOM)

作者： Levatich, Maxwell Brotzman, Robert Flin, Benjamin Chen, Ta Krishnan, Rajesh Edwards, Stephen A. Columbia Univ Dept Comp Sci New York NY 10027 USA Peraton Labs Basking Ridge NJ USA

ISBN: (纸本)9781665485340

We address the problem of program partitioning: dividing a program into isolated compartments that communicate via remote procedure calls to follow a security policy. Existing solutions for C programs often use a simple model that offers only "sensitive or not" control and do not provide formal guarantees of partition correctness. We present a C program partitioner for security-conscious applications that addresses these shortcomings through annotation with fine-grained security constraints (chiefly, declassification of sensitive data to select parties);from these annotations, we automatically determine a partition and autogenerate code for marshaling, serialization, and remote procedure calls. We provide post-partition verification, which leverages translation validation to show that output program partitions are behaviorally equivalent to their input programs and satisfy the security policy specified by annotations. We present results that show our approach is practical when partitioning large realistic C applications with non-trivial security constraints.

关键词： program partitioning program equivalence Constraint solving Multi-level security Compartmentalization

来源：评论

学校读者我要写书评

暂无评论

Tamper-resistant whole program partitioning 03

Tamper-resistant whole program partitioning

引用

Association-for-Computing-Machinery SIGPLAN Conference on Languages Compilers and Tools for Embedded Systems (LCTES 03)

作者： Zhang, T Pande, S Valverde, A Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Infineon Technol Munich Germany

ISBN: (纸本)9781581136470

Due to limited available memory (of the order of Kilobytes) on embedded devices (such as smart cards), we undertake an approach of partitioning the whole program when it does not fit in the memory. The program partitions are downloaded from the server on demand into the embedded device just before execution. We devise a method of partitioning the code and data of the program such that no information regarding the control flow behavior of the program is leaked out. This property is called tamper resistance and it is very important for secure embedded devices such as smart cards which could hold sensitive information and/or carry out critical computation such as financial transactions. A preliminary solution to this problem was proposed in our earlier work [1]. This work proposes a new and more comprehensive solution to the problem. First, we propose a new policy which is based on keeping nothing in terms of partitions on the smart card. This policy is unlike the one in previous work which mandated keeping partitions in memory to which control flow was guaranteed to return. Based on this new policy, a new partitioning algorithm is proposed for minimal safe partitions which reduces their memory requirements over previous work. The drawback of this new policy is however lower execution speed due to frequent communication encountered. In order to not significantly degrade performance, we propose caching frequently executed functions on the smart card without violation of tamper resistance. A framework is designed to determine the set of functions to be cached in conjunction with specific minimal safe partitions. Further reduction in memory requirements is achieved due to the data partitioning. The decrease in memory footprint over the previous method is 27% for code memory and 32.4% for data memory on average. The speed-up over the old method is quite significant when applied to whole programs in large benchmarks (500 times on average). The conclusion is that previous me

关键词： security design performance tamper resistance mobile code smart card program partitioning

来源：评论

学校读者我要写书评

暂无评论

program partitioning Based on Static Call Graph Analysis for Privilege Separation

Program Partitioning Based on Static Call Graph Analysis for...

引用

IEEE Symposium on Computers and Communication

作者： Markus Trapp Michael Rossberg Guenter Schaefer Technische Universitat Ilmenau

ISBN: (纸本)9781467371957

The major cause of IT security incidents are software issues, hence this article presents an automated approach for source code partitioning and privilege separation. Based on static call graph analysis, functions and program parts of a monolithic software are separated in several processes and grouped by the privilege they need. For the partitioning we introduce a metric that estimates the potential security gain by considering the complexity and privilege distribution of the separated software. Furthermore, we present a partitioning heuristic that uses this metric to create a secure software partitioning.

关键词： program partitioning partitions computer software computer programs program part Line graph security incident Metric Metronidazole Information technology security

来源：评论

学校读者我要写书评

暂无评论

STRUCTURED partitioning OF CONCURRENT programS FOR EXECUTION ON MULTIPROCESSORS

引用

PARALLEL COMPUTING 1990年第1期16卷 41-57页

作者： WANG, CM WANG, SD Department of Electrical Engineering National Taiwan University Taipei 10764 Taiwan

In this paper, the problem of partitioning of parallel programs for execution on multiprocessors is investigated. By assuming run-time scheduling approaches, the static partitioning problems are formulated and solved in the context of a structured program representation model, in which a program is assumed to be composed of parallel loops. The structured partitioning problem is then defined as the problem of partitioning each parallel loop into appropriate number of tasks such that the program execution time is minimized in some sense. The worst case of the program execution cost is adopted as the minimization criterion, so the results obtained in this paper are guaranteed to be within some performance bound. Two algorithms are developed to solve this problem. The first algorithm using a prune-and-search technique can find the optimal partition, while the second algorithm can obtain a near optimal partition for the simplified partition problem in linear time. It is proved that the cost of the partition generated by the linear time algorithm is at most twice the cost of the optimal partition.

关键词： Cost analysis program partitioning Scheduling mechanism Shared memory multiprocessor Simplified structured partition problem Structured partition problem

来源：评论

学校读者我要写书评

暂无评论

LAZY TASK CREATION - A TECHNIQUE FOR INCREASING THE GRANULARITY OF PARALLEL programS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1991年第3期2卷 264-280页

作者： MOHR, E KRANZ, DA HALSTEAD, RH DIGITAL EQUIPMENT CORP CAMBRIDGE RES LABCAMBRIDGEMA 02139 MIT COMP SCI LABCAMBRIDGEMA 02139

Many parallel algorithms are naturally expressed at a fine level of granularity, often finer than a MIMD parallel system can exploit efficiently. Most builders of parallel systems have looked to either the programmer or a parallelizing compiler to increase the granularity of such algorithms. In this paper, we explore a third approach to the granularity problem by analyzing two strategies for combining parallel tasks dynamically at runtime. We reject the simpler load-based inlining method, where tasks are combined based on dynamic load level, in favor of the safer and more robust lazy task creation method, where tasks are created only retroactively as processing resources become available. These strategies grew out of work on Mul-T [17], an efficient parallel implementation of Scheme, but could be used with other languages as well. We describe our Mul-T implementations of lazy task creation for two contrasting machines, and present performance statistics which show the method's effectiveness. Lazy task creation allows efficient execution of naturally expressed algorithms of a substantially finer grain than possible with previous parallel Lisp systems. Earlier versions of this paper appeared as [20] and [21].

关键词： LOAD BALANCING PARALLEL programMING LANGUAGES PARALLEL LISP PROCESS MIGRATION program partitioning TASK MANAGEMENT

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：