sbahra

8 ms·

31.
Performance Improvements for FreeBSD Kernel Debugging(backtrace.io)
61 points by sbahra 10y ago|2 comments
32.
On-Demand Debugging of Go Applications(backtrace.io)
2 points by sbahra 10y ago|0 comments
33.
Golang post-mortem debugging(backtrace.io)
4 points by sbahra 10y ago|0 comments
34.
by sbahra 10y ago
Can confirm.
35.
by sbahra 10y ago
It reverts to a bus lock in this split transaction case, not cache line locking (thus stalling whole system).
36.
Concurrency Kit: portable, BSD-licensed, lock-free data structure library for C(concurrencykit.org)
1 points by sbahra 10y ago|0 comments
37.
Concurrency Kit: portable, BSD-licensed, lock-free data structure library for C(concurrencykit.org)
5 points by sbahra 10y ago|0 comments
38.
Symbolic Debugging with DWARF (video / BangBangCon)(backtrace.io)
4 points by sbahra 10y ago|0 comments
39.
by sbahra 11y ago
Yes, it is possible. We are hiring, learn more at http://Backtrace.io
40.
by sbahra 11y ago
Oh, cool! We hope to publish something soon on this. ;-) It would be great to learn more about the work you're doing.
41.
by sbahra 11y ago
Glad you liked it. Unfortunately, core files can be massive and require you to have a lot of the assets from the environment the fault occurred in to debug. Last but not least, it would be good if they gave us more of a head-start on root c
42.
What is a core dump and how do you parse one?(backtrace.io)
118 points by sbahra 11y ago|19 comments
43.
What is a core dump and how do you parse one?(backtrace.io)
3 points by sbahra 11y ago|0 comments
44.
by sbahra 11y ago
Is there a "Cotton Eye Joe" reference here?
45.
by sbahra 11y ago
Code duplication can also mean more errors and a lot more work for porters. You'll also see plenty of other examples in popular open-source projects such as the Linux and FreeBSD kernel. The reduction in amount of duplication is sign
46.
by sbahra 11y ago
I agree. Such an article would be more emphasizing use-cases for different advanced synchronization techniques in context of Concurrency Kit. You may just not have a use for it too. I'll put up a presentation soon that may be helpful i
47.
by sbahra 11y ago
It's used in a lot of mission-critical commercial applications which I think is a stronger indicator. It just so happens those aren't open-source. This ranges from mission-critical enterprise software to internal infrastructure ti
48.
by sbahra 11y ago
They are. As Alex points out, a fair number are a mixture of single-reader many-writer or many-writer single-writer, and a few are many-writer many-reader. MPMC: ck_stack, ck_fifo, ck_ring (in the works), ck_disruptor (pending push), ck_bit
49.
by sbahra 11y ago
RCU is a higher-level abstraction. You can implement RCU with epoch reclamation, typically there are more performant ways to detect grace periods in kernel space.
50.
by sbahra 11y ago
HP is much more granular and a stuck thread does not inhibit system wide progress (yes, the slots won't be reclaimed but other entries will continue to be reclaimed).
51.
by sbahra 11y ago
Note that epoch reclamation is only competitive with amortization, otherwise you may as well use hazard pointers for simple structures to benefit from stronger progress guarantees. Of course, QSBR is best if you have quiescent points.
52.
by sbahra 11y ago
Stand-alone EBR also available at http://concurrencykit.org
53.
by sbahra 11y ago
Paul has been doing great work here: http://repnop.org/pd/slides/bsearch.pdf
54.
by sbahra 11y ago
Pulltheplug
55.
Left-Leaning Red-Black Trees Considered Harmful(read.seas.harvard.edu)
1 points by sbahra 11y ago|0 comments
56.
by sbahra 11y ago
Not comparing to HP/PTB/LFRC, just RCU and similar schemes. You're right in that the first class are easy to beat given appropriate workload. RCU is being conflated, the (Hart) paper I linked to will addresses your questions
57.
by sbahra 11y ago
More efficient than using garbage collection, if you're working with a language where you can operate in an unmanaged mode (barring FFI). I do expect this gap to start closing based on some literature some friends have shared with me..
58.
by sbahra 11y ago
The magic of RCU definitely is the safety guarantee on read-side with little to no overhead and an easy to approach API. Traditional copy-on-write systems do not provide this guarantee as there would be synchronization and / or blockin
59.
by sbahra 11y ago
1) Efficiency of algorithms stems from disabling interrupts The efficiency stems from having little to zero synchronization cost for readers in a read-mostly workload or workload that just isn't update-intensive. In addition to that, n
60.
by sbahra 11y ago
What makes you say this? RCU refers to a wide array of reclamation implementations and some URCU implementations do indeed have a lot in common with kernel-space RCU (which also has a myriad of implementations). Speaking of liburcu in speci

More ›