Podcasts about 1kb

本期主播：野人、细菌佛小红书：钱粮胡同的野人，细菌佛首先感谢华夏基金红色火箭赞助播出，点击直达红色火箭：https://wxmpurl.cn/O2UbdgZZPji「红色火箭」是华夏基金旗下专门针对指数投资研究的数据分析和决策辅助工具，帮你更好地了解指数、学习指数投资、做好投资决策，通过微信直接搜索即可免费使用。相关小程序内容仅作为学习工具，不作为任何投资建议和决策的参考。『ETF华夏』“火伴计划”会员体系功能上新，点击“红色火箭”小程序，进入“ETF会员”页面完成实名认证，就可以免费领取对应等级的权益，若持有华夏基金旗下的ETF还可以关注一下每个月薅羊毛领福利；通过红色火箭小程序内的指数浏览器中的指数详情页还可以查看到具体指数的客观数据，如行情信息、历史表现、估值等等，帮助投资者理性做出投资决策；红色火箭内还能够进行指数对比，更方便大家对比学习不同指数之间的区别，找到更适合自己的指数。中国存储巨头长鑫科技即将迎来历史性的上市时刻，有望一举成为A股市值新皇。但在欢呼之前，我们必须先回头看看，它是如何在一个由钢铁和鲜血铸就的绝对垄断堡垒中活下来的。本期节目，野人和细菌佛将带你回到那个惊心动魄的内存江湖。从英特尔的开疆拓土，到日本举国体制的疯狂碾压；从美国祭出关税大棒的冷酷反击，再到韩国三星如同疯子一般的“逆周期扩张”自杀式袭击。我们将为你揭秘，如今由三星、SK海力士和美光组成的三足鼎立格局，究竟是用多少家昔日巨头的尸骨堆叠而成的。听完这一期，你会彻底明白：在半导体的战场上，从来没有温良恭俭让，只有你死我活的血肉绞肉机！⏱️【时间轴】引入：长鑫科技与暴富的“存储神话”00:00抢不到热点怎么办？那我们就提前埋伏！预测A股下一个超级巨头：长鑫科技。02:59灵魂拷问：你买的金士顿、海盗船其实只是组装厂，世界上真正能做内存芯片的只有四家！04:48站在光里的人？不，买存储你就是太阳！揭秘AI浪潮下韩国股市暴涨230%的幕后推手。07:47暴利行业：三星和海力士一个季度狂赚1000亿美元，前40年等于白干。10:30长鑫科技的惊天逆转：忍着亏了400亿，今年一季度单季暴赚两百多亿。科普：别再把内存和硬盘搞混了！23:45连媳妇都搞不懂的参数：手机参数里的“8+512”，到底哪个才是真内存？26:00易失性与非易失性：断电就没的内存，为什么速度能比硬盘快1000倍（相当于步兵对比超音速飞机）？️内存一战：美日争霸与韩国的暗中偷师30:23祖师爷登场：1970年，英特尔卖10美元的1KB内存，开启了微型计算机时代。33:13浩瀚大洋是赌场：日本通产省联合财阀出击，用“用25年都不坏”的极致工匠精神，在80年代把美国企业打趴下。41:20美国的致命反击：《广场协议》、反倾销、100%惩罚性关税，教会日本谁才是真正的“爹”。44:20韩国三星的“绝户计”崛起：能买就买，买不着就偷，外加每周干90小时的007地狱级爆肝。48:25愚公移山感动上天：美国为了找人取代日本，向韩国倾注资源，韩国技术实现全面反超。内存的一战与二战：三星的“逆周期”大屠杀55:19商业核武器：“逆周期扩张”到底是个什么变态玩法？市场越烂，我越疯狂扩产！01:00:20 97年亚洲金融危机：三星发动第一次自杀式冲锋，亏血本疯狂建厂，熬死欧洲和日本大批玩家。01:04:10 08年次贷危机：三星把利润全押上牌桌，内存芯片跌穿纸张成本价（0.3美元）！01:06:39欧洲的悲歌：德国奇梦达因资金链断裂、求救无门，在2009年正式破产。01:11:01战神金刚的陨落：日本内存最后的希望“尔必达”，连遭大地震、洪水、CEO坠机，凄惨倒在2012年。终局与悬念：铁板一块的垄断与破局者01:20:00三大寡头确立：韩国政府促成SK海力士，美国美光靠“捡破烂”收编败者，天下三分。01:23:45屠龙少年变恶龙：三巨头停止价格战，用交叉授权和产能调控收割全球。01:25:06下期高能预告：在针扎不进、水泼不进的垄断巨石缝里，中国长鑫科技是如何突围的？【本期名词备忘】易失性存储（内存/RAM）：速度极快，断电数据消失，负责给CPU喂数据。非易失性存储（闪存/硬盘/ROM）：速度慢，断电数据保留，负责长久保存照片视频。HBM：AI算力用的高端内存，目前韩国双雄占据近80%份额。逆周期扩张：在经济下行、需求萎靡时，利用雄厚资本逆势扩产，压低价格，耗死竞争对手的商业手段。片尾曲《内存的第七章》八加五一二的参数，藏着多少世人误读的盲目易失性存储的迷雾，断电十分之一秒数据就成了虚无那是喂给CPU的怪物，一千倍的响应速度像超音速的狂舞故事从一九七零年起步，十美元1KB是英特尔最初的版图日本通产省压上筹码，超大规模集成电路的计划开始摩擦东芝日立的战马，把良率拉到百分之八十的无暇二十五年的标杆，工匠精神碾压了美国的自大两美元的降价，英特尔裁员七千也只能把碎牙咽下但广场协议的笔画，百分之百的关税撕碎了这东亚的神话他们以为打扫完战场，就能安稳地坐在王座中央却不知道汉江边上，有人正每周九十小时在疯狂晕倒在工位也是寻常，买不到就偷，偷不到就用命去扛那六十四K的曙光，是愚公移山渴望被上天端详红色的警报，在九七年的寒冬里回荡逆周期的屠刀，斩断了谁的防线与希望零点三美元的雪崩，掩埋了多少工厂的凄凉权力的权杖，在血泊之中重铸了荣光亚洲金融的风暴，NEC亏损裁员两万人的哀号德州仪器卖掉基业，IBM把业务交给了东芝的怀抱但三星却在狂笑，十二亿美元建起四座工厂的狂飙卖一片亏一片的门道，自杀式袭击是不讲理的单行道零八年次贷的泥沼，全部利润化作砍向同行的尖刀奇梦达的求救信，三亿欧元加码到六亿的贪心德国政府的拒绝，让欧洲最后的堡垒化作了灰烬尔必达的希腊语，背负着日本最后的孤勇与宿命三一一地震的悲鸣，泰国洪水的决堤，还有空难坠机的冷冰仰天长叹天要亡我的叹息，定格在二零一二的破产声明美光像个收破烂的幽灵，捡起德州东芝留下的零星三足鼎立的阵型，三星和海力士占据了七成的山顶不再有价格战的血腥，只有交叉授权和默契的宁静他们用产能来调控，把全球的内存价格死死地敲定寡头的王座，用产能调控堆叠成高墙交叉授权的密网，遮蔽了这片半导体的光三足鼎立的沉寂，把历史的硝烟全都埋葬谁还能记起，那硅片上曾经惨烈的战场针扎不进的壁垒 (铁板一块的张狂)水泼不进的堡垒 (谁在暗夜里潜藏)直到岩石的缝隙，长鑫科技挣脱了黑暗的捆绑科创板的新王，一季度两百多亿利润的回响一朵神秘的花，正准备冲破这黑夜的伪装下周的胡同里……故事我们接着讲……

