Timing wheels
•Download as PPT, PDF•
2 likes•3,163 views
The document discusses different algorithms for efficiently managing timers in computer systems. It presents hashed and hierarchical timing wheel algorithms as improvements over traditional approaches. Hashed timing wheels improve performance by hashing timer intervals to "buckets" in a virtual wheel structure to reduce lookup costs. Hierarchical timing wheels organize timers at multiple levels of granularity from hours to seconds to further improve efficiency. The paper analyzes the time and space complexity of starting, stopping, and processing timers for each approach.
Report
Share
Report
Share
![Motivation ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Sctp tutorial
This document provides an overview of a training course on the Stream Control Transmission Protocol (SCTP). The objectives are to understand the technical details and operation of SCTP, know where to find relevant specification documents, understand the SCTP application programming interface, and be aware of ongoing extensions to SCTP. The course covers SCTP concepts like endpoints, associations, multi-homing, and the state machine. Reference materials and online resources are also listed.
ClickHouse Intro
Introduction to ClickHouse - an open-source column oriented database management system that allows generating analytical data reports in real time
Netflix: From Clouds to Roots
Surge 2014: From Clouds to Roots: root cause performance analysis at Netflix. Brendan Gregg.
At Netflix, high scale and fast deployment rule. The possibilities for failure are endless, and the environment excels at handling this, regularly tested and exercised by the simian army. But, when this environment automatically works around systemic issues that aren’t root-caused, they can grow over time. This talk describes the challenge of not just handling failures of scale on the Netflix cloud, but also new approaches and tools for quickly diagnosing their root cause in an ever changing environment.
Analytics at Speed: Introduction to ClickHouse and Common Use Cases. By Mikha...
ClickHouse is a powerful open source analytics database that provides fast, scalable performance for data warehousing and real-time analytics use cases. It can handle petabytes of data and queries and scales linearly on commodity hardware. ClickHouse is faster than other databases for analytical workloads due to its columnar data storage and parallel processing. It supports SQL and integrates with various data sources. ClickHouse can run on-premises, in the cloud, or in containers. The ClickHouse operator makes it easy to deploy and manage ClickHouse clusters on Kubernetes.
ClickHouse in Real Life. Case Studies and Best Practices, by Alexander Zaitsev
ClickHouse in Real Life. Case Studies and Best Practices.
By Alexander Zaitsev, Altinity/Lifestreet
Presented at Percona Live 2018
How NOT to Write a Microbenchmark
Microbenchmarks can provide targeted insights but require careful construction to avoid misleading results. The document discusses a microbenchmark that claimed to measure the overhead of assertions but actually uncovered an on-stack replacement bug in the JVM. It emphasizes the need for microbenchmarks to have constant work per iteration, reach steady-state performance, avoid dead code loops, and account for garbage collection and JIT warmup effects. Done correctly, microbenchmarks can answer narrow questions about performance, but many popular examples produce unreliable results due to hidden variables.
Building day 2 upload Building the Internet of Things with Thingsquare and ...
The third slide set from the second day of the Thingsquare IoT Contiki course. http://thingsquare.com/training/
ClickHouse materialized views - a secret weapon for high performance analytic...
ClickHouse materialized views allow you to precompute aggregates and transform data to improve query performance. Materialized views can store precomputed aggregates from a source table to speed up aggregation queries over 100x. They can also retrieve the last data point for each item over 100x faster than scanning the raw data table. Materialized views provide a way to optimize data storage layout and indexing to improve query efficiency.
Recommended
Sctp tutorial
This document provides an overview of a training course on the Stream Control Transmission Protocol (SCTP). The objectives are to understand the technical details and operation of SCTP, know where to find relevant specification documents, understand the SCTP application programming interface, and be aware of ongoing extensions to SCTP. The course covers SCTP concepts like endpoints, associations, multi-homing, and the state machine. Reference materials and online resources are also listed.
ClickHouse Intro
Introduction to ClickHouse - an open-source column oriented database management system that allows generating analytical data reports in real time
Netflix: From Clouds to Roots
Surge 2014: From Clouds to Roots: root cause performance analysis at Netflix. Brendan Gregg.
At Netflix, high scale and fast deployment rule. The possibilities for failure are endless, and the environment excels at handling this, regularly tested and exercised by the simian army. But, when this environment automatically works around systemic issues that aren’t root-caused, they can grow over time. This talk describes the challenge of not just handling failures of scale on the Netflix cloud, but also new approaches and tools for quickly diagnosing their root cause in an ever changing environment.
Analytics at Speed: Introduction to ClickHouse and Common Use Cases. By Mikha...
ClickHouse is a powerful open source analytics database that provides fast, scalable performance for data warehousing and real-time analytics use cases. It can handle petabytes of data and queries and scales linearly on commodity hardware. ClickHouse is faster than other databases for analytical workloads due to its columnar data storage and parallel processing. It supports SQL and integrates with various data sources. ClickHouse can run on-premises, in the cloud, or in containers. The ClickHouse operator makes it easy to deploy and manage ClickHouse clusters on Kubernetes.
ClickHouse in Real Life. Case Studies and Best Practices, by Alexander Zaitsev
ClickHouse in Real Life. Case Studies and Best Practices.
By Alexander Zaitsev, Altinity/Lifestreet
Presented at Percona Live 2018
How NOT to Write a Microbenchmark
Microbenchmarks can provide targeted insights but require careful construction to avoid misleading results. The document discusses a microbenchmark that claimed to measure the overhead of assertions but actually uncovered an on-stack replacement bug in the JVM. It emphasizes the need for microbenchmarks to have constant work per iteration, reach steady-state performance, avoid dead code loops, and account for garbage collection and JIT warmup effects. Done correctly, microbenchmarks can answer narrow questions about performance, but many popular examples produce unreliable results due to hidden variables.
Building day 2 upload Building the Internet of Things with Thingsquare and ...
The third slide set from the second day of the Thingsquare IoT Contiki course. http://thingsquare.com/training/
ClickHouse materialized views - a secret weapon for high performance analytic...
ClickHouse materialized views allow you to precompute aggregates and transform data to improve query performance. Materialized views can store precomputed aggregates from a source table to speed up aggregation queries over 100x. They can also retrieve the last data point for each item over 100x faster than scanning the raw data table. Materialized views provide a way to optimize data storage layout and indexing to improve query efficiency.
Tricks every ClickHouse designer should know, by Robert Hodges, Altinity CEO
"Tricks every ClickHouse designer should know" by Robert Hodges, Altinity CEO
Presented at Meetup in Mountain View, August 13, 2019
Parallel searching
This document discusses four parallel searching algorithms: Alpha-Beta search, Jamboree search, Depth-First search, and PVS search. Alpha-Beta search prunes unpromising branches without missing better moves. Jamboree search parallelizes the testing of child nodes. Depth-First search recursively explores branches until reaching a dead end, then backtracks. PVS search splits the search tree across processors, backing up values in parallel at each level. However, load imbalance can occur if some branches are much larger than others.
Jvm performance tuning
This document discusses monitoring and tuning Java applications for performance. It covers monitoring garbage collection and threads in the Java Virtual Machine, method profiling to identify slow execution paths, object creation profiling, monitoring gross memory usage, and thread profiling. It also summarizes the key aspects of monitoring Java applications and JVM.
Flink Forward Berlin 2018: Nico Kruber - "Improving throughput and latency wi...
Flink's network stack is designed with two goals in mind: (a) having low latency for data passing through, and (b) achieving an optimal throughput. It already achieves a good trade-off between these two but we will continue to tune it further for an optimal one. Flink 1.5 did not only further reduce overhead inside the network stack, but also introduced some groundbreaking changes in the stack itself, introducing an own (credit-based) flow control mechanism and a general change towards a more network-event-driven pull approach. With our own flow control, we steer what data is sent on the wire and make sure that the receiver has capacity to handle it. If there is no capacity, we will backpressure earlier and allow checkpoint barriers to pass through more quickly which improves checkpoint alignment and overall checkpoint speed.
In this talk, we will describe in detail how the network stack works with respect to (de)serialization, memory management and buffer pools, the different actor threads involved, configuration, as well as the design to improve throughput and latency trade-offs in the network and processing pipelines. We will go into detail on what is happening during checkpoint alignments and how credit-based flow control improves them. Additionally, we will present common pitfalls as well as debugging techniques to find network-related issues in your Flink jobs.
Chapter 11 - Sorting and Searching
The document discusses various searching and sorting algorithms. It describes linear search, binary search, selection sort, bubble sort, and heapsort. For each algorithm, it provides pseudocode examples and analyzes their performance in terms of number of comparisons required in the worst case. Linear search requires N comparisons in the worst case, while binary search requires log N comparisons. Selection sort and bubble sort both require approximately N^2 comparisons, while heapsort requires 1.5NlogN comparisons.
Apache Flink Training: System Overview
This document provides an overview of Apache Flink, an open-source stream processing framework. It discusses Flink's capabilities in supporting streaming, batch, and iterative processing natively through a streaming dataflow model. It also describes Flink's architecture including the client, job manager, task managers, and various execution setups like local, remote, YARN, and embedded. Finally, it compares Flink to other stream and batch processing systems in terms of their APIs, fault tolerance guarantees, and strengths.
2021 Dask Summit - Using STAC to catalog SpatioTemporal datasets
The document discusses using the SpatioTemporal Asset Catalog (STAC) to catalog geospatial datasets. STAC defines JSON schemas to encode metadata about spatiotemporal data like remote sensing imagery. This allows datasets like the European Space Agency's Sentinel-2 satellite data, containing petabytes of images, to be more easily searched. The STAC API also defines standards for searching and discovering STAC metadata. Tools like PySTAC and pystac-client make it easier to work with STAC catalogs and APIs in Python. Open questions remain around best representing multi-dimensional datasets like Zarr in STAC.
LISA2019 Linux Systems Performance
Talk by Brendan Gregg for USENIX LISA 2019: Linux Systems Performance. Abstract: "
Systems performance is an effective discipline for performance analysis and tuning, and can help you find performance wins for your applications and the kernel. However, most of us are not performance or kernel engineers, and have limited time to study this topic. This talk summarizes the topic for everyone, touring six important areas of Linux systems performance: observability tools, methodologies, benchmarking, profiling, tracing, and tuning. Included are recipes for Linux performance analysis and tuning (using vmstat, mpstat, iostat, etc), overviews of complex areas including profiling (perf_events) and tracing (Ftrace, bcc/BPF, and bpftrace/BPF), and much advice about what is and isn't important to learn. This talk is aimed at everyone: developers, operations, sysadmins, etc, and in any environment running Linux, bare metal or the cloud."
SIP-to-SIP Connections on a Cisco Unified Border Element
The document describes how to configure SIP-to-SIP connections on a Cisco Unified Border Element (Cisco UBE). It covers prerequisites, restrictions, and configurations for features such as SIP-to-SIP basic functionality, extended features, supplementary services, IP address hiding, Delayed-Offer to Early-Offer calls, error message passing, and more. The key configurations include enabling SIP-to-SIP connections, address hiding, Delayed-Offer support, and error message passing between the SIP legs.
Stop the Guessing: Performance Methodologies for Production Systems
Talk presented at Velocity 2013. Description: When faced with performance issues on complex production systems and distributed cloud environments, it can be difficult to know where to begin your analysis, or to spend much time on it when it isn’t your day job. This talk covers various methodologies, and anti-methodologies, for systems analysis, which serve as guidance for finding fruitful metrics from your current performance monitoring products. Such methodologies can help check all areas in an efficient manner, and find issues that can be easily overlooked, especially for virtualized environments which impose resource controls. Some of the tools and methodologies covered, including the USE Method, were developed by the speaker and have been used successfully in enterprise and cloud environments.
Hive join optimizations
February 2015 Hive User Group meetup at LinkedIn
http://www.meetup.com/Hive-User-Group-Meeting/events/219794523/
Presentation about physical join strategies employed used by Apache Hive and how they may be employed to optimize workflows.
ClickHouse Mark Cache, by Mik Kocikowski, Cloudflare
The document summarizes how ClickHouse stores and retrieves data from MergeTree tables. It discusses how data is stored in parts organized by primary key, with each column's data and marks stored in separate files. It describes how the primary index and mark cache are used to efficiently find and read data, and how mark cache performance impacts SELECT queries. It provides examples of calculating mark sizes and dropping the mark cache.
Recursion and Sorting Algorithms
These slides are part of a full series of slides which covers almost all the basic concepts of data structures and algorithms.
Part 3
Spark SQL Bucketing at Facebook
Bucketing is a popular data partitioning technique to pre-shuffle and (optionally) pre-sort data during writes. This is ideal for a variety of write-once and read-many datasets at Facebook, where Spark can automatically avoid expensive shuffles/sorts (when the underlying data is joined/aggregated on its bucketed keys) resulting in substantial savings in both CPU and IO.
Over the last year, we’ve added a series of optimizations in Apache Spark as a means towards achieving feature parity with Hive and Spark. These include avoiding shuffle/sort when joining/aggregating/inserting on tables with mismatching buckets, allowing user to skip shuffle/sort when writing to bucketed tables, adding data validators before writing bucketed data, among many others. As a direct consequence of these efforts, we’ve witnessed over 10x growth (spanning 40% of total compute) in queries that read one or more bucketed tables across the entire data warehouse at Facebook.
In this talk, we’ll take a deep dive into the internals of bucketing support in SparkSQL, describe use-cases where bucketing is useful, touch upon some of the on-going work to automatically suggest bucketing tables based on query column lineage, and summarize the lessons learned from developing bucketing support in Spark at Facebook over the last 2 years
VictoriaLogs: Open Source Log Management System - Preview
VictoriaLogs Preview - Aliaksandr Valialkin
* Existing open source log management systems
- ELK (ElasticSearch) stack: Pros & Cons
- Grafana Loki: Pros & Cons
* What is VictoriaLogs
- Open source log management system from VictoriaMetrics
- Easy to setup and operate
- Scales vertically and horizontally
- Optimized for low resource usage (CPU, RAM, disk space)
- Accepts data from Logstash and Fluentbit in Elasticsearch format
- Accepts data from Promtail in Loki format
- Supports stream concept from Loki
- Provides easy to use yet powerful query language - LogsQL
* LogsQL Examples
- Search by time
- Full-text search
- Combining search queries
- Searching arbitrary labels
* Log Streams
- What is a log stream?
- LogsQL examples: querying log streams
- Stream labels vs log labels
* LogsQL: stats over access logs
* VictoriaLogs: CLI Integration
* VictoriaLogs Recap
Apache Beam and Google Cloud Dataflow - IDG - final
Google Cloud Dataflow is a next generation managed big data service based on the Apache Beam programming model. It provides a unified model for batch and streaming data processing, with an optimized execution engine that automatically scales based on workload. Customers report being able to build complex data pipelines more quickly using Cloud Dataflow compared to other technologies like Spark, and with improved performance and reduced operational overhead.
Introduction to the Mysteries of ClickHouse Replication, By Robert Hodges and...
Presented at the webinar, July 31, 2019
Built-in replication is a powerful ClickHouse feature that helps scale data warehouse performance as well as ensure high availability. This webinar will introduce how replication works internally, explain configuration of clusters with replicas, and show you how to set up and manage ZooKeeper, which is necessary for replication to function. We'll finish off by showing useful replication tricks, such as utilizing replication to migrate data between hosts. Join us to become an expert in this important subject!
Row Pattern Matching in Oracle Database 12c
The document discusses various techniques for pattern matching and grouping rows in databases before and after the introduction of MATCH_RECOGNIZE in Oracle 12c. It compares 4 techniques used in pre-12c databases to group and analyze row patterns against using MATCH_RECOGNIZE. For each technique, it provides an example, shows the pre-12c implementation, and demonstrates how MATCH_RECOGNIZE provides a simpler single solution that is more efficient and scalable.
Webinar: Secrets of ClickHouse Query Performance, by Robert Hodges
From webinars September 11 and September 17, 2019
ClickHouse is famous for speed. That said, you can almost always make it faster! This webinar uses examples to teach you how to deduce what queries are actually doing by reading the system log and system tables. We'll then explore standard ways to increase query speed: data types and encodings, filtering, join reordering, skip indexes, materialized views, session parameters, to name just a few. In each case we'll circle back to query plans and system metrics to demonstrate changes in ClickHouse behavior that explain the boost in performance. We hope you'll enjoy the first step to becoming a ClickHouse performance guru!
Speaker Bio:
Robert Hodges is CEO of Altinity, which offers enterprise support for ClickHouse. He has over three decades of experience in data management spanning 20 different DBMS types. ClickHouse is his current favorite. ;)
Ixgbe internals
This document discusses the internals of the ixgbe driver, which is the Intel 10 Gigabit Ethernet driver for Linux. It describes how the driver handles transmission and reception of packets using ring buffers and NAPI. It also discusses how the driver supports eXpress Data Path (XDP) by using a separate ring for XDP packets and adjusting page reference counts to support XDP operations like redirection. Upcoming features that will improve XDP support for this driver are also mentioned.
AnáLisis De Algoritmos1
Este documento define algoritmo, sus características y razones para estudiarlos. Explica conceptos clave como eficiencia, complejidad y órdenes de complejidad para medir el rendimiento de algoritmos. Describe diferentes tipos de análisis como peor caso, mejor caso y promedio para estimar el tiempo de ejecución en función del tamaño de los datos.
More Related Content
What's hot
Tricks every ClickHouse designer should know, by Robert Hodges, Altinity CEO
"Tricks every ClickHouse designer should know" by Robert Hodges, Altinity CEO
Presented at Meetup in Mountain View, August 13, 2019
Parallel searching
This document discusses four parallel searching algorithms: Alpha-Beta search, Jamboree search, Depth-First search, and PVS search. Alpha-Beta search prunes unpromising branches without missing better moves. Jamboree search parallelizes the testing of child nodes. Depth-First search recursively explores branches until reaching a dead end, then backtracks. PVS search splits the search tree across processors, backing up values in parallel at each level. However, load imbalance can occur if some branches are much larger than others.
Jvm performance tuning
This document discusses monitoring and tuning Java applications for performance. It covers monitoring garbage collection and threads in the Java Virtual Machine, method profiling to identify slow execution paths, object creation profiling, monitoring gross memory usage, and thread profiling. It also summarizes the key aspects of monitoring Java applications and JVM.
Flink Forward Berlin 2018: Nico Kruber - "Improving throughput and latency wi...
Flink's network stack is designed with two goals in mind: (a) having low latency for data passing through, and (b) achieving an optimal throughput. It already achieves a good trade-off between these two but we will continue to tune it further for an optimal one. Flink 1.5 did not only further reduce overhead inside the network stack, but also introduced some groundbreaking changes in the stack itself, introducing an own (credit-based) flow control mechanism and a general change towards a more network-event-driven pull approach. With our own flow control, we steer what data is sent on the wire and make sure that the receiver has capacity to handle it. If there is no capacity, we will backpressure earlier and allow checkpoint barriers to pass through more quickly which improves checkpoint alignment and overall checkpoint speed.
In this talk, we will describe in detail how the network stack works with respect to (de)serialization, memory management and buffer pools, the different actor threads involved, configuration, as well as the design to improve throughput and latency trade-offs in the network and processing pipelines. We will go into detail on what is happening during checkpoint alignments and how credit-based flow control improves them. Additionally, we will present common pitfalls as well as debugging techniques to find network-related issues in your Flink jobs.
Chapter 11 - Sorting and Searching
The document discusses various searching and sorting algorithms. It describes linear search, binary search, selection sort, bubble sort, and heapsort. For each algorithm, it provides pseudocode examples and analyzes their performance in terms of number of comparisons required in the worst case. Linear search requires N comparisons in the worst case, while binary search requires log N comparisons. Selection sort and bubble sort both require approximately N^2 comparisons, while heapsort requires 1.5NlogN comparisons.
Apache Flink Training: System Overview
This document provides an overview of Apache Flink, an open-source stream processing framework. It discusses Flink's capabilities in supporting streaming, batch, and iterative processing natively through a streaming dataflow model. It also describes Flink's architecture including the client, job manager, task managers, and various execution setups like local, remote, YARN, and embedded. Finally, it compares Flink to other stream and batch processing systems in terms of their APIs, fault tolerance guarantees, and strengths.
2021 Dask Summit - Using STAC to catalog SpatioTemporal datasets
The document discusses using the SpatioTemporal Asset Catalog (STAC) to catalog geospatial datasets. STAC defines JSON schemas to encode metadata about spatiotemporal data like remote sensing imagery. This allows datasets like the European Space Agency's Sentinel-2 satellite data, containing petabytes of images, to be more easily searched. The STAC API also defines standards for searching and discovering STAC metadata. Tools like PySTAC and pystac-client make it easier to work with STAC catalogs and APIs in Python. Open questions remain around best representing multi-dimensional datasets like Zarr in STAC.
LISA2019 Linux Systems Performance
Talk by Brendan Gregg for USENIX LISA 2019: Linux Systems Performance. Abstract: "
Systems performance is an effective discipline for performance analysis and tuning, and can help you find performance wins for your applications and the kernel. However, most of us are not performance or kernel engineers, and have limited time to study this topic. This talk summarizes the topic for everyone, touring six important areas of Linux systems performance: observability tools, methodologies, benchmarking, profiling, tracing, and tuning. Included are recipes for Linux performance analysis and tuning (using vmstat, mpstat, iostat, etc), overviews of complex areas including profiling (perf_events) and tracing (Ftrace, bcc/BPF, and bpftrace/BPF), and much advice about what is and isn't important to learn. This talk is aimed at everyone: developers, operations, sysadmins, etc, and in any environment running Linux, bare metal or the cloud."
SIP-to-SIP Connections on a Cisco Unified Border Element
The document describes how to configure SIP-to-SIP connections on a Cisco Unified Border Element (Cisco UBE). It covers prerequisites, restrictions, and configurations for features such as SIP-to-SIP basic functionality, extended features, supplementary services, IP address hiding, Delayed-Offer to Early-Offer calls, error message passing, and more. The key configurations include enabling SIP-to-SIP connections, address hiding, Delayed-Offer support, and error message passing between the SIP legs.
Stop the Guessing: Performance Methodologies for Production Systems
Talk presented at Velocity 2013. Description: When faced with performance issues on complex production systems and distributed cloud environments, it can be difficult to know where to begin your analysis, or to spend much time on it when it isn’t your day job. This talk covers various methodologies, and anti-methodologies, for systems analysis, which serve as guidance for finding fruitful metrics from your current performance monitoring products. Such methodologies can help check all areas in an efficient manner, and find issues that can be easily overlooked, especially for virtualized environments which impose resource controls. Some of the tools and methodologies covered, including the USE Method, were developed by the speaker and have been used successfully in enterprise and cloud environments.
Hive join optimizations
February 2015 Hive User Group meetup at LinkedIn
http://www.meetup.com/Hive-User-Group-Meeting/events/219794523/
Presentation about physical join strategies employed used by Apache Hive and how they may be employed to optimize workflows.
ClickHouse Mark Cache, by Mik Kocikowski, Cloudflare
The document summarizes how ClickHouse stores and retrieves data from MergeTree tables. It discusses how data is stored in parts organized by primary key, with each column's data and marks stored in separate files. It describes how the primary index and mark cache are used to efficiently find and read data, and how mark cache performance impacts SELECT queries. It provides examples of calculating mark sizes and dropping the mark cache.
Recursion and Sorting Algorithms
These slides are part of a full series of slides which covers almost all the basic concepts of data structures and algorithms.
Part 3
Spark SQL Bucketing at Facebook
Bucketing is a popular data partitioning technique to pre-shuffle and (optionally) pre-sort data during writes. This is ideal for a variety of write-once and read-many datasets at Facebook, where Spark can automatically avoid expensive shuffles/sorts (when the underlying data is joined/aggregated on its bucketed keys) resulting in substantial savings in both CPU and IO.
Over the last year, we’ve added a series of optimizations in Apache Spark as a means towards achieving feature parity with Hive and Spark. These include avoiding shuffle/sort when joining/aggregating/inserting on tables with mismatching buckets, allowing user to skip shuffle/sort when writing to bucketed tables, adding data validators before writing bucketed data, among many others. As a direct consequence of these efforts, we’ve witnessed over 10x growth (spanning 40% of total compute) in queries that read one or more bucketed tables across the entire data warehouse at Facebook.
In this talk, we’ll take a deep dive into the internals of bucketing support in SparkSQL, describe use-cases where bucketing is useful, touch upon some of the on-going work to automatically suggest bucketing tables based on query column lineage, and summarize the lessons learned from developing bucketing support in Spark at Facebook over the last 2 years
VictoriaLogs: Open Source Log Management System - Preview
VictoriaLogs Preview - Aliaksandr Valialkin
* Existing open source log management systems
- ELK (ElasticSearch) stack: Pros & Cons
- Grafana Loki: Pros & Cons
* What is VictoriaLogs
- Open source log management system from VictoriaMetrics
- Easy to setup and operate
- Scales vertically and horizontally
- Optimized for low resource usage (CPU, RAM, disk space)
- Accepts data from Logstash and Fluentbit in Elasticsearch format
- Accepts data from Promtail in Loki format
- Supports stream concept from Loki
- Provides easy to use yet powerful query language - LogsQL
* LogsQL Examples
- Search by time
- Full-text search
- Combining search queries
- Searching arbitrary labels
* Log Streams
- What is a log stream?
- LogsQL examples: querying log streams
- Stream labels vs log labels
* LogsQL: stats over access logs
* VictoriaLogs: CLI Integration
* VictoriaLogs Recap
Apache Beam and Google Cloud Dataflow - IDG - final
Google Cloud Dataflow is a next generation managed big data service based on the Apache Beam programming model. It provides a unified model for batch and streaming data processing, with an optimized execution engine that automatically scales based on workload. Customers report being able to build complex data pipelines more quickly using Cloud Dataflow compared to other technologies like Spark, and with improved performance and reduced operational overhead.
Introduction to the Mysteries of ClickHouse Replication, By Robert Hodges and...
Presented at the webinar, July 31, 2019
Built-in replication is a powerful ClickHouse feature that helps scale data warehouse performance as well as ensure high availability. This webinar will introduce how replication works internally, explain configuration of clusters with replicas, and show you how to set up and manage ZooKeeper, which is necessary for replication to function. We'll finish off by showing useful replication tricks, such as utilizing replication to migrate data between hosts. Join us to become an expert in this important subject!
Row Pattern Matching in Oracle Database 12c
The document discusses various techniques for pattern matching and grouping rows in databases before and after the introduction of MATCH_RECOGNIZE in Oracle 12c. It compares 4 techniques used in pre-12c databases to group and analyze row patterns against using MATCH_RECOGNIZE. For each technique, it provides an example, shows the pre-12c implementation, and demonstrates how MATCH_RECOGNIZE provides a simpler single solution that is more efficient and scalable.
Webinar: Secrets of ClickHouse Query Performance, by Robert Hodges
From webinars September 11 and September 17, 2019
ClickHouse is famous for speed. That said, you can almost always make it faster! This webinar uses examples to teach you how to deduce what queries are actually doing by reading the system log and system tables. We'll then explore standard ways to increase query speed: data types and encodings, filtering, join reordering, skip indexes, materialized views, session parameters, to name just a few. In each case we'll circle back to query plans and system metrics to demonstrate changes in ClickHouse behavior that explain the boost in performance. We hope you'll enjoy the first step to becoming a ClickHouse performance guru!
Speaker Bio:
Robert Hodges is CEO of Altinity, which offers enterprise support for ClickHouse. He has over three decades of experience in data management spanning 20 different DBMS types. ClickHouse is his current favorite. ;)
Ixgbe internals
This document discusses the internals of the ixgbe driver, which is the Intel 10 Gigabit Ethernet driver for Linux. It describes how the driver handles transmission and reception of packets using ring buffers and NAPI. It also discusses how the driver supports eXpress Data Path (XDP) by using a separate ring for XDP packets and adjusting page reference counts to support XDP operations like redirection. Upcoming features that will improve XDP support for this driver are also mentioned.
What's hot (20)
Tricks every ClickHouse designer should know, by Robert Hodges, Altinity CEO
Tricks every ClickHouse designer should know, by Robert Hodges, Altinity CEO
Flink Forward Berlin 2018: Nico Kruber - "Improving throughput and latency wi...
Flink Forward Berlin 2018: Nico Kruber - "Improving throughput and latency wi...
2021 Dask Summit - Using STAC to catalog SpatioTemporal datasets
2021 Dask Summit - Using STAC to catalog SpatioTemporal datasets
SIP-to-SIP Connections on a Cisco Unified Border Element
SIP-to-SIP Connections on a Cisco Unified Border Element
Stop the Guessing: Performance Methodologies for Production Systems
Stop the Guessing: Performance Methodologies for Production Systems
ClickHouse Mark Cache, by Mik Kocikowski, Cloudflare
ClickHouse Mark Cache, by Mik Kocikowski, Cloudflare
VictoriaLogs: Open Source Log Management System - Preview
VictoriaLogs: Open Source Log Management System - Preview
Apache Beam and Google Cloud Dataflow - IDG - final
Apache Beam and Google Cloud Dataflow - IDG - final
Introduction to the Mysteries of ClickHouse Replication, By Robert Hodges and...
Introduction to the Mysteries of ClickHouse Replication, By Robert Hodges and...
Webinar: Secrets of ClickHouse Query Performance, by Robert Hodges
Webinar: Secrets of ClickHouse Query Performance, by Robert Hodges
Viewers also liked
AnáLisis De Algoritmos1
Este documento define algoritmo, sus características y razones para estudiarlos. Explica conceptos clave como eficiencia, complejidad y órdenes de complejidad para medir el rendimiento de algoritmos. Describe diferentes tipos de análisis como peor caso, mejor caso y promedio para estimar el tiempo de ejecución en función del tamaño de los datos.
[111015/아꿈사] HTML5를 여행하는 비(非) 웹 개발자를 위한 안내서 - 1부 웹소켓.
ajax 등장 이전부터, ajax, comet, 그리고 html5의 웹소켓까지 기술의 흐름을 간략하게 정리해 보았습니다.
웹 어플리케이션의 개발을 다뤄보지 않은 개발자들을 대상으로 처음부터 웹소켓을 다루기 전에,
1. 이전 세대의 통신 기법은 어떤 모양이었는지
2. 웹소켓이 왜 환영받을 만한 기술인지
... 등을 공감할 수 있기 위한 목적으로 PT를 작성 하였습니다.
Project Panama - Beyond the (JVM) Wall
The days of JNI is counted, Project Panama is on the rise to tear down the walls between Java and C/C++ forever. FFI (Foreign Function Interface) technology finally arrives into the Java world.
Viewers also liked (12)
[111015/아꿈사] HTML5를 여행하는 비(非) 웹 개발자를 위한 안내서 - 1부 웹소켓.
[111015/아꿈사] HTML5를 여행하는 비(非) 웹 개발자를 위한 안내서 - 1부 웹소켓.
Similar to Timing wheels
时间轮
This document discusses different timer schemes for efficient timer management. Hashed and hierarchical timing wheels are proposed to reduce interrupt overhead from timer maintenance. Hashed timing wheels place timers in buckets based on their expiry time to allow O(1) insertion and O(1) processing per tick on average. Hierarchical timing wheels further divide timing wheels into multiple levels based on granularity of time (e.g. hours, minutes, seconds) to provide efficient timer operations while reducing memory usage compared to simple timing wheels.
time_complexity_list_02_04_2024_22_pages.pdf
The document discusses time complexity analysis of loops. It defines key terminology used in loop time complexity analysis such as loop variable, loop repetitions, time complexity per iteration (TC1iter), and change of variable. It explains that the time complexity per iteration may depend on the loop variable, requiring the use of summations. It also discusses handling loops where the variable does not take consecutive values through a change of variable technique to map it to a new variable that does take consecutive values.
Standard cells library design
This document describes the design and characterization of a D flip-flop cell. It includes the layout, schematic, simulation waveforms, and timing analysis of the D flip-flop. The layout uses two metal layers and occupies an area of 76.8 μm2. Timing parameters such as setup time, clock-to-output time, and delay are calculated through HSPICE simulation and optimization curves.
Dinamica rotacional
This document provides instructions for a physics laboratory experiment on rotational dynamics. The objectives are to learn about rotational dynamics, identify inertia in different bodies, study how bodies behave in a model, and relate equations used to solve rotational dynamics problems. It describes building a model for this and provides equations for torque, angular acceleration, moment of inertia, and angular momentum. The procedure involves designing the model, calculating translational and rotational energies, and analyzing a collision using rotational dynamics equations. Calculations are shown for velocities before and after a simulated collision.
TensorFlow 2: New Era of Developing Deep Learning Models
This document discusses TensorFlow and provides information about:
1. Major TensorFlow releases from 2016-2018 and new features introduced each year like TensorFlow Serving, Keras API, TensorFlow Lite, etc.
2. Common TensorFlow operations that have changed names or behaviors between TensorFlow 1.x and 2.x like tf.variable, tf.global_variables_initializer, and Session.run.
3. How to distribute training across multiple GPUs and CPUs using strategies like MirroredStrategy in TensorFlow 2.x.
3. guia de_laboratorio_-_movimiento_perpetuo_navarrete_jonathan_
This document provides instructions and objectives for a laboratory practice experiment on building a perpetual motion machine. The objectives are to analyze the machine's motion for at least 3 minutes, identify the number of revolutions, determine angular velocity and moment of inertia. Equations for rotational motion are presented. Materials needed include plastic bottles, straws, caps, a motor and timer. Steps include taking measurements of time and revolutions to calculate variables and errors. Calculations determine the machine had an angular acceleration of 53 rpm with a 1.5% error and a moment of inertia of 0.0043 kg/cm2.
8051 ch9-950217
The document discusses timer programming for the 8051 microcontroller. It contains the following information:
- The 8051 has two timers/counters that can be used as timers to generate time delays or as event counters.
- Timers use 1/12 of the crystal frequency as the input clock. Registers like TH0, TL0, TMOD, and TCON are used to program and control the timers.
- Timer Mode 1 is a 16-bit timer mode where the TH and TL registers increment continuously until they roll over, setting the timer flag. Programming involves initializing the registers, starting the timer, and monitoring the flag.
VIPER S650 report
1) The document discusses the inverse kinematics of the Adept Viper S650 robot, which has 6 rotational joints.
2) The project task was to perform the forward and inverse kinematics calculations for 3 of the robot's joints.
3) Forward kinematics was calculated using the modified Denavit-Hartenberg (MDH) table to obtain transformation matrices and the position and orientation of the end effector. Inverse kinematics involved equating the desired transformation matrix with the product of individual joint transformation matrices to solve for the joint angles.
Class13_Quicksort_Algorithm.pdf
Quick Sort is a sorting algorithm that partitions an array around a pivot element, recursively sorting the subarrays. It has a best case time complexity of O(n log n) when partitions are evenly divided, and worst case of O(n^2) when partitions are highly imbalanced. While fast, it is unstable and dependent on pivot selection. It is widely used due to its efficiency, simplicity, and ability to be parallelized.
ControlLogix Timers FA16
The document discusses timers in programmable logic controllers (PLCs). It covers different timer instructions for Allen-Bradley and Siemens PLCs including TON, TOF, and RTO timers. It describes the parameters, status bits, and functionality of TON and TOF timers. It also provides examples of how timers can be used to implement circuits for oscillation, startup warnings, and sequential startup. The maximum timing period of a PLC timer is also summarized.
L15 timers-counters-in-atmega328 p
The document discusses timers and counters in the Atmega328 microcontroller. It describes the three timers: Timer/Counter0 is 8-bit, Timer/Counter1 is 16-bit, and Timer/Counter2 is 8-bit. Timers can be used for time delays, event counting, or PWM signal generation. Timer/Counter1 has additional features like 16-bit PWM and input capture. Modes like normal mode and CTC mode are described for Timer/Counter1. Example C code is provided to set up Timer1 for delays and interrupts. Calculations for delays using Timer1 in different modes are also demonstrated.
Avr timers
Timers are important electronic components used in microprocessors and microcontrollers to generate precise timing and delays. They work by counting clock signals and can be classified based on their mode of operation and maximum count. Timers are commonly implemented using flip flops and are used across many applications that require timing functions. Microcontrollers typically contain multiple timers that can be configured and programmed for applications requiring accurate timing and delays.
timer counter (1).pptx
fsdbfibdsibfdsbfhbhsdbhfbhdsbfhsbdhfbhbsdhbffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffdfddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
Avg q lenth
Queueing theory uses mathematical models to analyze performance measures of queueing systems. Common measures include average queue length and average delay time. The document provides detailed equations to calculate average queue length for the M/M/1 queueing model. Specifically, it shows that the average number of customers in an M/M/1 queue is equal to ρ/(1-ρ), where ρ is the utilization rate of the server.
Chapter 08
This document discusses different methods for implementing counters and time delays using an 8085 microprocessor. It provides examples of using a single register, register pair, and nested loops to create time delays. Calculations are shown for determining the delay based on the clock frequency, number of clock cycles in the loop, and value loaded into the delay register. An illustrative problem is presented to count from 0 to 9 with a one second delay between each count using modulo 10 counting.
Algorithim lec1.pptx
The document discusses algorithms analysis and sorting algorithms. It introduces insertion sort and merge sort, and analyzes their time complexities. Insertion sort runs in O(n^2) time in the worst case, while merge sort runs in O(n log n) time in the worst case, which grows more slowly. Therefore, asymptotically merge sort performs better than insertion sort for large data sets. The document also covers asymptotic analysis, recurrences, and using recursion trees to solve recurrences.
Lecture 13 14-time_domain_analysis_of_1st_order_systems
The document provides information about time domain analysis of first order systems. It discusses key concepts such as impulse response, step response, and ramp response of first order systems. It also discusses how to determine the transfer function of a first order system based on its step response obtained from practical testing. Examples of first order systems including DC motor and electrical circuits are also provided. The document analyzes various properties of first order systems such as effect of a zero, comparison of responses with and without zero, and response of a system with time delay. Matlab commands for partial fraction expansion are also explained.
9.Sorting & Searching
Searching algorithms can be categorized as internal or external depending on whether the list resides entirely in main memory or secondary storage. Linear or sequential search is a simple search algorithm that checks each element of a list sequentially until a match is found or the whole list has been searched. Binary search is a faster search algorithm that can only be used on sorted lists. It divides the search space in half at each step to locate the target element.
Sorting algorithms arrange items in a list in a specific order. Common sorting algorithms include selection sort, insertion sort, bubble sort, merge sort, quicksort, and radix sort. Sorting algorithms are analyzed based on their time and space complexity, with most having quadratic time complexity for simple algorithms
SE PAI Unit 5_Timer Programming in 8051 microcontroller_Part 2
2015 course SPPU SEIT syllabus of subject Processor Architecture and Interfacing (PAI) This covers Mode 1 and Mode 2 programming of timers, Counters and Counter Programming
Maqueta en componentes normal y tangencial
This document summarizes the calculations done to analyze the motion of a carousel. Key values determined include: the total radius of 13.83 cm, normal acceleration of 1.65 m/s2, tangential acceleration of 0 m/s2, tangential velocity of 0.4779 m/s, angular displacement of 9.7986 revolutions, period of 1.8182 seconds, and frequency of 0.5499 Hz. The normal acceleration was determined from the angular velocity and radius, while the tangential acceleration was zero due to constant velocity.
Similar to Timing wheels (20)
TensorFlow 2: New Era of Developing Deep Learning Models
TensorFlow 2: New Era of Developing Deep Learning Models
3. guia de_laboratorio_-_movimiento_perpetuo_navarrete_jonathan_
3. guia de_laboratorio_-_movimiento_perpetuo_navarrete_jonathan_
Lecture 13 14-time_domain_analysis_of_1st_order_systems
Lecture 13 14-time_domain_analysis_of_1st_order_systems
SE PAI Unit 5_Timer Programming in 8051 microcontroller_Part 2
SE PAI Unit 5_Timer Programming in 8051 microcontroller_Part 2
Recently uploaded
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...Edge AI and Vision Alliance
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.June Patch Tuesday
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
Imagine a world where machines not only perform tasks but also learn, adapt, and make decisions. This is the promise of Artificial Intelligence (AI), a technology that's not just enhancing our lives but revolutionizing entire industries.
Programming Foundation Models with DSPy - Meetup Slides
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
ここ3000字までしか入らないけどタイトルの方がたくさん文字入ると思います。
Presentation of the OECD Artificial Intelligence Review of Germany
Consult the full report at https://www.oecd.org/digital/oecd-artificial-intelligence-review-of-germany-609808d6-en.htm
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on integration of Salesforce with Bonterra Impact Management.
Interested in deploying an integration with Salesforce for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
TrustArc Webinar - 2024 Global Privacy Survey
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
OpenID AuthZEN Interop Read Out - Authorization
During Identiverse 2024 and EIC 2024, members of the OpenID AuthZEN WG got together and demoed their authorization endpoints conforming to the AuthZEN API
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Choosing The Best AWS Service For Your Website + API.pptx
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
Best 20 SEO Techniques To Improve Website Visibility In SERP
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Main news related to the CCS TSI 2023 (2023/1695)
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
GraphRAG for Life Science to increase LLM accuracy
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
Recently uploaded (20)
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
“Building and Scaling AI Applications with the Nx AI Manager,” a Presentation...
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
Programming Foundation Models with DSPy - Meetup Slides
Programming Foundation Models with DSPy - Meetup Slides
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Deep Dive: AI-Powered Marketing to Get More Leads and Customers with HyperGro...
Deep Dive: AI-Powered Marketing to Get More Leads and Customers with HyperGro...
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...
Salesforce Integration for Bonterra Impact Management (fka Social Solutions A...
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?
Nordic Marketo Engage User Group_June 13_ 2024.pptx
Nordic Marketo Engage User Group_June 13_ 2024.pptx
Choosing The Best AWS Service For Your Website + API.pptx
Choosing The Best AWS Service For Your Website + API.pptx
Best 20 SEO Techniques To Improve Website Visibility In SERP
Best 20 SEO Techniques To Improve Website Visibility In SERP
GraphRAG for Life Science to increase LLM accuracy
GraphRAG for Life Science to increase LLM accuracy
Timing wheels
- 1. Hashed and Hierarchical Timing Wheels A paper by George Varghese and Tony Lauck
- 4. Currently Used Timer Schemes a b c d e Can maintain absolute expiry time or the timer interval START_TIMER = O(1) STOP_TIMER = O(1) PER_TICK_BOOKKEEPING = O(n) a b c d e f maintain absolute expiry time START_TIMER = O(n) STOP_TIMER = O(1) PER_TICK_BOOKKEEPING = O(1)
- 5. Tree based timers a b c d a b c d maintain absolute expiry time START_TIMER = O(log(n)) STOP_TIMER = O(1) PER_TICK_BOOKKEEPING = O(1) Can degenerate to a linear list in case of equal Interval timers START_TIMER = O(n) STOP_TIMER = O(1) PER_TICK_BOOKKEEPING = O(1)
- 9. Hierarchical Timing Wheel 1 2 3 4 5 6 7 0 3 5 7 5 2 1 1 Hours wheel 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 0 Minutes wheel Seconds wheel 1 3 3 5 3 7 1 5
- 11. Comparison START_TIMER STOP_TIMER PER_TICK O(1) Straight Fwd O(1) O(n) Sequential List O(n) O(1) O(1) Tree Based O(log(n)) O(1) O(1) Simple Wheel O(1) O(1) O(1) High memory requirement Hashed Wheel (sorted) Hashed Wheel (unsorted) Hierarchical Wheels O(n) worst case O(1) avg O(1) O(m) O(1) O(1) O(1) O(1) O(n) worst case O(1) avg O(1)