Abstract: A system and method for minimizing cache conflicts and synchronization support for generated parallel tasks within a compiler framework. A compiler comprises library functions to generate a queue for parallel applications and divides it into windows. A window may be sized to fit within a first-level cache of a processor. Application code with producer and consumer patterns within a loop construct has these patterns split into producer and consumer tasks. Within a producer task loop, a function call is placed for a push operation that modifies a memory location within a producer sliding window without a check for concurrent accesses. A consumer task loop has a similar function call. At the time a producer or consumer task is ready to move, or slide, to an adjacent window, its corresponding function call determines if the adjacent window is available.

Abstract: A task queue management technique leverages infrastructure provided by file and operating systems to manage task queues substantially without otherwise typical problems regarding management of the size of the queue and/or the state of the queue (e.g., empty or full) while maintaining, regulating and altering the queue and the order of tasks in the queue. Task producer code is configurable to cause one or more executable files corresponding to each of one or more tasks to be stored in a queue directory responsive to receiving the one or more tasks. A file system associates each executable file with a time stamp indicating when the executable file was stored. Task consumer code is configurable to execute the one or more executable files in an order indicated by the time stamps associated with the executable files and to remove each executable file after execution of each executable file.