IDEAS home Printed from https://ideas.repec.org/a/igg/japuc0/v6y2014i3p15-34.html
   My bibliography  Save this article

Distributed HPC UFS ACM Optimizing the Risk for All the Time on Every Time

Author

Listed:
  • Prashant Kumar Patra

    (Department of Computer Science and Engineering, Biju Patnaik University of Technology (BPUT), Bhubaneswar, Odisha, India)

  • Padma Lochan Pradhan

    (Department of Computer Science and Engineering, Central Institute of Technology, Naya Raipur, Chhattisgarh, India)

Abstract

The access control mechanism is one of the well advance controls for all the time on every time on recent pervasive computing for protection of data and services from the hacker, thefts and unauthorized users. This paper contributes to the development of an optimization model that aims to determine the optimal cost to be implementing into DOOS security mechanisms on the measure component of UFS attribute. Our objective should be design in such way, that the Read, Write & Execute automatically protect to our web services on DOOS. We have to make high simplification, unification and step by step normalization by implementing UFS ACM mechanism based on distributed object oriented system on N dimensional hypercube model. Finally, we have to maximize the qualities of services & minimize the cost and time of the Business, Resources and Technology. The subject and object can able communicate through read, write and execute over a UFS on N Dimensional HPC. We have to apply these ACM utilities over a anti-fragile technology to make robust and high secure for all the time. Our objective will be resolve the unstable, uncertainty, un-order, un safe and unset up (U^4) problems of complex technology on right time and right place for all the time in around the globe to take care of accountabilities, action abilities and manage abilities. Meanwhile, it will be more accountable for performance, fault tolerance, throughput, bench marking and risk optimization on any web services for all the time.

Suggested Citation

  • Prashant Kumar Patra & Padma Lochan Pradhan, 2014. "Distributed HPC UFS ACM Optimizing the Risk for All the Time on Every Time," International Journal of Advanced Pervasive and Ubiquitous Computing (IJAPUC), IGI Global, vol. 6(3), pages 15-34, July.
  • Handle: RePEc:igg:japuc0:v:6:y:2014:i:3:p:15-34
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijapuc.2014070102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:japuc0:v:6:y:2014:i:3:p:15-34. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.