The Experts below are selected from a list of 7692 Experts worldwide ranked by ideXlab platform

John Patzakis - One of the best experts on this subject based on the ideXlab platform.

  • new accounting reform laws push for technology based Document Retention practices
    International Journal of Digital Evidence, 2003
    Co-Authors: John Patzakis
    Abstract:

    The Sarbanes-Oxley Act of 2002, which President Bush signed into law last year, represents an ambitious effort by Congress to address many data Retention and preservation issues arising from the Enron and Arthur Andersen debacles. In addition to creating a new and apparently powerful Public Company Accounting Oversight Board (“Oversight Board”) and addressing corporate responsibility issues, the new law also mandates Retention of electronic Documents, imposes strict criminal penalties for altering or destroying records, including those kept in electronic form, and mandates production of electronic records and other Documents when summoned by the new Oversight Board.

Alex Zhang - One of the best experts on this subject based on the ideXlab platform.

  • DP+IP = Design of Efficient Backup Scheduling
    2015
    Co-Authors: Ludmila Cherkasova, Alex Zhang
    Abstract:

    Data Protector, backup management, job scheduling, integer programming, performance evaluation, automated parameter tuning Many industries experience an explosion in digital content. This explosion of electronic Documents, along with new regulations and Document Retention rules, sets new requirements for performance efficiency of traditional data protection and archival tools. During a backup session a predefined set of objects (client filesystems) should be backed up. Traditionally, no information on the expected duration and throughput requirements of different backup jobs is provided. This may lead to a suboptimal job schedule that results in the increased backup session time. In this work, we characterize each backup job via two metrics, called job duration and job throughput. These metrics are derived from collected historic information about backup jobs during previous backup sessions. Our goal is to automate the design of a backup schedule that minimizes the overall completion time for a given set of backup jobs. This problem can be formulated as a resource constrained scheduling problem where a set of n jobs should be scheduled on m machines with given capacities. We provide an integer programming (IP) formulation of this problem and use available IP-solvers for finding an optimized schedule, called binpacking schedule. Performance benefits of the new bin-packing schedule are evaluated via a broad variety of realistic experiments using backup processin

  • DP+IP = Design of Efficient Backup Scheduling
    2013
    Co-Authors: Ludmila Cherkasova, Alex Zhang
    Abstract:

    Abstract—Many industries experience an explosion in digital content. This explosion of electronic Documents, along with new regulations and Document Retention rules, sets new requirements for performance efficiency of traditional data protection and archival tools. During a backup session a predefined set of objects (client filesystems) should be backed up. Traditionally, no information on the expected duration and throughput requirements of different backup jobs is provided. This may lead to a suboptimal job schedule that results in the increased backup session time. In thiswork,wecharacterizeeachbackupjobviatwometrics,called job duration and job throughput. These metrics are derived from collected historic information about backup jobs during previous backup sessions. Our goal is to automate the design of a backup schedule that minimizes the overall completion time for a given set of backup jobs. This problem can be formulated as a resource constrained scheduling problem where a set of n jobs should be scheduled on m machines with given capacities. We provide an integer programming (IP) formulation of this problem and use available IP-solvers for finding an optimized schedule, called binpacking schedule. Performance benefits of the new bin-packing scheduleareevaluatedviaabroadvarietyofrealisticexperiments using backup processing data from six backup servers in HP Labs. The new bin-packing job schedule significantly optimizes the backup session time (20%-60 % of backup time reduction). HP Data Protector (DP) is HP’s enterprise backup offering and it can directly benefit from the designed technique. Moreover, significantlyreducedbackupsessiontimesguaranteeanimproved resource/power usage of the overall backup solution. I