Suitability Profile: Alberto Daniel HillIntroductionAlberto Daniel Hill is a complex figure who sits at the intersection of elite cybersecurity, digital activism, and deep personal resilience. Forged by an innate curiosity and tempered by the trauma of an incarceration that he defines as unjust, his profile transcends that of a mere technical expert. This document aims to analyze his trajectory in a comprehensive way, assessing not only his proven technical competencies, but also the robust ethical framework that guides his actions and the transformative impact of his incarceration. Through this analysis, their suitability for high-impact roles that require not only expertise, but also uncompromising moral leadership will be determined.--------------------------------------------------------------------------------1. Origins and Technical Basis1.1. Training contextTo understand Alberto Daniel Hill's current ability, it is essential to analyze the origins of his passion for technology and the professional career that consolidated his expertise. Her profile is not the result of conventional training, but of an insatiable curiosity that began in childhood and was rigorously validated through high-level certifications and critical experiences in the public and private sectors.1.2. Innate Aptitude and Early TrainingThe main driver behind Hill's skill is a curiosity that he describes as endless. His immersion in computer science was not a late career choice, but a vocation that defined him since childhood, differentiating him from his peers and laying the foundations for his analytical approach.• First Contact: At age 7 or 8, he had his first encounter with a Sinclair computer with 1KB of RAM, an event that opened up "an incredible world" for him.• Self-learning: At age 10, with a 48KB RAM Spectrum Plus, he taught himself to modify games by altering values in memory, a feat that demonstrates an early aptitude for reverse engineering.• Absolute Dedication: While other children played in the street, he dedicated himself to experimenting with computers, a dedication that cemented his deep understanding of systems at its most fundamental level.1.3. Professional Credentials and ExperienceHill's career is characterized by remarkable diversity and depth, spanning from academia to high-level forensic application and government consulting. Its expertise is not only theoretical, but has been proven in high-pressure and technically complex scenarios.DomainKey Milestones and AccreditationsFormal EducationDegree in Engineering and a Master's degree in areas related to computing.High-Level CertificationsProject Management Professional (PMP), Certified Ethical Hacker (CEH), and multiple certifications in Linux, Microsoft, Cisco, and Fortinet.Forensic ExperienceHe collaborated with Interpol in digital expertise. In 2004, he was the first expert witness in a child pornography case in Uruguay under a new law.Government SectorHe worked for four years as a security consultant for a Uruguayan government company, auditing and strengthening critical systems.

  True Faith- “How Do I Know I'm Saved?”                                            Pt. 4 “Fortitude”                                                                           Colossians 1:21-23   God's Preservation (vv.21-22)   Phil. 1:6  And I am sure of this, that he who began a good work in you will bring it to completion at the day of Jesus Christ     Ro. 8:31,33,39 31 What then shall we say to these things? If God is for us, who can be[i] against us?.. 33 Who shall bring any charge against God's elect? It is God who justifies….  39 nor height nor depth, nor anything else in all creation, will be able to separate us from the love of God in Christ Jesus our Lord.   Our Perseverance (vv. 22b -23)   Jo. 6:66-69 66 After this many of his disciples turned back and no longer walked with him. 67 So Jesus said to the twelve, “Do you want to go away as well?” 68 Simon Peter answered him, “Lord, to whom shall we go? You have the words of eternal life, 69 and we have believed, and have come to know, that you are the Holy One of God.”   Job 1:20-22 20 Then Job arose and tore his robe and shaved his head and fell on the ground and worshiped. 21 And he said, “Naked I came from my mother's womb, and naked shall I return. The Lord gave, and the Lord has taken away; blessed be the name of the Lord.” 22 In all this Job did not sin or charge God with wrong.   1 Cor. 15:1-2 Now I would remind you, brothers, of the gospel I preached to you, which you received, in which you stand, 2 and by which you are being saved, if you hold fast to the word I preached to you—unless you believed in vain   Ro. 8:35-39 35 Who shall separate us from the love of Christ? Shall tribulation, or distress, or persecution, or famine, or nakedness, or danger, or sword? 36 As it is written,   “For your sake we are being killed all the day long;     we are regarded as sheep to be slaughtered.”   37 No, in all these things we are more than conquerors through him who loved us. 38 For I am sure that neither death nor life, nor angels nor rulers, nor things present nor things to come, nor powers, 39 nor height nor depth, nor anything else in all creation, will be able to separate us from the love of God in Christ Jesus our Lord.       7-14.docx46.1kB

