• Title/Summary/Keyword: concurrent programming

Search Result 46, Processing Time 0.034 seconds

Solving Inheritance Anomaly using Inheritance Interface Mechanism in Concurrent Object-Oriented Programming Languages (병행 객체지향 언어에서 상속 인터페이스 메커니즘을 이용한 상속 변칙의 해결)

  • Kim, Kuk-Se;Lee, Gwang;Bang, Keug-in;Park, Young-Ok;Lee, Joon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.05a
    • /
    • pp.230-234
    • /
    • 1999
  • Inheritance and concurrency are the primary feature of object oriented languages, and are especially important for code re-use. They provide maximum computational power and modeling power through concurrency of objects. But, concurrent objects and inheritance have conflicting characteristics, thereby simultaneously use of them causes the problem, so failed inheritance anomaly, which requires code redefinition of inherited methods to maintain integrity of objects. In this paper, to solve the inheritance anomaly problems we introduce concept of state abstraction, in which infernal states of encapsulated objects are made available from a part of object's external interface. And we design inheritance interface mechanisms which methods are inherited efficiently. In our scheme, we can solve the typical inheritance anomaly problems.

  • PDF

Integrated Structural Design Operation by Process Decomposition and Parallelization (프로세스 분할 병행에 의한 통합 구조설계 운용)

  • Hwang, Jin-Ha;Park, Jong-Hoi
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.21 no.1
    • /
    • pp.113-124
    • /
    • 2008
  • Distributed operation of overall structural design process, by which product optimization and process parallelization are simultaneously implemented, is presented in this paper. The database-interacted hybrid method, which selectively takes the accustomed procedure of the conventional method in the framework of the optimal design, is utilized here. The staged application of design constraints reduces the computational burden for large complex optimization problems. Two kinds of numeric and graphic processes are simultaneously implemented by concurrent engineering approach in the distributed environment of PC networks. The former is based on finite element optimization method and the latter is represented by AutoCAD using AutoLISP programming language. Numerical computation and database interaction on servers and graphic works on independent clients are communicated through message passing. The numerical experiments for some steel truss models show the validity and usability of the method. This study has sufficient adaptability and expandability, in that it is based on general methodologies and industry standard platforms.

Network Management Script Construction in Delegation Model (위임 모델에서의 네트워크 관리 스크립트 작성에 관한 연구)

  • 한순희;이기현;조국현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.11
    • /
    • pp.1228-1237
    • /
    • 1992
  • Network management represents those activities which control and moitor the use of resources. Remote delegation model supports flexible and effective distribution of management functions among managers and agents, and it may cause an reliable network management in a relatively complex and high-speed networks. in this model, managers delegate to agents execution of management programs as prescribed in a management scripting language. In addition, primitives included in the management programs enable agents to monitor and control localmanaged objects effectively. We suggest management algorithms in which management scripts are delegated from managers to agents and partiality implement OSI fault management. This mans gement algorithm can effectively support delegation and control concurrent accesses to management information. Moreover, it can be easily translated into object-based concurrent programming language: ABCL. In this paper, we will scrutinize some essential aspects of this management.

  • PDF

Alpha : Java Visualization Tool (Alpha : 자바 시각화 도구)

  • Kim, Cheol-Min
    • The Journal of Korean Association of Computer Education
    • /
    • v.7 no.3
    • /
    • pp.45-56
    • /
    • 2004
  • Java provides support for Web, concurrent programming, safety, portability, and GUI, so there is a steady increase in the number of Java users. Java is based on the object-oriented concepts such as classes, instances, encapsulation, inheritance, and polymorphism. However the JVM(Java Virtual Machine) hides most of the phenomena related to the concepts. This is why most of Java users have much difficulty in learning and using Java. As a solution to the problem, I have developed a tool Alpha that visualizes the phenomena occurred in the JVM from the standpoint of the concepts and will describe the design and features of the tool in this paper. For practicality and extendability Alpha has an MVC(Model-View-Controller) architecture and visualizes the phenomena such as object instantiations, method invocations, field accesses, cross-references among objects, and execution flows of threads in the various ways according to the levels and purposes of the users.

  • PDF

An Investigation into the Applicability of Node.js as a Platform for implementing Mobile Web Apps. (모바일 웹 어플리케이션을 구현하기 위한 Node.js 파일에 대한 조사)

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.286-289
    • /
    • 2016
  • In this paper, we propose an architecture that affords mobile app based on nomadic smartphone using not only mobile cloud computing- architecture but also a dedicated web platform called Node.js built-in with the asynchronous, Nonblocking, Event-Driven programming paradigm. Furthermore, the design of the proposed architecture takes document oriented database known as MongoDB to deal with the large amount of data transmit by users of mobile web access application. The Node.js aims to give the programmers the tools needed to solves the large number of concurrent connections problem. We demonstrate the effectiveness of the proposed architecture by implementing an android application responsible of real time analysis by using a vehicle to applications smart phones interface approach that considers the smartphones to acts as a remote users which passes driver inputs and delivers output from external applications.

  • PDF