Ludmila Cherkasova - One of the best experts on this subject based on the ideXlab platform.

  • DP+IP = Design of Efficient Backup Scheduling
    2015
    Co-Authors: Ludmila Cherkasova, Alex Zhang
    Abstract:

    Data Protector, backup management, job scheduling, integer programming, performance evaluation, automated parameter tuning Many industries experience an explosion in digital content. This explosion of electronic Documents, along with new regulations and Document Retention rules, sets new requirements for performance efficiency of traditional data protection and archival tools. During a backup session a predefined set of objects (client filesystems) should be backed up. Traditionally, no information on the expected duration and throughput requirements of different backup jobs is provided. This may lead to a suboptimal job schedule that results in the increased backup session time. In this work, we characterize each backup job via two metrics, called job duration and job throughput. These metrics are derived from collected historic information about backup jobs during previous backup sessions. Our goal is to automate the design of a backup schedule that minimizes the overall completion time for a given set of backup jobs. This problem can be formulated as a resource constrained scheduling problem where a set of n jobs should be scheduled on m machines with given capacities. We provide an integer programming (IP) formulation of this problem and use available IP-solvers for finding an optimized schedule, called binpacking schedule. Performance benefits of the new bin-packing schedule are evaluated via a broad variety of realistic experiments using backup processin

  • DP+IP = Design of Efficient Backup Scheduling
    2013
    Co-Authors: Ludmila Cherkasova, Alex Zhang
    Abstract:

    Abstract—Many industries experience an explosion in digital content. This explosion of electronic Documents, along with new regulations and Document Retention rules, sets new requirements for performance efficiency of traditional data protection and archival tools. During a backup session a predefined set of objects (client filesystems) should be backed up. Traditionally, no information on the expected duration and throughput requirements of different backup jobs is provided. This may lead to a suboptimal job schedule that results in the increased backup session time. In thiswork,wecharacterizeeachbackupjobviatwometrics,called job duration and job throughput. These metrics are derived from collected historic information about backup jobs during previous backup sessions. Our goal is to automate the design of a backup schedule that minimizes the overall completion time for a given set of backup jobs. This problem can be formulated as a resource constrained scheduling problem where a set of n jobs should be scheduled on m machines with given capacities. We provide an integer programming (IP) formulation of this problem and use available IP-solvers for finding an optimized schedule, called binpacking schedule. Performance benefits of the new bin-packing scheduleareevaluatedviaabroadvarietyofrealisticexperiments using backup processing data from six backup servers in HP Labs. The new bin-packing job schedule significantly optimizes the backup session time (20%-60 % of backup time reduction). HP Data Protector (DP) is HP’s enterprise backup offering and it can directly benefit from the designed technique. Moreover, significantlyreducedbackupsessiontimesguaranteeanimproved resource/power usage of the overall backup solution. I

John A Martin - One of the best experts on this subject based on the ideXlab platform.

Muthuvenkkataraman Muthu Mathavan - One of the best experts on this subject based on the ideXlab platform.

  • dropped calls turnaround time and Document Retention time crucial parameters to monitor the effective implementation of laboratory critical alert policy for critically ill patients
    The Journal of National Accreditation Board for Hospitals & Healthcare Providers, 2015
    Co-Authors: Manminder Singh, Vibha Gupta, Piyali M Mathavan, Harish Chandra, Dushyant Singh Gaur, Muthuvenkkataraman Muthu Mathavan
    Abstract:

    Context: Critical alert policy adopted under laboratory accreditation guidelines [1] and under the National Patient Safety Goals (NPSGs) has prioritized safe and timely communication of critical alert [2] so that immediate treatment can be done as soon as the sample showing critical value is communicated by the laboratory. Laboratories are burdened with the analysis of samples not only from emergency and intensive care units but also from outdoor and wards; require to frame a policy, which meets the need of the critical patients. Most of the studies conducted to analyze the effective implementation of the critical alert policy look at the tip of iceberg as the percentage of critical alerts reported by laboratory and the turn- around time. Aim: The present study was conducted to analyze the various components of critical alert policy framed by the laboratory under study. Setting and Design: Study was conducted at a tertiary care hospital in a NABL accreditation of laboratory running since 3 years. We assessed not only the policy and procedure Documented and followed by the laboratory under study as laid down under the guidelines [1],[2] but also certain issue (Dropped calls), which are encountered during implementation of the critical alert policy and procedure. Statistical Analysis: Study was a retrospective, cross-sectional. Results: The outcome of the study highlighted the hidden component of the iceberg causing obstacle in implementation of the critical alert policy as increased dropped calls, the turnaround time of which till the writing of the manuscript was infinite. Moreover, short storage time of the Document maintained by a laboratory as evidence of communication of critical alert to the caretaker by the hospital-based laboratory leaves the hospital with no evidence if required later on. Conclusions: Detecting and correcting hidden components of critical alert policy can lead to immediate attention and treatment of critical patients and prevent mortality and mortality on one hand and on the other hand the hospital that implements this system can be prevented from the burden of medico legal cases to an extent.