Добрый день уважаемые слушатели. Представляем новый выпуск подкаста RWpod. В этом выпуске: Ruby Rails 7 adds Enumerable#maximum Rails design patterns Code Loaders in Ruby: Understanding Zeitwerk Redis rate limiter Do Not Use the MacOS System Ruby Upgrow - a sustainable architecture for Ruby on Rails Web The Future of Web Software Is HTML-over-WebSockets Time for Next-Gen Codecs to Dethrone JPEG JavaScript performance beyond bundle size Streams — the definitive guide Simple-keyboard - a fast, dependency-free and customizable virtual keyboard for rich and snappy web applications Goober - a less than 1KB css-in-js solution RactivePlayer - create interactive videos in React RWpod Cafe #19 (06.03.2021) RWpod Cafe #19 Темы для выпуска

Historie: 1942 Konrád Zuse - počítač Zuse Z4 - zničený při náletu, 1944 Howard Aiken - Reléový počítač MARK 1 - podpora IBM, možné výpočty pro 1. atomovou bombu 1945 Pensylvánská univerzita: ENIAC (Electronic Numerical Integrator and Calculator) - 1. Elektronkový počítač 1951 - UNIVAC - 1. Sériově vyráběný počítač (nikoli však pro domácí použití) - firma Rennington, 60. - 70. Léta - sálové počítače, velké množství dat zpracováváno na zakázku, terminál: monitor + klávesnice napojeny na rozměrný počítač, herní konzole 80. Léta - osobní počítače, první mikroprocesor Intel C4004 - 1971 - první osobní počítače řady PC, 1981 IBM PC/XT 5150 , 1984 IBM PC/AT (Advanced Technology), v následujících letech rozhodující: velikost diskových kapacit, rychlost procesorů, dnes: výkon grafické karty, RAM, úložná kapacita disků, optické mechaniky - DVD, Blu-ray, nyní nahrazují cloudová úložiště, flash disky, konkurence PC: Mackintosh (Apple) POUŽITÍ POČÍTAČŮ: kancelářské aplikace, databáze, komunikace - VoIP (Voice over Internet Protocol), Grafika/ grafické systémy: GIS, CAD/CAM(Computer aided manufacturing), Řídící systémy, výzkum a vývoj, Audiovize - audiovizuální efekty, Zábava - zábavní průmysl - herní konzole, joystick, Další: tablety, smartphony JEDNOTKY 1 bit 0/1, 1 byte/bajt: 8 bitů 1kB = 1024 bytů/ bajtů, 1MB = 1024 kB, 1GB = 1024 MB, 1TB = 1024 GB, 1024 == 2^10 VON NEUMANNOVO SCHÉMA: vstupní zařízení - vstup dat, ALU (arithmetic-logic unit) - aritmeticko-logická jednotka - matematické a logické operace operační paměť - ukládání dat popř. mezivýsledků, řadič - řídí činnost všech částí počítače, vstupní zařízení - zobrazuje výstup, Dnes: ALU + Řadič = Procesor, procesor + operační paměť = CPU (Central processing unit)

