algorithms   75011

« earlier    

Improving load balancing with a new consistent-hashing algorithm
When a request arrives, compute the average load [...] Multiply the average load by c to get a “target load”
To dispatch a request, compute its hash and the nearest server, as usual. If that server is below its capacity, then assign the request to that server. Otherwise, go to the next server in the hash ring and check its capacity, continuing until you find a server that has capacity remaining.

After switching to the bounded-load algorithm, a much bigger fraction of requests hit local cache, regardless of how many servers were running.
Before the change, each memcached server reached as high as 400 or 500 Mbit/s in outgoing bandwidth during peak hours (about 8Gbit/s in total). Afterwards, there’s less variation, and the servers stay comfortably below 100 Mbit/s each.

What’s not graphed is performance, in terms of response times. Why? Because they stayed exactly the same. The least-connection policy was doing a good job of keeping servers from getting overloaded, and fetching things from memcached is fast enough that it doesn’t have a measurable effect on the response times.
algorithms  loadbalancing 
3 hours ago by orange
Improving load balancing with a new consistent-hashing algorithm
An overview/explanation of various Consistent Hashing algorithms.
algorithms  cs  loadbalancing  hashing 
3 hours ago by orange
GitHub - trekhleb/javascript-algorithms: Algorithms and data structures implemented in JavaScript with explanations and links to further readings
This repository contains JavaScript based examples of many popular algorithms and data structures.

Each algorithm and data structure have its own separate README with related explanations and links for further reading and YouTube videos.
algorithms  datastructures  Javascript 
15 hours ago by euler
On the history of the transportation and maximum flow problems
We review two papers that are of historical interest for combinatorial optimization: an article of A.N.Tolstoi from 1930, in which the transportation problem is studied, and a negative cycle criterion is developed and applied to solve a (for that time)large-scale (10X68) transportation problem to optimality; andan,until recently secret,RAND report of T.E.Harris and F.S. Rossfrom 1955, that Ford and Fulkerson mention as motivation to study the maximum flow problem. The papers have in common that they both apply their methods to the Soviet railway network.
networks  combinatorics  optimization  algorithms 
17 hours ago by rvenkat
Algorithms as culture: Some tactics for the ethnography of algorithmic systems - Nick Seaver, 2017
This article responds to recent debates in critical algorithm studies about the significance of the term “algorithm.” Where some have suggested that critical scholars should align their use of the term with its common definition in professional computer science, I argue that we should instead approach algorithms as “multiples”—unstable objects that are enacted through the varied practices that people use to engage with them, including the practices of “outsider” researchers. This approach builds on the work of Laura Devendorf, Elizabeth Goodman, and Annemarie Mol. Different ways of enacting algorithms foreground certain issues while occluding others: computer scientists enact algorithms as conceptual objects indifferent to implementation details, while calls for accountability enact algorithms as closed boxes to be opened. I propose that critical researchers might seek to enact algorithms ethnographically, seeing them as heterogeneous and diffuse sociotechnical systems, rather than rigidly constrained and procedural formulas. To do so, I suggest thinking of algorithms not “in” culture, as the event occasioning this essay was titled, but “as” culture: part of broad patterns of meaning and practice that can be engaged with empirically. I offer a set of practical tactics for the ethnographic enactment of algorithmic systems, which do not depend on pinning down a singular “algorithm” or achieving “access,” but which rather work from the partial and mobile position of an outsider.
Research  algorithms 
yesterday by paulbradshaw

« earlier    

related tags

2018  academia  ai  algorithm  algos  apolocupisnique  are  art  at  averaging  añosluz  behaviour  bestpractices  bias  bigdata  book  books  c  classification  climatechange  code  combinatorics  company  compilers  compsci  computer-science  computers  content  control  cs  cstheory  cv  data-structures  data  data_science  datajustice  datalog  datamining  datascience  datastructures  davidhockney  db  dc:creator=strosscharles  dctagged  decentralization  decisiontree  decisiontrees  deep-learning  design  dev  digital  dystopia  ebook  ebooks  economics  es6  ethical  eubanks  examples  facebook  fairness  filter  filtering  free  fun  functional  games  github  go  goodread  google  graphics  guardian  hacker-news-comments  hacking  hashing  hatred  inequality  instagram  interesting  interviews  issue  java  javafx  javascript  jm  jorgecarrión  journalism  js  kalman-filter  kalman  kj  labor  learning  linklist  loadbalancing  location  luxury  machine-learning  machinelearning  mariomontalbetti  marketing  martingayford  material  math  maths  mazes  migration  ml  monitoring  nationalism  natupoblet  network  networks  now  numpy  opensource  optimization  our  paper  paracaídas  performance  poetry  policing  politics  portfolio  poverty  print  problems  programming  puzzle  python  radlib  random  recommender-systems  reference  repository  research  rubik  rust  shuffle  stack-overflow  statistics  surveillance  swa  t  technology  theory  thoughts?  tools  trends  tutorial  ux  virtual  visualisation  visualization  weight  well-designed-documents  whitesupremacism  writing  xenophobia  éricsadin   

Copy this bookmark: