* Cost Model to limit transactions which are not parallelizeable (#16694) * * Add following to banking_stage: 1. CostModel as immutable ref shared between threads, to provide estimated cost for transactions. 2. CostTracker which is shared between threads, tracks transaction costs for each block. * replace hard coded program ID with id() calls * Add Account Access Cost as part of TransactionCost. Account Access cost are weighted differently between read and write, signed and non-signed. * Establish instruction_execution_cost_table, add function to update or insert instruction cost, unit tested. It is read-only for now; it allows Replay to insert realtime instruction execution costs to the table. * add test for cost_tracker atomically try_add operation, serves as safety guard for future changes * check cost against local copy of cost_tracker, return transactions that would exceed limit as unprocessed transaction to be buffered; only apply bank processed transactions cost to tracker; * bencher to new banking_stage with max cost limit to allow cost model being hit consistently during bench iterations * replay stage feed back program cost (#17731) * replay stage feeds back realtime per-program execution cost to cost model; * program cost execution table is initialized into empty table, no longer populated with hardcoded numbers; * changed cost unit to microsecond, using value collected from mainnet; * add ExecuteCostTable with fixed capacity for security concern, when its limit is reached, programs with old age AND less occurrence will be pushed out to make room for new programs. * investigate system performance test degradation (#17919) * Add stats and counter around cost model ops, mainly: - calculate transaction cost - check transaction can fit in a block - update block cost tracker after transactions are added to block - replay_stage to update/insert execution cost to table * Change mutex on cost_tracker to RwLock * removed cloning cost_tracker for local use, as the metrics show clone is very expensive. * acquire and hold locks for block of TXs, instead of acquire and release per transaction; * remove redundant would_fit check from cost_tracker update execution path * refactor cost checking with less frequent lock acquiring * avoid many Transaction_cost heap allocation when calculate cost, which is in the hot path - executed per transaction. * create hashmap with new_capacity to reduce runtime heap realloc. * code review changes: categorize stats, replace explicit drop calls, concisely initiate to default * address potential deadlock by acquiring locks one at time * Persist cost table to blockstore (#18123) * Add `ProgramCosts` Column Family to blockstore, implement LedgerColumn; add `delete_cf` to Rocks * Add ProgramCosts to compaction excluding list alone side with TransactionStatusIndex in one place: `excludes_from_compaction()` * Write cost table to blockstore after `replay_stage` replayed active banks; add stats to measure persist time * Deletes program from `ProgramCosts` in blockstore when they are removed from cost_table in memory * Only try to persist to blockstore when cost_table is changed. * Restore cost table during validator startup * Offload `cost_model` related operations from replay main thread to dedicated service thread, add channel to send execute_timings between these threads; * Move `cost_update_service` to its own module; replay_stage is now decoupled from cost_model. * log warning when channel send fails (#18391) * Aggregate cost_model into cost_tracker (#18374) * * aggregate cost_model into cost_tracker, decouple it from banking_stage to prevent accidental deadlock. * Simplified code, removed unused functions * review fixes * update ledger tool to restore cost table from blockstore (#18489) * update ledger tool to restore cost model from blockstore when compute-slot-cost * Move initialize_cost_table into cost_model, so the function can be tested and shared between validator and ledger-tool * refactor and simplify a test * manually fix merge conflicts * Per-program id timings (#17554) * more manual fixing * solve a merge conflict * featurize cost model * more merge fix * cost model uses compute_unit to replace microsecond as cost unit (#18934) * Reject blocks for costs above the max block cost (#18994) * Update block max cost limit to fix performance regession (#19276) * replace function with const var for better readability (#19285) * Add few more metrics data points (#19624) * periodically report sigverify_stage stats (#19674) * manual merge * cost model nits (#18528) * Accumulate consumed units (#18714) * tx wide compute budget (#18631) * more manual merge * ignore zerorize drop security * - update const cost values with data collected by #19627 - update cost calculation to closely proposed fee schedule #16984 * add transaction cost histogram metrics (#20350) * rebase to 1.7.15 * add tx count and thread id to stats (#20451) each stat reports and resets when slot changes * remove cost_model feature_set * ignore vote transactions from cost model Co-authored-by: sakridge <sakridge@gmail.com> Co-authored-by: Jeff Biseda <jbiseda@gmail.com> Co-authored-by: Jack May <jack@solana.com>
267 lines
7.8 KiB
Rust
267 lines
7.8 KiB
Rust
//! The `streamer` module defines a set of services for efficiently pulling data from UDP sockets.
|
|
//!
|
|
|
|
use crate::{
|
|
packet::{self, send_to, Packets, PacketsRecycler, PACKETS_PER_BATCH},
|
|
recvmmsg::NUM_RCVMMSGS,
|
|
socket::SocketAddrSpace,
|
|
};
|
|
use solana_sdk::timing::timestamp;
|
|
use std::net::UdpSocket;
|
|
use std::sync::atomic::{AtomicBool, Ordering};
|
|
use std::sync::mpsc::{Receiver, RecvTimeoutError, SendError, Sender};
|
|
use std::sync::Arc;
|
|
use std::thread::{Builder, JoinHandle};
|
|
use std::time::{Duration, Instant};
|
|
use thiserror::Error;
|
|
|
|
pub type PacketReceiver = Receiver<Packets>;
|
|
pub type PacketSender = Sender<Packets>;
|
|
|
|
#[derive(Error, Debug)]
|
|
pub enum StreamerError {
|
|
#[error("I/O error")]
|
|
Io(#[from] std::io::Error),
|
|
|
|
#[error("receive timeout error")]
|
|
RecvTimeout(#[from] RecvTimeoutError),
|
|
|
|
#[error("send packets error")]
|
|
Send(#[from] SendError<Packets>),
|
|
}
|
|
|
|
pub type Result<T> = std::result::Result<T, StreamerError>;
|
|
|
|
fn recv_loop(
|
|
sock: &UdpSocket,
|
|
exit: Arc<AtomicBool>,
|
|
channel: &PacketSender,
|
|
recycler: &PacketsRecycler,
|
|
name: &'static str,
|
|
coalesce_ms: u64,
|
|
use_pinned_memory: bool,
|
|
) -> Result<()> {
|
|
let mut recv_count = 0;
|
|
let mut call_count = 0;
|
|
let mut now = Instant::now();
|
|
let mut num_max_received = 0; // Number of times maximum packets were received
|
|
loop {
|
|
let mut msgs = if use_pinned_memory {
|
|
Packets::new_with_recycler(recycler.clone(), PACKETS_PER_BATCH, name)
|
|
} else {
|
|
Packets::with_capacity(PACKETS_PER_BATCH)
|
|
};
|
|
loop {
|
|
// Check for exit signal, even if socket is busy
|
|
// (for instance the leader transaction socket)
|
|
if exit.load(Ordering::Relaxed) {
|
|
return Ok(());
|
|
}
|
|
if let Ok(len) = packet::recv_from(&mut msgs, sock, coalesce_ms) {
|
|
if len == NUM_RCVMMSGS {
|
|
num_max_received += 1;
|
|
}
|
|
recv_count += len;
|
|
call_count += 1;
|
|
if len > 0 {
|
|
channel.send(msgs)?;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
if recv_count > 1024 {
|
|
datapoint_debug!(
|
|
name,
|
|
("received", recv_count as i64, i64),
|
|
("call_count", i64::from(call_count), i64),
|
|
("elapsed", now.elapsed().as_millis() as i64, i64),
|
|
("max_received", i64::from(num_max_received), i64),
|
|
);
|
|
recv_count = 0;
|
|
call_count = 0;
|
|
num_max_received = 0;
|
|
}
|
|
now = Instant::now();
|
|
}
|
|
}
|
|
|
|
pub fn receiver(
|
|
sock: Arc<UdpSocket>,
|
|
exit: &Arc<AtomicBool>,
|
|
packet_sender: PacketSender,
|
|
recycler: PacketsRecycler,
|
|
name: &'static str,
|
|
coalesce_ms: u64,
|
|
use_pinned_memory: bool,
|
|
) -> JoinHandle<()> {
|
|
let res = sock.set_read_timeout(Some(Duration::new(1, 0)));
|
|
if res.is_err() {
|
|
panic!("streamer::receiver set_read_timeout error");
|
|
}
|
|
let exit = exit.clone();
|
|
Builder::new()
|
|
.name("solana-receiver".to_string())
|
|
.spawn(move || {
|
|
let _ = recv_loop(
|
|
&sock,
|
|
exit,
|
|
&packet_sender,
|
|
&recycler.clone(),
|
|
name,
|
|
coalesce_ms,
|
|
use_pinned_memory,
|
|
);
|
|
})
|
|
.unwrap()
|
|
}
|
|
|
|
fn recv_send(
|
|
sock: &UdpSocket,
|
|
r: &PacketReceiver,
|
|
socket_addr_space: &SocketAddrSpace,
|
|
) -> Result<()> {
|
|
let timer = Duration::new(1, 0);
|
|
let msgs = r.recv_timeout(timer)?;
|
|
send_to(&msgs, sock, socket_addr_space)?;
|
|
Ok(())
|
|
}
|
|
|
|
pub fn recv_batch(recvr: &PacketReceiver) -> Result<(Vec<Packets>, usize, u64)> {
|
|
let timer = Duration::new(1, 0);
|
|
let msgs = recvr.recv_timeout(timer)?;
|
|
let recv_start = Instant::now();
|
|
trace!("got msgs");
|
|
let mut len = msgs.packets.len();
|
|
let mut batch = vec![msgs];
|
|
while let Ok(more) = recvr.try_recv() {
|
|
trace!("got more msgs");
|
|
len += more.packets.len();
|
|
batch.push(more);
|
|
}
|
|
let recv_duration = recv_start.elapsed();
|
|
trace!("batch len {}", batch.len());
|
|
Ok((
|
|
batch,
|
|
len,
|
|
solana_sdk::timing::duration_as_ms(&recv_duration),
|
|
))
|
|
}
|
|
|
|
pub fn responder(
|
|
name: &'static str,
|
|
sock: Arc<UdpSocket>,
|
|
r: PacketReceiver,
|
|
socket_addr_space: SocketAddrSpace,
|
|
) -> JoinHandle<()> {
|
|
Builder::new()
|
|
.name(format!("solana-responder-{}", name))
|
|
.spawn(move || {
|
|
let mut errors = 0;
|
|
let mut last_error = None;
|
|
let mut last_print = 0;
|
|
loop {
|
|
if let Err(e) = recv_send(&sock, &r, &socket_addr_space) {
|
|
match e {
|
|
StreamerError::RecvTimeout(RecvTimeoutError::Disconnected) => break,
|
|
StreamerError::RecvTimeout(RecvTimeoutError::Timeout) => (),
|
|
_ => {
|
|
errors += 1;
|
|
last_error = Some(e);
|
|
}
|
|
}
|
|
}
|
|
let now = timestamp();
|
|
if now - last_print > 1000 && errors != 0 {
|
|
datapoint_info!(name, ("errors", errors, i64),);
|
|
info!("{} last-error: {:?} count: {}", name, last_error, errors);
|
|
last_print = now;
|
|
errors = 0;
|
|
}
|
|
}
|
|
})
|
|
.unwrap()
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod test {
|
|
use super::*;
|
|
use crate::packet::{Packet, Packets, PACKET_DATA_SIZE};
|
|
use crate::streamer::{receiver, responder};
|
|
use solana_perf::recycler::Recycler;
|
|
use std::io;
|
|
use std::io::Write;
|
|
use std::net::UdpSocket;
|
|
use std::sync::atomic::{AtomicBool, Ordering};
|
|
use std::sync::mpsc::channel;
|
|
use std::sync::Arc;
|
|
use std::time::Duration;
|
|
|
|
fn get_msgs(r: PacketReceiver, num: &mut usize) {
|
|
for _ in 0..10 {
|
|
let m = r.recv_timeout(Duration::new(1, 0));
|
|
if m.is_err() {
|
|
continue;
|
|
}
|
|
|
|
*num -= m.unwrap().packets.len();
|
|
|
|
if *num == 0 {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn streamer_debug() {
|
|
write!(io::sink(), "{:?}", Packet::default()).unwrap();
|
|
write!(io::sink(), "{:?}", Packets::default()).unwrap();
|
|
}
|
|
#[test]
|
|
fn streamer_send_test() {
|
|
let read = UdpSocket::bind("127.0.0.1:0").expect("bind");
|
|
read.set_read_timeout(Some(Duration::new(1, 0))).unwrap();
|
|
|
|
let addr = read.local_addr().unwrap();
|
|
let send = UdpSocket::bind("127.0.0.1:0").expect("bind");
|
|
let exit = Arc::new(AtomicBool::new(false));
|
|
let (s_reader, r_reader) = channel();
|
|
let t_receiver = receiver(
|
|
Arc::new(read),
|
|
&exit,
|
|
s_reader,
|
|
Recycler::default(),
|
|
"test",
|
|
1,
|
|
true,
|
|
);
|
|
let t_responder = {
|
|
let (s_responder, r_responder) = channel();
|
|
let t_responder = responder(
|
|
"streamer_send_test",
|
|
Arc::new(send),
|
|
r_responder,
|
|
SocketAddrSpace::Unspecified,
|
|
);
|
|
let mut msgs = Packets::default();
|
|
for i in 0..5 {
|
|
let mut b = Packet::default();
|
|
{
|
|
b.data[0] = i as u8;
|
|
b.meta.size = PACKET_DATA_SIZE;
|
|
b.meta.set_addr(&addr);
|
|
}
|
|
msgs.packets.push(b);
|
|
}
|
|
s_responder.send(msgs).expect("send");
|
|
t_responder
|
|
};
|
|
|
|
let mut num = 5;
|
|
get_msgs(r_reader, &mut num);
|
|
assert_eq!(num, 0);
|
|
exit.store(true, Ordering::Relaxed);
|
|
t_receiver.join().expect("join");
|
|
t_responder.join().expect("join");
|
|
}
|
|
}
|