Добрый день уважаемые слушатели. Представляем новый выпуск подкаста RWpod. В этом выпуске: Ruby What’s new in Interactive Ruby Shell (IRB) with Ruby 2.7, Ruby 2.7 adds Integer#[] to support range values, Rails 6 adds add_foreign_key and remove_foreign_key for SQLite3, Puma 4.2.0 и Behind-the-scenes of ‘Geared Pagination’ in Rails Best practices when writing a Dockerfile for a Ruby application, Erubi - a ERB template engine for ruby и The Journey to One Million by Samuel Williams (video) Web V8 release v7.8, Node v12.11.0, Wikipedia’s JavaScript initialisation on a budget и Why JavaScript Tooling Sucks 15 Must-Have Vue Directives That Will Significantly Maximize Your Productivity, GPU.js 2.0, OGL - a small, effective WebGL framework, Repeater.js - a missing constructor for creating safe async iterators, Robot - fast 1kB functional library for creating Finite State Machines и React-Toastify 5.4.0

Join Theo Roth as he describes his lab's novel CRISPR-Cas9 genome-targeting system that does not require viral vectors to modify T cell genomes, but instead focuses on HDR. This allows rapid and efficient insertion of large DNA sequences at specific sites in the genomes of primary human T cells, and permits individual or multiplexed modification of endogenous genes. Importantly, avoiding the use of viral vectors will result in accelerated research and clinical applications, reduce experimental cost, and improve safety. In this webinar, you will learn: - The advantages of using HDR versus recombinant viral vectors when modifying T cell genomes - How long double-stranded and single-stranded DNA can serve as a non-viral HDR template - A novel method that allows for the insertion of large DNA sequences (>1Kb) without a virus! Current efforts at reprogramming T cells for therapeutic purposes rely on using recombinant viral vectors. Unfortunately, viral vectors do not target transgenes to specific genomic sites. Moreover, the manufacturing and testing of effective viral vectors is often a lengthy and expensive process, which slows research progress and clinical use. However, recent studies have shown that re-engineering T cells in a specific and efficient manner is possible using homology-directed repair (HDR).

