• Facebook
• Twitter
• Reddit
• LinkedIn

Del 4 al 6 de octubre se ha celebrado la LinuxCon edición Europa en Berlín, Alemania. Como puedes imaginar ésta, es una conferencia alrededor del kernel de Linux. Desde la web de la Fundación Linux puedes acceder a dichas presentaciones, que a continuación listo:

• Linux Kernel Security Update
• Ceph and Flash
• Efficient kernel backporting
• Making More Open: Creating open source infrastructure for your open source project
• Flowgrind: a TCP traffic generator for developers
• Efficient unit test and fuzz tools for kernel/libc porting
• Adding CPU frequency scaling for your ARM platform to Linux kernel
• entry_*.S: A carefree stroll through kernel entry code
• The Set of Programmers: How Math Restricts Us
• Why you hate security, and what you can do about it.
• The world of 100G Networking
• lguest: A journey of learning the Linux kernel internals
• Gender-Diversity Analysis of Technical Contributions to the Linux Kernel
• Chrome OS running Android in a container
• ELK: a log files management framework
• Bringing Android Explicit Fencing to Mainline: A new era for graphics
• Solving the Paradox: Less Downtime - More Security
• Application Profiling and Tuning – Or How I Stopped Worrying and Learned to Love the Tweak
• Using the Linux Tracing Infrastructure
• Deploying pNFS over Distributed File Storage
• Outreachy kernel internship report
• Strategic use of Free Software at Siemens
• Reimagining OpenStack
• Locking Down your systemd Services
• How Linux keeps mission critical application up 24x7
• Persistent Memory usage within Linux environment
• How Google Uses and Contributes to Open Source
• Linux DRM: new picture processing API
• openQA - Avoiding Disasters of Biblical Proportions
• Boosting Enterprise Transaction Processing using Hardware Acceleration
• Geo-Replication and Disaster recovery for cloud object storage with Ceph Rados Gateway
• Linux-Kernel Memory Ordering: Help Arrives At Last!
• Real life example of scaling load balancing using open source on commodity hardware
• Tutorial on Persistent Memory Programming with NVML
• Extending programming languages with persistent memory semantics
• PM Infrastructure in the Linux Kernel - Current Status and Future
• Open Enterprise & Open Community - Empowering Each Other
• If You Build It, They Won't Come
• NorNet -- Building an Inter-Continental Internet Testbed based on Open Source Software
• Clang: Much more than just a C/C++ compiler
• Tracking huge files with Git LFS
• Persistent Memory Extensions to libstdc++/libc++
• Graphite@Scale or How to store millon metrics per second
• Kernel Development - I still think we have a scaling problem
• Documenting Your Software Supply Chain with Linked Data

• Facebook
• Twitter
• Reddit
• LinkedIn

Hace algún tiempo publicamos una entrada sobre una guía creada por Google para convertirte en un buen ingeniero de software.

John Washam tiene un objetivo, y es el de convertirse en un empleado de Google. Para ello a creado en Github un repositorio con una amplia lista de recursos, que según él, debes conocer para que Google te contrate. Como decía, la lista es bastante amplia y va mucho más allá de ser una lista de recursos para ser contratado por Google, con ésta tienes bastante información para convertirte en un gran ingeniero de software.

En dicha guía puedes encontrar: teoría sobre estructura de datos y algoritmos, plan de estudio, libros, vídeos, clases, retos de programación, consejos durante la entrevista de trabajo, etc. El objetivo es prepararte para esa ansiada entrevista de trabajo.

Os dejo aquí el índice para que os hagáis una idea del contenido:

• What is it?
• Why use it?
• How to use it
• Get in a Googley Mood
• Did I Get the Job?
• Follow Along with Me
• Don't feel you aren't smart enough
• About Video Resources
• Interview Process & General Interview Prep
• Prerequisite Knowledge
• The Daily Plan
• Algorithmic complexity / Big-O / Asymptotic analysis
• Data Structures
  • Arrays
  • Linked Lists
  • Stack
  • Queue
  • Hash table
• More Knowledge
  • Endianness
  • Binary search
  • Bitwise operations
• Trees
  • Trees - Notes & Background
  • Binary search trees: BSTs
  • Heap / Priority Queue / Binary Heap
  • Tries
  • Balanced search trees
  • N-ary (K-ary, M-ary) trees
• Sorting
• Graphs
• Even More Knowledge
  • Recursion
  • Dynamic Programming
  • Combinatorics (n choose k) & Probability
  • NP, NP-Complete and Approximation Algorithms
  • Garbage collection
  • Caches
  • Processes and Threads
  • System Design, Scalability, Data Handling
  • About Google
  • Papers
  • Unicode
  • Emacs and vi(m)
  • Unix command line tools
  • Testing
  • Design patterns
  • Scheduling
  • Implement system routines
  • String searching & manipulations
• Final Review
• Books
• Coding exercises/challenges
• Once you're closer to the interview
• Your Resume
• Be thinking of for when the interview comes
• Have questions for the interviewer
• Additional Learnings (not required)
  • Information theory
  • Parity & Hamming Code
  • Entropy
  • Cryptography
  • Compression
  • Networking
  • Computer Security
  • Parallel Programming
  • Messaging, Serialization, and Queueing Systems
  • Fast Fourier Transform
  • Bloom Filter
  • van Emde Boas Trees
  • Augmented Data Structures
  • Skip lists
  • Network Flows
  • Disjoint Sets & Union Find
  • Math for Fast Processing
  • Treap
  • Linear Programming
  • Geometry, Convex hull
  • Discrete math
  • Machine Learning
  • Go
• Additional Detail on Some Subjects
• Video Series
• Once You've Got The Job

• Facebook
• Twitter
• Reddit
• LinkedIn

Fuente: https://toggl.com/programming-princess