Optimization for Concurrent Spare Part with Simulation and Multiple Regression (시뮬레이션과 다중 회귀모형을 이용한 동시조달수리부속 최적화)

  • Kim, Kyung-Rok;Yong, Hwa-Young;Kwon, Ki-Sang
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.3
    • /
    • pp.79-88
    • /
    • 2012
  • Recently, the study in efficient operation, maintenance, and equipment-design have been growing rapidly in military industry to meet the required missions. Through out these studies, the importance of Concurrent Spare Parts(CSP) are emphasized. The CSP, which is critical to the operation and maintenance to enhance the availability, is offered together when a equipment is delivered. Despite its significance, th responsibility for determining the range and depth of CSP are done from administrative decision rather than engineering analysis. The purpose of the paper is to optimize the number of CSP per item using simulation and multiple regression. First, the result, as the change of operational availability, was gained from changing the number of change in simulation model. Second, mathematical regression was computed from the input and output data, and the number of CSP was optimized by multiple regression and linear programming; the constraint condition is the cost for optimization. The advantage of this study is to respond with the transition of constraint condition quickly. The cost per item is consistently altered in the development state of equipment. The speed of analysis, that simulation method is continuously performed whenever constraint condition is repeatedly altered, would be down. Therefore, this study is suitable for real development environment. In the future, the study based on the above concept improves the accuracy of optimization by the technical progress of multiple regression.

Distributed Operation of Structural Design Process (구조 설계 프로세스의 분산운용)

  • Hwang Jin-Ha;Park Jong-Hoi;Kim Kyung-Ill
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2005.04a
    • /
    • pp.663-671
    • /
    • 2005
  • Distributed operation of overall structural design process, by which product and process optimization are implemented, is presented in this paper. The database-interconnected multilevel hybrid method, in which the conventional design method and the optimal design approach are combined, is utilized there. The method selectively takes the accustomed procedure of the conventional method in the conceptional framework of the optimal design. Design conditions are divided into primary and secondary criteria This staged application of design conditions reduces the computational burden for large complex optimization problems. Two kinds of numeric and graphic processes, are simultaneously implemented on the basis of concurrent engineering concepts in the distributed environment of PC networks. Numerical computation on server and graphic works on independent client are communicated through message passing. Numerical design is based on the optimization methodology and the drawing process is carried out by AutoCAD using the AutoLISP programming language. The prototype design experimentation for some steel trusses shows the validity and usability of the method. This study has sufficient adaptability and expandability in methodology, in that it is based on general theory and industry standard systems.

  • PDF

On-demand Allocation of Multiple Mutual-compensating Resources in Wireless Downlinks: a Multi-server Case

  • Han, Han;Xu, Yuhua;Huang, Qinfei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.921-940
    • /
    • 2015
  • In this paper, we investigate the multi-resource allocation problem, a unique feature of which is that the multiple resources can compensate each other while achieving the desired system performance. In particular, power and time allocations are jointly optimized with the target of energy efficiency under the resource-limited constraints. Different from previous studies on the power-time tradeoff, we consider a multi-server case where the concurrent serving users are quantitatively restricted. Therefore user selection is investigated accompanying the resource allocation, making the power-time tradeoff occur not only between the users in the same server but also in different servers. The complex multivariate optimization problem can be modeled as a variant of 2-Dimension Bin Packing Problem (V2D-BPP), which is a joint non-linear and integer programming problem. Though we use state decomposition model to transform it into a convex optimization problem, the variables are still coupled. Therefore, we propose an Iterative Dual Optimization (IDO) algorithm to obtain its optimal solution. Simulations show that the joint multi-resource allocation algorithm outperforms two existing non-joint algorithms from the perspective of energy efficiency.

Successive Max-min Connection-Ratio Preoblem:Routing with Fairness and Efficiency in Circuit Telecommunication Networks (연속적인 최대-최소 연결비율 문제: 회선망에서의 공정성 및 효율성을 보장하는 경로설정)

  • 박구현;우재현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.2
    • /
    • pp.13-29
    • /
    • 1997
  • This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

  • PDF

Experimental Performance Comparison of Dynamic Data Race Detection Techniques

  • Yu, Misun;Park, Seung-Min;Chun, Ingeol;Bae, Doo-Hwan
    • ETRI Journal
    • /
    • v.39 no.1
    • /
    • pp.124-134
    • /
    • 2017
  • Data races are one of the most difficult types of bugs in concurrent multithreaded systems. It requires significant time and cost to accurately detect bugs in complex large-scale programs. Although many race detection techniques have been proposed by various researchers, none of them are effective in all aspects. In this paper, we compare the performance of five recent dynamic race detection techniques: FastTrack, Acculock, Multilock-HB, SimpleLock+, and causally precedes (CP) detection. We experimentally demonstrate the strengths and weaknesses of these dynamic race detection techniques in terms of their detection capability, running time, and runtime overhead using 20 benchmark programs with different characteristics. The comparison results show that the detection capability of CP detection does not differ from that of FastTrack, and that SimpleLock+ generates the lowest overhead among the hybrid detection techniques (Acculock, SimpleLock+, and Multilock-HB) for all benchmark programs. SimpleLock+ is 1.2 times slower than FastTrack on average, but misses one true data race reported from Mutilock-HB on the large-scale benchmark programs.