• Title/Summary/Keyword: execution methods

Search Result 648, Processing Time 0.027 seconds

Resource management for moldable parallel tasks supporting slot time in the Cloud

  • Li, Jianmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4349-4371
    • /
    • 2019
  • Moldable parallel tasks are widely used in different areas, such as weather forecast, biocomputing, mechanical calculation, and so on. Considering the deadline and the speedup, scheduling moldable parallel tasks becomes a difficulty. Past work majorly focuses on the LA (List Algorithms) or OMA (Optimizing the Middle Algorithms). Different from prior work, our work normalizes execution time and makes all tasks have the same scope in normalized execution time: [0,1], and then according to the normalized execution time, a method is used to search for the reference execution time without considering the deadline of tasks. According to the reference execution time, we get an initial scheduling result based on AFCFS (Adaptive First Comes First Served) policy. Finally, a heuristic approach is used to improve the performance of the initial scheduling result. We call our method HSRET (a Heuristic Scheduling method based on Reference Execution Time). Comparisons to other methods show that HSRET has good performance in AWT (Average Waiting Time), AET (Average Execution Time), and PUT (Percentages of Unfinished Tasks).

Efficient Task Execution Methods in Multi-Agent Systems (멀티 에이전트 시스템에서의 효율적인 작업 수행 방법)

  • 박정훈;최중민
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.511-514
    • /
    • 1998
  • This paper proposes efficient methods that integrate and execute local plan rules of task agents in a multi-agent environment. In these methods, each agent's plan rules are represented in a network structure, and these networks are then collected by a single task agent to build a integrated domain network, which is exploited to achieve the goal. Agent problem solving by using the domain network enables a concurrent execution of plan rules that are sequential in nature.

  • PDF

Evaluation of Network Reliability Using Most Probable States

  • Oh, Dae-Ho;Park, Dong-Ho;Lee, Seung-Min
    • Proceedings of the Korean Reliability Society Conference
    • /
    • 2001.06a
    • /
    • pp.463-469
    • /
    • 2001
  • An algorithm is presenter for generating the most probable states in decreasing order of probability of each unit. The proposed new algorithm in this note is compared with the existing methods regarding memory requirement and execution time. Our method is simpler and, judging from the computing experiment, it requires less memory size than the previously known methods and takes comparable execution time to previous methods for an acceptable level of criterion.

  • PDF

Development of Query Transformation Method by Cost Optimization

  • Altayeva, Aigerim Bakatkaliyevna;Yoon, Youngmi;Cho, Young Im
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.1
    • /
    • pp.36-43
    • /
    • 2016
  • The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users' queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive cost-based transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

Method for Delegating Remote Attestation Verification and Establishing a Secure Channel (대리자를 통한 원격증명 검증 및 보안 연결 성립 방법)

  • Lee, Kyeong-Ryong;Cho, Yeong-Pil;You, Jun-seung;Paek, Yun-Heung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2021.11a
    • /
    • pp.267-269
    • /
    • 2021
  • Trusted Execution Environment(TEE) is an execution environment provided by CPU hardware to gain guarantee that the execution context is as expected by the execution requester. Remote attestation of the execution context naturally arises from the concept of TEEs. Many implementations of TEEs use cryptographic remote attestation methods. Though the implementation of attestation may be simple, the implementation of verification may be very complex and heavy. By using a server delegating the verification process of attestation information, one may produce lightweight binaries that may verify peers and establish a secure channel with verified peers.

The Effect of Environmental Campaign on the Recognition of Environmental Problem and the Execution of Environmental Protection in Foodservice (단체급식소에서의 환경운동이 환경문제 인식도와 환경보호 실천도에 미치는 영향)

  • Jeon, Mu-Yeong;Min, Hye-Seon
    • Journal of the Korean Dietetic Association
    • /
    • v.6 no.2
    • /
    • pp.71-78
    • /
    • 2000
  • Environmental pollution induced by food wastes is considered as one of very serious problems in the world, and it is the most important to reduce the production of food wastes. In this study, environmental campaign for reducing food waste was conducted by applying various campaign methods using such as a bulletin board, intra-network, slogans & posters and news letters, as well as some systems such as penalty and prize in a business & industry foodservice. We investigated customers' recognition and execution degree before and after environmental campaign for the purpose of analyzing the changes of customers' attitude by the campaign. The subjects of this study had generally high level of recognition of environmental problem(3.09 point) compared to the execution degree(1.88 point)(Max. 5 points), implying necessity for the induction of actual execution of food wastes reduction by continuous environmental campaign. After environmental campaign, the recognition of environmental problem related to food wastes was significantly increased from 3.09 point to 3.29 point (p<0.001), and the execution degree for food wastes reduction was also greatly increased from 1.88 to 2.70 point (p<0.001). These changes indicated that campaign for food wastes reduction has raised customers' recognition and execution for environmental protection.

  • PDF

