• Title/Summary/Keyword: Software task

Search Result 673, Processing Time 0.031 seconds

The Effect of Task Interdependence and User Participation on Software Development Project Performance (업무상호의존성과 사용자참여가 소프트웨어 개발 프로젝트 성과에 미치는 영향)

  • Hong Myung-Hon;Kim Shinkon;Kim Jeonggon
    • Journal of Information Technology Applications and Management
    • /
    • v.12 no.1
    • /
    • pp.213-229
    • /
    • 2005
  • Cost overrun or schedule delay of the software development project happens frequently despite that software developers continue to make every effort for the effective management of the projects. Previous researches have ascertained that these problems are ascribed to the uncertainty of projects and the improper management of the projects. The purposes of this research are to investigate the impacts of user participation and task interdependence on the performance of the projects and also to find out the appropriate project management method to improve the project performance. Even though the model fitness of the path model is proved to be very high, the verification of the hypotheses showed a variety of results including the four verifications and the one refutation of the hypotheses as well as the suggestion of one alternative hypothesis. The contribution of this research is that the integration model is proposed and verified, comprising the relationship among the user participation, the task interdependence, and the performance of software development projects. A project manager can utilize the implication of this research for an effective management of software development project.

  • PDF

Software-Defined Cloud-based Vehicular Networks with Task Computation Management

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.419-421
    • /
    • 2018
  • Cloud vehicular networks are a promising paradigm to improve vehicular through distributing computation tasks between remote clouds and local vehicular terminals. Software-Defined Network(SDN) can bring advantages to Intelligent Transportation System(ITS) through its ability to provide flexibility and programmability through a logically centralized controlled cluster that has a full comprehension of view of the network. However, as the SDN paradigm is currently studied in vehicular ad hoc networks(VANETs), adapting it to work on cloud-based vehicular network requires some changes to address particular computation features such as task computation of applications of cloud-based vehicular networks. There has been initial work on briging SDN concepts to vehicular networks to reduce the latency by using the fog computing technology, but most of these studies do not directly tackle the issue of task computation. This paper proposes a Software-Defined Cloud-based vehicular Network called SDCVN framework. In this framework, we study the effectiveness of task computation of applications of cloud-based vehicular networks with vehicular cloud and roadside edge cloud. Considering the edge cloud service migration due to the vehicle mobility, we present an efficient roadside cloud based controller entity scheme where the tasks are adaptively computed through vehicular cloud mode or roadside computing predictive trajectory decision mode. Simulation results show that our proposal demonstrates a stable and low route setup time in case of installing the forwarding rules of the routing applications because the source node needs to contact the controller once to setup the route.

  • PDF

Software-Defined Cloud-based Vehicular Networks with Task Computation Management

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.238-240
    • /
    • 2018
  • Cloud vehicular networks are a promising paradigm to improve vehicular through distributing computation tasks between remote clouds and local vehicular terminals. Software-Defined Network(SDN) can bring advantages to Intelligent Transportation System(ITS) through its ability to provide flexibility and programmability through a logically centralized controlled cluster that has a full comprehension of view of the network. However, as the SDN paradigm is currently studied in vehicular ad hoc networks(VANETs), adapting it to work on cloud-based vehicular network requires some changes to address particular computation features such as task computation of applications of cloud-based vehicular networks. There has been initial work on briging SDN concepts to vehicular networks to reduce the latency by using the fog computing technology, but most of these studies do not directly tackle the issue of task computation. This paper proposes a Software-Defined Cloud-based vehicular Network called SDCVN framework. In this framework, we study the effectiveness of task computation of applications of cloud-based vehicular networks with vehicular cloud and roadside edge cloud. Considering the edge cloud service migration due to the vehicle mobility, we present an efficient roadside cloud based controller entity scheme where the tasks are adaptively computed through vehicular cloud mode or roadside computing predictive trajectory decision mode. Simulation results show that our proposal demonstrates a stable and low route setup time in case of installing the forwarding rules of the routing applications because the source node needs to contact the controller once to setup the route.

  • PDF

Task Factoring to support reuse in Agile Methods (애자일 방법에서 재사용을 지원하는 태스크 팩토링)

  • Kim, Ji-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.57-65
    • /
    • 2011
  • Since software reuse and agile development methods are seen as ways to shorten development time and accept frequent requirement changes, respectively, there has been growing interest and research on integrating these approaches. But despite the increasing number of software companies which have successfully adopted agile development methods, there has been little research on reuse in agile methods to further improve productivity. In this paper, we identify a new type of reuse asset and propose a task factoring technique by taking advantage of iteration characteristics to support reuse in agile software development methods. In addition, we can apply the proposed technique and show prototyping of task reuse in a video rental application.

The effects of learning method, learning schedule, and task difficulty on the learning of computer software (학습방법, 학습계획, 과제 난이도가 소프트웨어 학습에 미치는 영향)

  • Kim, Kyung-Su;Li, Hyung-Chul;Kim, Shinwoo
    • Science of Emotion and Sensibility
    • /
    • v.17 no.1
    • /
    • pp.3-12
    • /
    • 2014
  • Quick and accurate learning of diverse electronic products has become an important daily task. In particular, software occupies core status in the control and operation of the products. This research tested the effects of learning method, schedule, and task difficulty in the learning of software. Using 2 (learning method: experiential vs. verbal) ${\times}$ 2 (learning schedule: spaced vs. massed) ${\times}$ 2 (difficulty: easy vs. difficult) between-subjects design, Experiment 1 tested participants' learning of file control using Windows Movie Maker. There was no effect of learning schedule on task completion time, but participants in experiential learning were faster in the completion of evaluation task compared with those in verbal learning condition. Importantly, as task difficulty increases participants in verbal condition showed markedly lower performance than those in experiential condition, which suggests that experiential learning is more effective with more difficult learning task. That is, in case of learning simple operation of software verbal learning using linguistic manual or instruction could be sufficient; on the other hand in case of learning complex operation learning from experience or tutorial mode would be more effective. Additional studies which manipulated task difficulty (Expt. 2) and inter-trial learning interval (Expt. 3) did not produce meaningful results.

