From charlesreid1

No edit summary
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 5: Line 5:
* where in structure, depth, iterations, etc.
* where in structure, depth, iterations, etc.


Traveling salesman problem:
Architecture:


* depth first search on a graph, searching for the shortest path to visit all nodes
* Use [[Zmq]]
* code instrumentation: current shortest path, number of paths searched
* Zmq client is code running on device, populating message queue
* Zmq server is server listening for messages, filtering takes place on server
 
N queens problem:
 
* searching for number of ways to arrange n queens on the chessboard
* code instrumentation: current portion of tree (vector of queen placements), number of solutions found
* profiling: netdata on host machine
* profiling: netdata on host machine


Line 15: Line 21:




 
[[Category:Python]]


[[Category:2018]]
[[Category:2018]]
[[Category:February 2018]]
[[Category:February 2018]]
[[Category:Python]]
[[Category:Netdata]]
[[Category:TSP]]
[[Category:Java]]

Latest revision as of 21:42, 17 February 2018

Here's what we're doing:

  • Running CPU intensive code
  • cpu, memory, threads, file size
  • where in structure, depth, iterations, etc.

Architecture:

  • Use Zmq
  • Zmq client is code running on device, populating message queue
  • Zmq server is server listening for messages, filtering takes place on server

N queens problem:

  • searching for number of ways to arrange n queens on the chessboard
  • code instrumentation: current portion of tree (vector of queen placements), number of solutions found
  • profiling: netdata on host machine