We explore whether a BSD can replicate Cisco router performance; RETGUARD, OpenBSDs new exploit mitigation technology, Dragonfly's HAMMER2 filesystem implementation & more! This episode was brought to you by Headlines Can a BSD system replicate the performance of a Cisco router? (https://www.reddit.com/r/networking/comments/6upchy/can_a_bsd_system_replicate_the_performance_of/) Short Answer: No, but it might be good enough for what you need Traditionally routers were built with a tightly coupled data plane and control plane. Back in the 80s and 90s the data plane was running in software on commodity CPUs with proprietary software. As the needs and desires for more speeds and feeds grew, the data plane had to be implemented in ASICs and FPGAs with custom memories and TCAMs. While these were still programmable in a sense, they certainly weren't programmable by anyone but a small handful of people who developed the hardware platform. The data plane was often layered, where features not handled by the hardware data plane were punted to a software only data path running on a more general CPU. The performance difference between the two were typically an order or two of magnitude. source (https://fd.io/wp-content/uploads/sites/34/2017/07/FDioVPPwhitepaperJuly2017.pdf) Except for encryption (e.g. IPsec) or IDS/IPS, the true measure of router performance is packets forwarded per unit time. This is normally expressed as Packets-per-second, or PPS. To 'line-rate' forward on a 1gbps interface, you must be able to forward packets at 1.488 million pps (Mpps). To forward at "line-rate" between 10Gbps interfaces, you must be able to forward at 14.88Mpps. Even on large hardware, kernel-forwarding is limited to speeds that top out below 2Mpps. George Neville-Neil and I did a couple papers on this back in 2014/2015. You can read the papers (https://github.com/freebsd-net/netperf/blob/master/Documentation/Papers/ABSDCon2015Paper.pdf) for the results. However, once you export the code from the kernel, things start to improve. There are a few open source code bases that show the potential of kernel-bypass networking for building a software-based router. The first of these is netmap-fwd which is the FreeBSD ip_forward() code hosted on top of netmap, a kernel-bypass technology present in FreeBSD (and available for linux). Full-disclosure, netmap-fwd was done at my company, Netgate. netmap-fwd will l3 forward around 5 Mpps per core. slides (https://github.com/Netgate/netmap-fwd/blob/master/netmap-fwd.pdf) The first of these is netmap-fwd (https://github.com/Netgate/netmap-fwd) which is the FreeBSD ip_forward() code hosted on top of netmap (https://github.com/luigirizzo/netmap), a kernel-bypass technology present in FreeBSD (and available for linux). Full-disclosure, netmap-fwd was done at my company, Netgate. (And by "my company" I mean that I co-own it with my spouse.). netmap-fwd will l3 forward around 5 Mpps per core. slides (https://github.com/Netgate/netmap-fwd/blob/master/netmap-fwd.pdf) Nanako Momiyama of the Keio Univ Tokuda Lab presented on IP Forwarding Fastpath (https://www.bsdcan.org/2017/schedule/events/823.en.html) at BSDCan this past May. She got about 5.6Mpps (roughly 10% faster than netmap-fwd) using a similar approach where the ip_foward() function was rewritten as a module for VALE (the netmap-based in-kernel switch). Slides (https://2016.eurobsdcon.org/PresentationSlides/NanakoMomiyama_TowardsFastIPForwarding.pdf) from her previous talk at EuroBSDCon 2016 are available. (Speed at the time was 2.8Mpps.). Also a paper (https://www.ht.sfc.keio.ac.jp/~nanako/conext17-sw.pdf) from that effort, if you want to read it. Of note: They were showing around 1.6Mpps even after replacing the in-kernel routing lookup algorithm with DXR. (DXR was written by Luigi Rizzo, who is also the primary author of netmap.) Not too long after netmap-fwd was open sourced, Ghandi announced packet-journey, an application based on drivers and libraries and from DPDK. Packet-journey is also an L3 router. The GitHub page for packet-journey lists performance as 21,773.47 mbps (so 21.77Gbps) for 64-byte UDP frames with 50 ACLs and 500,000 routes. Since they're using 64-byte frames, this translates to roughly 32.4Mpps. Finally, there is recent work in FreeBSD (which is part of 11.1-RELEASE) that gets performance up to 2x the level of netmap-fwd or the work by Nanako Momiyama. 10 million PPS: Here (http://blog.cochard.me/2015/09/receipt-for-building-10mpps-freebsd.html) is a decent introduction. But of course, even as FreeBSD gets up to being able to do 10gbps at line-rate, 40 and 100 gigabits are not uncommon now Even with the fastest modern CPUs, this is very little time to do any kind of meaningful packet processing. At 10Gbps, your total budget per packet, to receive (Rx) the packet, process the packet, and transmit (Tx) the packet is 67.2 ns. Complicating the task is the simple fact that main memory (RAM) is 70 ns away. The simple conclusion here is that, even at 10Gbps, if you have to hit RAM, you can't generate the PPS required for line-rate forwarding. There is some detail about design tradeoffs in the Ryzen architecture and how that might impact using those machines as routers Anyway... those are all interesting, but the natural winner here is FD.io's Vector Packet Processing (VPP). Read this (http://blogs.cisco.com/sp/a-bigger-helping-of-internet-please) VPP is an efficient, flexible open source data plane. It consists of a set of forwarding nodes arranged in a directed graph and a supporting framework. The framework has all the basic data structures, timers, drivers (and interfaces to both DPDK and netmap), a scheduler which allocates the CPU time between the graph nodes, performance and debugging tools, like counters and built-in packet trace. The latter allows you to capture the paths taken by the packets within the graph with high timestamp granularity, giving full insight into the processing on a per-packet level. The net result here is that Cisco (again, Cisco) has shown the ability to route packets at 1 Tb/s using VPP on a four socket Purley system There is also much discussion of the future of pfSense, as they transition to using VPP This is a very lengthy write up which deserves a full read, plus there are some comments from other people *** RETGUARD, the OpenBSD next level in exploit mitigation, is about to debut (https://marc.info/?l=openbsd-tech&m=150317547021396&w=2) This year I went to BSDCAN in Ottawa. I spent much of it in the 'hallway track', and had an extended conversation with various people regarding our existing security mitigations and hopes for new ones in the future. I spoke a lot with Todd Mortimer. Apparently I told him that I felt return-address protection was impossible, so a few weeks later he sent a clang diff to address that issue... The first diff is for amd64 and i386 only -- in theory RISC architectures can follow this approach soon. The mechanism is like a userland 'stackghost' in the function prologue and epilogue. The preamble XOR's the return address at top of stack with the stack pointer value itself. This perturbs by introducing bits from ASLR. The function epilogue undoes the transform immediately before the RET instruction. ROP attack methods are impacted because existing gadgets are transformed to consist of " RET". That pivots the return sequence off the ROP chain in a highly unpredictable and inconvenient fashion. The compiler diff handles this for all the C code, but the assembly functions have to be done by hand. I did this work first for amd64, and more recently for i386. I've fixed most of the functions and only a handful of complex ones remain. For those who know about polymorphism and pop/jmp or JOP, we believe once standard-RET is solved those concerns become easier to address seperately in the future. In any case a substantial reduction of gadgets is powerful. For those worried about introducing worse polymorphism with these "xor; ret" epilogues themselves, the nested gadgets for 64bit and 32bit variations are +1 "xor %esp,(%rsp); ret", +2 "and $0x24,%al; ret" and +3 "and $0xc3,%al; int3". Not bad. Over the last two weeks, we have received help and advice to ensure debuggers (gdb, egdb, ddb, lldb) can still handle these transformed callframes. Also in the kernel, we discovered we must use a smaller XOR, because otherwise userland addresses are generated, and cannot rely on SMEP as it is really new feature of the architecture. There were also issues with pthreads and dlsym, which leads to a series of uplifts around _builtinreturn_address and DWARF CFI. Application of this diff doesn't require anything special, a system can simply be built twice. Or shortcut by building & installing gnu/usr.bin/clang first, then a full build. We are at the point where userland and base are fully working without regressions, and the remaining impacts are in a few larger ports which directly access the return address (for a variety of reasons). So work needs to continue with handling the RET-addr swizzle in those ports, and then we can move forward. You can find the full message with the diff here (https://marc.info/?l=openbsd-tech&m=150317547021396&w=2) *** Interview - Ed Maste, Charlie & Siva - @ed_maste (https://twitter.com/ed_maste), @yzgyyang (https://twitter.com/yzgyyang) & @svmhdvn (https://twitter.com/svmhdvn) Co-op Students for the FreeBSD Foundation *** News Roundup Next DFly release will have an initial HAMMER2 implementation (http://lists.dragonflybsd.org/pipermail/users/2017-August/313558.html) The next DragonFly release (probably in September some time) will have an initial HAMMER2 implementation. It WILL be considered experimental and won't be an installer option yet. This initial release will only have single-image support operational plus basic features. It will have live dedup (for cp's), compression, fast recovery, snapshot, and boot support out of the gate. This first H2 release will not have clustering or multi-volume support, so don't expect those features to work. I may be able to get bulk dedup and basic mirroring operational by release time, but it won't be very efficient. Also, right now, sync operations are fairly expensive and will stall modifying operations to some degree during the flush, and there is no reblocking (yet). The allocator has a 16KB granularity (on HAMMER1 it was 2MB), so for testing purposes it will still work fairly well even without reblocking. The design is in a good place. I'm quite happy with how the physical layout turned out. Allocations down to 1KB are supported. The freemap has a 16KB granularity with a linear counter (one counter per 512KB) for packing smaller allocations. INodes are 1KB and can directly embed 512 bytes of file data for files 512 bytes. The freemap is also zoned by type for I/O locality. The blockrefs are 'fat' at 128 bytes but enormously powerful. That will allow us to ultimately support up to a 512-bit crypto hash and blind dedup using said hash. Not on release, but that's the plan. I came up with an excellent solution for directory entries. The 1KB allocation granularity was a bit high but I didn't want to reduce it. However, because blockrefs are now 128 byte entities, and directory entries are hashed just like in H1, I was able to code them such that a directory entry is embedded in the blockref itself and does not require a separate data reference or allocation beyond that. Filenames up to 64 bytes long can be accomodated in the blockref using the check-code area of the blockref. Longer filenames will use an additional data reference hanging off the blockref to accomodate up to 255 char filenames. Of course, a minimum of 1KB will have to be allocated in that case, but filenames are

Britain, 1979. To most people in the 70's, computers were monstrous, bleeping big-brother machines the size of a bus with hundreds of valves and great reels of magnetic tape. They were expensive to run and difficult to understand, and certainly, not something any of us would want at home. Clive Sinclair, a serial inventor, thought differently. He saw that the next step in modern computing was to create a small, affordable machine that could be used alongside our existing televisions and cassette players at home. His idea was to give the general public a tool to learn, organise and play on, that they could programme themselves. So, in 1979, he gave us the ZX80 - a home computer with a 1KB memory, no sound and a monochrome display. It may seem strange to us now, but that temperamental (and sometimes glitchy) little beauty launched the home computer industry that surrounds us today.

　　“失控的电话费，变相的旅游费，膨胀的医药费，高昂的交通费，巨额的会议费，惊人的吃喝费”，有人这样形容眼下机关里的报销制度。　　飞猪在上中学那阵子，老去电脑城晃悠，发现经常有叔叔阿姨，不管是D版光盘还是数码相机，买什么他们都要开票，开多大的票都写“办公用品”。那时候他觉得叔叔阿姨们的纳税意识真强，也兴致勃勃地去开“办公用品”，立刻遭遇了服务员的白眼，从此在幼小的心灵里落下了严重的办公用品阴影。　　时代在变，用“办公用品”充账已经越来越落伍，去首饰店、内衣店开“办公用品”也不太行得通，于是，某村想出了一个新招，并且打算在全国范围内大力推广…… 　　时长: 3'38" / 文件体积: 852.1KB / 主持: 平客