Software Pipeline-Based Partitioning Method with Trade-Off between Workload Balance and Communication Optimization

  • Huang, Kai;Xiu, Siwen;Yu, Min;Zhang, Xiaomeng;Yan, Rongjie;Yan, Xiaolang;Liu, Zhili
    • ETRI Journal
    • /
    • v.37 no.3
    • /
    • pp.562-572
    • /
    • 2015
  • For a multiprocessor System-on-Chip (MPSoC) to achieve high performance via parallelism, we must consider how to partition a given application into different components and map the components onto multiple processors. In this paper, we propose a software pipeline-based partitioning method with cyclic dependent task management and communication optimization. During task partitioning, simultaneously considering computation load balance and communication optimization can cause interference, which leads to performance loss. To address this issue, we formulate their constraints and apply an integer linear programming approach to find an optimal partitioning result - one that requires a trade-off between these two factors. Experimental results on a reconfigurable MPSoC platform demonstrate the effectiveness of the proposed method, with 20% to 40% performance improvements compared to a traditional software pipeline-based partitioning method.

Performance Evaluation of Software Task Processing Based on Markovian Perfect Debugging Model

  • Lee, Chong-Hyung;Jang, Kyu-Beam;Park, Dong-Ho
    • The Korean Journal of Applied Statistics
    • /
    • v.21 no.6
    • /
    • pp.997-1006
    • /
    • 2008
  • This paper proposes a new model by combining an infinite-server queueing model for multi-task processing software system with a perfect debugging model based on Markov process with two types of faults suggested by Lee et al. (2001). We apply this model for module and integration testing in the testing process. Also, we compute several measure, such as the expected number of tasks whose processes can be completed and the task completion probability are investigated under the proposed model.

Automation of the Concurrent Real-Time Task Structuring in the modified CDOARTS Methodology (수정된 CODARTS 벙법론에서의 실시간 병렬 태스크 자동 구성)

  • 김규년;정민포;이종구
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.1
    • /
    • pp.106-106
    • /
    • 1999
  • When we design real-time software target system is analyzed and then we structure sequential executive modules into concurrent tasks. As a result of the analysis, control flow and dataflow diagram based on the RTSA notation is produced. This diagram is structured into concurrenttasks under the condition that performance problem is not serious. The criteria structuring concurrenttasks are introduced as Concurrent Design Approach for Real-Time System(CODARTS) by Gomaa.But structuring concurrent tasks using the criteria of CODARTS is somewhat difficult because thecriteria are dependent on designer's experience. CODARTS is an wide-range and abstractmethodology. As a result, the design can be inconsistent and peoples can understand it differently Inthis paper, we restructure the CODARTS methodology, propose a revised CODARTS structure andrepresent the task structuring steps for this new framework to overcome the understanding andinconsistency problems. The revised CODARTS framework and task structuring steps can be used toautomate the design of real time concurrent software systems. Finally, we show an example of taskstructuring in revised CODARTS framework.

A Study for the Efficient Memory Management in time of using Cross Compiler (크로스 컴파일러에서의 효율적인 메모리 사용 기법에 대한 연구)

  • Kyong, Bo-Hyun;Jeon, Seung-Hun
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.641-644
    • /
    • 2003
  • 본 논문은 RTOS(Real-Time Operation System, 리턴어드레스를 위한 유저스택사용 RTOS가 탑재된 CE(Consumer Electronic)제품상에서 리턴어드레스가 유저스택으로 저장하는 것을 지원하지 않는 컴파일러를 위한 알고리즘이며 실험을 위하여 제안된 알고리즘을 상용 컴파일러에 적용하여 비교해보도록 하겠다. 우선 기존 컴파일러 알고리즘으로는 Task마다 할당된 유저스택영역이 존재하며 Task가 수행중 발생된 리턴어드레스는 즉시 할당된 유저스택으로 저장하는 알고리즘을 갖고있다. 이런 알고리즘으로 인하여 인스트럭션이 수행중 빈번한 메모리 접근(external memory)가 발생한다. 그러나 제안된 알고리즘은 Task 수행중에는 리턴어드레스를 시스템스택(internal memory)에 저장한 후 Task 전환이 발생할 경우 일시에 시스템 스택에 저장된 리턴어드레스를 유저스택으로 이동하게 되므로 Task 수행중에는 시스템 스택만을 접근하므로 task의 수행시간을 단축할 수가 있다. 그리고 실험을 위하여 상용 컴파일러들에 본 알고리즘을 적용하였다. 상용 컴파일러로는 매번 리턴어드레스를 자동으로 Task별 할당된 유저스택에 저장할 수 있도록 지원해주는 TASKING 컴파일러(Altium 사)와 그렇지 않은 KEIL컴파일러(KEIL사)가 있으며 본 알고리즘을 KEIL 컴파일러에 적용하여 실험을 하여 TASKING 컴파일러와 비교한 결과 유저스택을 지원하는 TASKING(Altium사) 컴파일러에서 구현한 CE제품의 Response time이 KEIL 컴파일러에서 구현한 CE제품의 Response time 값이 같게 나왔다. 그러므로 KEIL 컴파일러상에 본 알고리즘을 적용시킬 경우 RTOS가 탑재된 CE제품을 보다 용이하게 구현할 수가 있다.

  • PDF