scholarly journals Models of concurrent program running in resource constrained environment

2020 ◽  
pp. 149-156
Author(s):  
D.V. Rahozin ◽  

The paper considers concurrent program modeling using resource constrained automatons. Several software samples are considered: real time operational systems, video processing including object recognition, neural network inference, common linear systems solving methods for physical processes modeling. The source code annotating and automatic extraction of program resource constraints with the help of profiling software are considered, this enables the modeling for concurrent software behavior with minimal user assistance.

Author(s):  
Ahmed Imteaj ◽  
M. Hadi Amini

Federated Learning (FL) is a recently invented distributed machine learning technique that allows available network clients to perform model training at the edge, rather than sharing it with a centralized server. Unlike conventional distributed machine learning approaches, the hallmark feature of FL is to allow performing local computation and model generation on the client side, ultimately protecting sensitive information. Most of the existing FL approaches assume that each FL client has sufficient computational resources and can accomplish a given task without facing any resource-related issues. However, if we consider FL for a heterogeneous Internet of Things (IoT) environment, a major portion of the FL clients may face low resource availability (e.g., lower computational power, limited bandwidth, and battery life). Consequently, the resource-constrained FL clients may give a very slow response, or may be unable to execute expected number of local iterations. Further, any FL client can inject inappropriate model during a training phase that can prolong convergence time and waste resources of all the network clients. In this paper, we propose a novel tri-layer FL scheme, Federated Proximal, Activity and Resource-Aware 31 Lightweight model (FedPARL), that reduces model size by performing sample-based pruning, avoids misbehaved clients by examining their trust score, and allows partial amount of work by considering their resource-availability. The pruning mechanism is particularly useful while dealing with resource-constrained FL-based IoT (FL-IoT) clients. In this scenario, the lightweight training model will consume less amount of resources to accomplish a target convergence. We evaluate each interested client's resource-availability before assigning a task, monitor their activities, and update their trust scores based on their previous performance. To tackle system and statistical heterogeneities, we adapt a re-parameterization and generalization of the current state-of-the-art Federated Averaging (FedAvg) algorithm. The modification of FedAvg algorithm allows clients to perform variable or partial amounts of work considering their resource-constraints. We demonstrate that simultaneously adapting the coupling of pruning, resource and activity awareness, and re-parameterization of FedAvg algorithm leads to more robust convergence of FL in IoT environment.


Author(s):  
GWAN-HWAN HWANG ◽  
KUO-CHUNG TAI ◽  
TING-LU HUANG

Concurrent programs are more difficult to test than sequential programs because of non-deterministic behavior. An execution of a concurrent program non-deterministically exercises a sequence of synchronization events called a synchronization sequence (or SYN-sequence). Non-deterministic testing of a concurrent program P is to execute P with a given input many times in order to exercise distinct SYN-sequences. In this paper, we present a new testing approach called reachability testing. If every execution of P with input X terminates, reachability testing of P with input X derives and executes all possible SYN-sequences of P with input X. We show how to perform reachability testing of concurrent programs using read and write operations. Also, we present results of empirical studies comparing reachability and non-deterministic testing. Our results indicate that reachability testing has advantages over non-deterministic testing.


2020 ◽  
Vol 12 (3) ◽  
pp. 917 ◽  
Author(s):  
Zhenfeng Liu ◽  
Jian Feng ◽  
Jinfeng Wang

Extensive research on resource-constrained innovation has been conducted by scholars and practitioners in recent years. An interesting research avenue is how firms explore the process of the new product development (NPD) and the ideas generation to foster resource-constrained innovation. However, despite the importance of product development and creative ideas under the resource-constraints contexts, innovation methods for applying to the resource-constrained innovation and designers have received comparatively less attention. As a remedy, this paper proposes a resource-constrained innovation method (RCIM) to generate ideas for the NPD. The RCIM is mainly divided into four sections: Developing the resource-constrained innovation approaches, developing the resource-constrained innovation dimensions, generating the creative ideas and evaluating the creative ideas. First, the resource-constrained innovation algorithms are developed based on success factors, characteristics, and attributes of resource-constrained innovation and the TRIZ (Teopия Peшeния Изoбpeтaтeльcкиx Зaдaч in Russian; Theory of Inventive Problem Solving in English) inventive principles via the systematic literature review (SLR). Second, the innovation dimensions are categorized to structure a target technology by means of the morphological analysis (MA) and the Derwent manual codes (DMCs) mapping based on collected patents. Third, the creative ideas are generated for the NPD by combining the innovation dimensions with the resource-constrained innovation approaches. Finally, the creative ideas are evaluated by the frugal criteria. The RCIM will stimulate designers’ creativity for achieving sustainability and innovation within constraint-based scenarios, MA and TRIZ.