Measuring Method of Worst-case Execution Time by Analyzing Relation between Source Code and Executable Code (소스코드와 실행코드의 상관관계 분석을 통한 최악실행시간 측정 방법)

  • Seo, Yongjin;Kim, Hyeon Soo
    • Journal of Internet Computing and Services
    • /
    • v.17 no.4
    • /
    • pp.51-60
    • /
    • 2016
  • Embedded software has requirements such as real-time and environment independency. The real-time requirement is affected from worst-case execution time of loaded tasks. Therefore, to guarantee real-time requirement, we need to determine a program's worst-case execution time using static analysis approach. However, the existing methods for worst-case execution time analysis do not consider the environment independency. Thus, in this paper, in order to provide environment independency, we propose a method for measuring task's execution time from the source codes. The proposed method measures the execution time through the control flow graph created from the source codes instead of the executable codes. However, the control flow graph created from the source code does not have information about execution time. Therefore, in order to provide this information, the proposed method identifies the relationships between statements in the source code and instructions in the executable code. By parameterizing those parts that are dependent on processors based on the relationships, it is possible to enhance the flexibility of the tool that measures the worst-case execution time.

Comparison of EEG Changes Induced by Action Execution and Action Observation

  • Kim, Ji Young;Ko, Yu-Min;Park, Ji Won
    • The Journal of Korean Physical Therapy
    • /
    • v.29 no.1
    • /
    • pp.27-32
    • /
    • 2017
  • Purpose: Recent electrophysiological studies have shown that the sensorymotor cortex is activated during both actual action excuted by themselves and observation of action performed by other persons. Observation of action based on mirror neuron system can be used as a cognitive intervention to promote motor learning. The purpose of this study was to investigate the brain activity changes during action observation and action execution using EEG. Methods: Thirty healthy volunteers participated and were requested to perform hand action and to observe the video of hand action performed by another person. The EEG activity was evaluated by a method which segregated the time-locked for each condition. To compare the differences between action observation and execution, the Mu suppression and the relative band power were analysed. Results: The results showed significant mu suppression during the action observation and execution, but the differences between the two conditions were not observed. The relative band power showed a significant difference during the action observation and execution, but there were no differences between the two conditions. Conclusion: These results indicate that action execution and observation involve overlapping neural networks in the sensorymotor cortical areas, proposing positive changes on neurophysiology. We are expected to provide information related to the intervention of cognitive rehabilitation.

Design of Resource Grouping for Desktop Grid Computing and Its Application Methods to Fault-Tolerance (데스크톱 그리드 컴퓨팅을 위한 자원 그룹핑 설계 및 결함포용으로의 적용 방안)

  • Shon, Jin Gon;Gil, Joon-Min
    • Journal of Digital Contents Society
    • /
    • v.14 no.2
    • /
    • pp.171-178
    • /
    • 2013
  • Desktop grid computing is the computing paradigm that can execute large-scale computing jobs using the desktop resources with heterogeneity and volatility. However, such the computing environment can not guarantee the stability and reliability of task execution because the desktop resources with different performance can freely participate and leave in task execution. Therefore, in this paper, we design resource grouping scheme using k-means clustering algorithm with an aim to provide desktop grid computing with the stability and reliability of task execution. Moreover, we conduct resource grouping using the execution log data of actual desktop grid systems and present application methods of desktop resource groups to fault-tolerance.

A Study on Mariners' Standard Behavior for Collision Avoidance (3) - Modeling of the execution process of an avoiding action based on human factors -

  • Park, Jung-Sun;Kobayashi, Hiroaki;Yea, Byeong-Deok
    • Journal of Navigation and Port Research
    • /
    • v.32 no.4
    • /
    • pp.279-285
    • /
    • 2008
  • We have proposed modeling methods of mariners' standard behavior for collision avoidance by analyzing mariners' recognition process in a previous study. As a subsequent study, the aim of this study is to build a model of mariners' execution process which is one of six processes in the condition of collision avoidance. In this study, thus, the structure of mariners' information processing on the process of taking avoiding actions is described and the relation between mariners' behavior and necessary factors in the process is analyzed. And then we have built a model of mariners' standard behavior for execution process based on the characteristics of mariners in ship-handling, which are obtained from the international collaborative research on human factors. It is tried to define the contents of execution process based on the standard behavior of mariners for collision avoidance and to formulate information processing of mariners.