Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.0860

Availability assessment of SunOS/Solaris Unix Systems based on Syslogd and wtmpx logfiles : a case study

Cristina Simache·Mohamed Kaaniche
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents a measurement-based availability assessment study using field data collected during a 4-year period from 373 SunOS/Solaris Unix workstations and servers interconnected through a local area network. We focus on the estimation of machine uptimes, downtimes and availability based on the identification of failures that caused total service loss. Data corresponds to syslogd event logs that contain a large amount of information about the normal activity of the studied systems as well as their behavior in the presence of failures. It is widely recognized that the information contained in such event logs might be incomplete or imperfect. The solution investigated in this paper to address this problem is based on the use of auxiliary sources of data obtained from wtmpx files maintained by the SunOS/Solaris Unix operating system. The results obtained suggest that the combined use of wtmpx and syslogd log files provides more complete information on the state of the target systems that is useful to provide availability estimations that better reflect reality.

Explore related subjects

cs.PF

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristina Simache, Mohamed Kaaniche. 2007-04-06. Availability assessment of SunOS/Solaris Unix Systems based on Syslogd and wtmpx logfiles : a case study. https://arxiv.org/abs/0704.0860

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Phase-Scoped Query Layouts for Reference-Constrained Speculative Decoding

Speculative verification changes the execution geometry of a quantized target model and can change its greedy output. We present phase-scoped query-to-batch (QB) attention, a graph transformation that pairs query and mask views, shares key/value storage, and retains batched projections and feed-forward computation. Phase-aware dispatch and layout-sensitive graph reuse bind the transformation to the native speculative transaction. In a six-session CUDA study, QB reduces request latency relative to explicit per-query attention (PQ) by 3.06%, 6.17% and 2.83% for Qwen3, SmolLM2 and Llama; a 72-context replay finds bitwise correspondence at QK, softmax and AV. A matched seven-arm study shows that local rather than global repair changes draft profitability for two families. A prospective transfer study then tests 36 model/input cells drawn from 21 previously unused tasks. SmolLM2 preserves the reference on its complete panel and obtains a 6.99% layout reduction; Qwen3's 3.22% estimate is noise-limited. On a 737-token Llama input, PQ and QB agree with each other but differ from the deployed reference, separating local numerical correspondence from end-to-end preservation. Vulkan state interventions and a scoped AV-preserving port identify producer-state and backend obligations. Complete-service studies further distinguish representation savings from the net value of drafting. The results establish a local execution method with measured cost benefits and distinguish its numerical, stateful and complete-cost conditions for deployment.

cs.PF↗
arXiv2026

Robust Resource Allocation for STAR-RIS-Assisted ISAC Networks Using Deep Learning

In this paper, we focus on investigating the resource allocation in an integrated sensing and communication (ISAC) system assisted by a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS). Due to the coupled non-convex nature of the optimization problem, solving the above joint resource optimization problem while guaranteeing superior sensing performance is challenging, especially in dynamic environment. To conquer such challenge, prior iterative optimization algorithms have been presented. However, practical implementations of these prior algorithms face notable computational challenges, e.g., the reliance on accurate global channel information and the assumption of ideal phase shifts. In this context, we propose a model-driven deep learning framework for jointly optimizing the transmit beamforming and waveform in ISAC networks with low-overhead. In addition, we adopt the Cramer-Rao lower bound (CRLB) as the sensing performance metric, and the multi-user interference (MUI) energy as the communication performance metric for performance evaluation. Besides, our framework jointly optimizes the transmit beamforming, waveform and the STAR-RIS reflection/transmission coefficient matrices by minimizing the weighted sum of MUI energy and CRLB. Our study also considers the impact of imperfect channel information, making the research scenario more aligned with real-world applications. Simulation results validate that the proposed framework not only achieves higher sum-rate performance comparable to traditional iterative algorithms but also significantly reduces computational complexity in terms of algorithm execution time, as well as exhibits inherent robustness.

cs.PF↗
arXiv2026

SPLIT: SymPathy for Large jobs Improves Tail latency

We study the asymptotic response time tail in the M/G/n multi-server queue with heavy-tailed (regularly varying) job sizes, a setting representative of modern computing workloads. For single-server systems, tail optimization is well understood: under heavy-tailed job sizes, policies such as SRPT that strictly prioritize short jobs are strongly tail optimal, and giving any priority to large jobs is harmful. For multi-server systems, the question has been almost entirely open. This paper gives the first strongly tail-optimal scheduling policies for the M/G/n queue with heavy-tailed job sizes. Our central finding is that the multi-server case is intrinsically different from the single-server case: giving a small amount of ``sympathy'' to large jobs is essential for strong tail optimality. We establish strong (or arbitrarily close to strong) tail optimality across the full stability region, both with and without knowledge of job sizes.

cs.PF↗