You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
PFOO-U is painfully slow on traces above 50 million requests. Technically, it should be a linear-time algorithm and should outperform PFOO-L. But PFOO-L is orders of magnitude faster in practice, due to its simplicity. In addition, PFOO-U is single threaded and memory bound.
The text was updated successfully, but these errors were encountered:
PFOO-U is painfully slow on traces above 50 million requests. Technically, it should be a linear-time algorithm and should outperform PFOO-L. But PFOO-L is orders of magnitude faster in practice, due to its simplicity. In addition, PFOO-U is single threaded and memory bound.
The text was updated successfully, but these errors were encountered: