Now showing items 1-16 of 16

    • Auto-parallelizing stateful distributed streaming applications 

      Schneider, S.; Hirzel, M.; Gedik, B.G.; Wu, K.-L. (2012)
      Streaming applications transform possibly infinite streams of data and often have both high throughput and low latency requirements. They are comprised of operator graphs that produce and consume data tuples. The streaming ...
    • Code scheduling for optimizing parallelism and data locality 

      Yemliha, T.; Kandemir, M.; Ozturk, O.; Kultursay, E.; Muralidhara, S. P. (Springer, 2010)
      As chip multiprocessors proliferate, programming support for these devices is likely to receive a lot of attention in the near future. Parallelism and data locality are two critical issues in a chip multiprocessor environment. ...
    • Compiler-directed energy reduction using dynamic voltage scaling and voltage islands for embedded systems 

      Ozturk, O.; Kandemir, M.; Chen G. (Institute of Electrical and Electronics Engineers, 2013)
      Addressing power and energy consumption related issues early in the system design flow ensures good design and minimizes iterations for faster turnaround time. In particular, optimizations at software level, e.g., those ...
    • A decoupled local memory allocator 

      Diouf, B.; Hantaş, C.; Cohen, A.; Özturk, Ö.; Palsberg, J. (Association for Computing Machinery, 2013)
      Compilers use software-controlled local memories to provide fast, predictable, and power-efficient access to critical data. We show that the local memory allocation for straight-line, or linearized programs is equivalent ...
    • Efficient vectorization of forward/backward substitutions in solving sparse linear equations 

      Aykanat, C.; Özgü, Ö.; Güven, N. (IEEE, 1994)
      Vector processors have promised an enormous increase in computing speed for computationally intensive and time-critical power system problems which require the repeated solution of sparse linear equations. Due to short ...
    • G-free: Defeating return-oriented programming through gadget-less binaries 

      Onarlioglu, K.; Bilge, L.; Lanzi, A.; Balzarotti, D.; Kirda, E. (I E E E Computer Society, 2010)
      Despite the numerous prevention and protection mechanisms that have been introduced into modern operating systems, the exploitation of memory corruption vulnerabilities still represents a serious threat to the security of ...
    • Hybrid stacked memory architecture for energy efficient embedded chip-multiprocessors based on compiler directed approach 

      Onsori, S.; Asad, A.; Ozturk, O.; Fathy, M. (Institute of Electrical and Electronics Engineers Inc., 2016)
      Energy consumption becomes the most critical limitation on the performance of nowadays embedded system designs. On-chip memories due to major contribution in overall system energy consumption are always significant issue ...
    • Integrated scheduling and tool management in flexible manufacturing systems 

      Aktürk, M. S.; Özkan, S. (Taylor & Francis, 2001)
      A multistage algorithm is proposed that will solve the scheduling problem in a flexible manufacturing system by considering the interrelated subproblems of processing time control, tool allocation and machining conditions ...
    • Optimizing local memory allocation and assignment through a decoupled approach 

      Diouf, B.; Ozturk, O.; Cohen, A. (Springer, 2010)
      Software-controlled local memories (LMs) are widely used to provide fast, scalable, power efficient and predictable access to critical data. While many studies addressed LM management, keeping hot data in the LM continues ...
    • Optimizing shared cache behavior of chip multiprocessors 

      Kandemir, M.; Muralidhara, S.P.; Narayanan, S.H.K.; Zhang, Y.; Ozturk O. (2009)
      One of the critical problems associated with emerging chip multiprocessors (CMPs) is the management of on-chip shared cache space. Unfortunately, single processor centric data locality optimization schemes may not work ...
    • Profiler and compiler assisted adaptive I/O prefetching for shared storage caches 

      Son, S.W.; Kandemir, M.; Kolcu I.; Muralidhara, S.P.; Ozturk O.; Karakoy, M. (2008)
      I/O prefetching has been employed in the past as one of the mech- anisms to hide large disk latencies. However, I/O prefetching in parallel applications is problematic when multiple CPUs share the same set of disks due to ...
    • Safe data parallelism for general streaming 

      Schneider S.; Hirzel M.; Gedik, B.; Wu, Kun-Lung (Institute of Electrical and Electronics Engineers, 2015)
      Streaming applications process possibly infinite streams of data and often have both high throughput and low latency requirements. They are comprised of operator graphs that produce and consume data tuples. General streaming ...
    • A scratch-pad memory aware dynamic loop scheduling algorithm 

      Ozturk O.; Kandemir, M.; Narayanan, S.H.K. (2008)
      Executing array based applications on a chip multiprocessor requires effective loop parallelization techniques. One of the critical issues that need to be tackled by an optimizing compiler in this context is loop scheduling, ...
    • Slicing based code parallelization for minimizing inter-processor communication 

      Kandemir, M.; Zhang, Y.; Muralidhara, S.P.; Ozturk O.; Narayanan, S.H.K. (2009)
      One of the critical problems in distributed memory multi-core architectures is scalable parallelization that minimizes inter-processor communication. Using the concept of iteration space slicing, this paper presents a new ...
    • SPM management using markov chain based data access prediction 

      Yemliha, T.; Srikantaiah, S.; Kandemir, M.; Ozturk O. (2008)
      Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is crucial to extract maximum performance from application programs. While regular accesses like scalar values and array expressions ...
    • Using data compression for increasing memory system utilization 

      Ozturk, O.; Kandemir, M.; Irwin, M. J. (Institute of Electrical and Electronics Engineers, 2009-06)
      The memory system presents one of the critical challenges in embedded system design and optimization. This is mainly due to the ever-increasing code complexity of embedded applications and the exponential increase seen in ...