2020 ◽  
Vol 12 (21) ◽  
pp. 8918
Author(s):  
Kyunghwan Kim

Delays by limited supply of resources are common in many construction projects and may cause serious monetary disputes between project participants. Since the dispute resolution may require unnecessary additional time and cost, preventing delays in advance is an important goal in sustainable construction project management. To prevent delays, a feasible plan must be implemented, which reflects limited resources and provides reliable activity information. For this purpose, this study proposes a generalized resource-constrained critical path method (eRCPM). It consists of three steps to identify resource-dependent activity relationships (resource links) based on the result of resource-constrained scheduling (RCS) under multiple resource constraints. Compared to the existing resource-constrained critical path methods, the eRCPM has the advantage of identifying resource links irrespective of the applied RCS technique because it is based on the result rather than the RCS process. Further, this study presents a Microsoft (MS) Excel-based half-automated prototype system that is linked using file export and import functions to both P6 and MS Project software packages. The detailed process of the eRCPM algorithm and the operation process of the prototype system are described using an example schedule. Through a case study, it was demonstrated that eRCPM appropriately identifies the necessary resource links and provides reliable total floats.


2019 ◽  
Vol 114 (1) ◽  
pp. 179-205 ◽  
Author(s):  
CHRISTOPHER J. ELLIS ◽  
THOMAS GROLL

We analyze the strategic considerations inherent in legislative subsidies and develop an informational lobbying model with costly policy reforms. In contrast to other models of informational lobbying, we focus on the implications of a policymaker’s and a lobby’s resource constraints for lobbying activities. We allow both a policymaker and a lobby to gather information, and each can either fund or subsidize policymaking. Our analysis highlights that legislative subsidies are both chosen strategically by lobbyists and strategically induced by policymakers, dependent on the circumstances. These involve which resource constraints bind the policymaker’s prior beliefs, the salience of policy, and the policymaker’s and lobby’s expertise in information gathering. Our results highlight five distinct motives for informational lobbying and demonstrate that for both a lobby and policymaker, there can be strategic advantages arising from being resource-constrained.


2019 ◽  
Vol 29 (1) ◽  
pp. 31-42 ◽  
Author(s):  
E.Kh. Gimadi ◽  
E.N. Goncharov ◽  
D.V. Mishin

We consider a resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities pre- emptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in form of the activity list. We use two approaches of constructing the lower bound. We present results of numerical experiments, illustrating the quality of the proposed lower bounds. The test instances are taken from the library of test instances PSPLIB.


Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2061 ◽  
Author(s):  
Xuesong Xu ◽  
Zhi Zeng ◽  
Shengjie Yang ◽  
Hongyan Shao

With the rapid development of industrial internet of thing (IIoT), the distributed topology of IIoT and resource constraints of edge computing conduct new challenges to traditional data storage, transmission, and security protection. A distributed trust and allocated ledger of blockchain technology are suitable for the distributed IIoT, which also becomes an effective method for edge computing applications. This paper proposes a resource constrained Layered Lightweight Blockchain Framework (LLBF) and implementation mechanism. The framework consists of a resource constrained layer (RCL) and a resource extended layer (REL) blockchain used in IIoT. We redesign the block structure and size to suit to IIoT edge computing devices. A lightweight consensus algorithm and a dynamic trust right algorithm is developed to improve the throughput of blockchain and reduce the number of transactions validated in new blocks respectively. Through a high throughput management to guarantee the transaction load balance of blockchain. Finally, we conducted kinds of blockchain simulation and performance experiments, the outcome indicated that the method have a good performance in IIoT edge application.


2012 ◽  
Vol 14 (02) ◽  
pp. 1250011 ◽  
Author(s):  
KJELL HAUSKEN

A sequential Colonel Blotto and rent seeking game with fixed and variable resources is analyzed. With fixed resources, which is the assumption in Colonel Blotto games, we show for the common ratio form contest success function that the second mover is never deterred. This stands in contrast to Powell's (Games and Economic Behavior67(2), 611–615) finding where the second mover can be deterred. With variable resources both players exert efforts in both sequential and simultaneous games, whereas fixed resources cause characteristics of all battlefields or rents to impact efforts for each battlefield. With variable resources only characteristics of a given battlefield impact efforts are to win that battlefield because of independence across battlefields. Fixed resources impact efforts and hence differences in unit effort costs are less important. In contrast, variable resources cause differences in unit effort costs to be important. The societal implication is that resource constrained opponents can be expected to engage in warfare, whereas an advantaged player with no resource constraints can prevent warfare.


Sign in / Sign up

Export Citation Format

Share Document