Live data from Hacker News

Viewing profile — omazurov

omazurov

HN member
Joined
Fri, Aug 11, 2017, 1:54 AM UTC
HN karma
178
Public activity
75 items

About omazurov

No profile information was provided.

Recent public activity

  1. comment
    Comment #36434299

    No mature, sensible code allows for 10x performance improvement (let alone...). Every time I see a statement like this I take it as a confession.

  2. comment
    Comment #36101301

    My personal recommendation for a Tarkovsky's first is his diploma film The Steamroller and the Violin (1960, 46 min, co-written with Andrei Konchalovsky). It was surprisingly watch…

  3. comment
    Comment #35359544

    You get JFR's precision but inherit its blind spots as described in [1]: > demo1: ... JFR will not report anything useful at all, since it cannot traverse stack traces when JVM is …

  4. comment
    Comment #35353232

    >Profilers are not rocket science... They are not. There are orders of magnitude more rocket scientists than good profiler writers. And no, bottle rockets with flight recorders do …

  5. comment
    Comment #35205981

    >...retrocausal models also open avenues of exploring a “time-symmetric” view of our universe, in which the laws of physics are the same regardless of whether time runs forward or …

  6. comment
    Comment #32075613

    Necessity is the mother of invention? (Голь на выдумки хитра? :( )

  7. comment
    Comment #32075563

    I can only repeat my initial statement: > Multi-dimensional RS codes are an easy way to get to an absurdly huge size for real. "Multi-dimensional" may mean 3,4,..,10 dimensions. "A…

  8. comment
    Comment #32051515

    I'm not talking about CD-ROMs or immediate availability in any form. How would you encode a petabyte (for a starter) with LDPC/Turbo? Not available right away but accumulated over …

  9. comment
    Comment #32049669

    > Larger and larger block sizes are important. LDPC probably is the more practical methodology today, though I admit that I'm ignorant about them. Still cool to see someone try to …

  10. comment
    Comment #31796327

    > But I’m here to tell you they got it wrong, and everyone’s been getting it wrong ever since. Students come away underwhelmed and baffled, and go on to become the next generation …

  11. comment
    Comment #31755160

    That's why there should be another parameter: you should split the key into N parts so that any M <= N can open the lock. You can increase M adding people you don't trust 100%, say…

  12. comment
    Comment #30668075

    >> helped kindle the European Renaissance as we know it. > The italian renaissance started in the 14th century for sure and maybe even in 13th century depending on who you ask. Tho…

  13. comment
    Comment #29989122

    > Free will does not exist. It is logically inconsistent... That line of argument makes no difference between the free will of humans and that of animals, insects, bacteria or rock…

  14. comment
    Comment #28518696

    It's plain Java (i.e. JVM/JIT), ForkJoinTask based implementation. As in the original implementation, measurement is done around the quickSort() call. One point is actually that th…

  15. comment
    Comment #28516480

    Increasing the size of the array 10x (100_000_000) and filling a glaring omission: Go (go1.17.1 darwin/amd64) took 5.591593544s took 5.285948722s took 5.218750076s took 5.239224787…

  16. comment
    Comment #28260907

    > Instead of memorizing 20x20 combinations, you limit yourself to a standard 10x10 table (just 25% of all combinations) Actually, 26% (55/210). You say 25% and nobody notices. You …

  17. comment
    Comment #28195290

    Please see my example below.

  18. comment
    Comment #28195282

    > If you're spawning one million threads, each of which will perform a blocking operation, then you're likely not CPU bound Imagine a DAG with million nodes. Each node takes data f…

  19. comment
    Comment #28194857

    I thought the promise was we'd use Threads for everything and forget to worry about blocking calls. I can't run one OS thread per CPU in my proposed benchmark: I want to run millio…

  20. comment
    Comment #28194766

    >... delimited continuations (of some form) I expect internal implementation of continuations in Loom to have non-negligible overhead which may be justified for heavy blocking I/O …

  21. comment
    Comment #27322498

    A friend of mine who had lived in the USA long enough to pick up some local traits had to go back to Russia to renew his expiring documents. One required a fresh photo to be taken.…

  22. story
  23. comment
    Comment #26298699

    For weekend's entertainment: making Game of Life time reversible. Isotropically. https://github.com/OlegMazurov/Janus

  24. comment
    Comment #25492609

    > Shared mutexes are ruled out trivially, because as soon as one thread obtains the mutex, your worst enemy could simply never schedule that thread again. Another possibility is th…

  25. comment
    Comment #24327916

    For your goods, services... The U.S. of A. is a debt hub. Banks are also debt hubs but on a smaller scale and dependent on their sovereign.