Sujet : call queue and multithreading? De : fir (at) *nospam* grunge.pl (fir) Groupes :comp.lang.c Date : 23. Mar 2024, 10:17:29 Autres entêtes Organisation : i2pn2 (i2pn.org) Message-ID :<utm6nd$2pbjl$1@i2pn2.org> User-Agent : Mozilla/5.0 (Windows NT 5.1; rv:27.0) Gecko/20100101 Firefox/27.0 SeaMonkey/2.24
i presented my idea of adding a keyword queue to c that will build internal queue of function calls and then run it after the scope of parent function ends like void f() { queued f1(); queued f2(); queued f3(); } will do (behind the scene) internal_queue[0].fp = f1; internal_queue[1].fp = f2; internal_queue[2].fp = f3; for(int i=0; i<internal_queue_top) internal_queue[i].fp() it aslo should hold the arguments in the queue but i oomitted it for simplicity (i mean it might be done in few ways and i dont want to consider now which one is better) thete is also not fully clear for me when to call the queue, i assume for now after the parent scope ends but maybe there would be needed explicit keyword to run it and meybe c should offer few queues like queued(1) f1(); //queue number one such internal queue is good thing for sure imo (or more caustios to say - seem good for sure) it gives handy way of decomposition like sai i will calc mandelbrot code i could write for(int j=0; j<image_height; j++) queued calc_mandelbrot_vertical_line(j); and though it not gives much of benefit - it just generates queue of saj 900 pointers the advantage is 1) it is simple 2) closes us to paralelisation - as if weare able to run queues in parralel this all to do it for simple paralelisation for(int j=0; j<image_height; j++) queued(1) calc_mandelbrot_vertical_line(j); run_queue_pararelly(1); //some keyword here needed //code here 'waits' untill full queue is executed and thats is - implementation could depend on copmpiler and hardware manufacturers (it should be run in cpu cores managed by some manager but maybe also on some hardware that more resembles gpu channel sets etc) tghis is in fact probably better thet those kernels i was writing back then here above i assume that the queue queued a tasks that are common ram-write independant.. the question is qhat to do here with some other tasks that are somewhat colliding i cannot find hovever for me any exampla good for consideration for this i mean somewhat colliding tasks that i could think of to be queued and what i would need to add yet to help to deal with (manage) that collisions maybe someone knows such example for consideration?