Browsing by Subject "Scheduling"

Now showing items 1-20 of 53

    • Article  

      An abductlve-based scheduler for air-crew assignment 

      Kakas, Antonis C.; Michael, Antonia (2001)
      This article presents the design and implementation of an air-crew assignment system, for producing and refining a solution to this problem, based on the artificial intelligence principles and techniques of abductive ...
    • Conference Object  

      Adaptive linear quadratic design with application to F-16 fighter aircraft 

      Huo, Y.; Mirmirani, M.; Ioannou, Petros A.; Colgren, R. (2004)
      This paper investigates an adaptive linear quadratic (ALQ) control design with its application to the longitudinal model of the F-16 fighter aircraft. The certainty equivalence principle is used to combine the adaptive law ...
    • Article  

      Air-crew scheduling through abduction 

      Kakas, Antonis C.; Michael, Antonia (1999)
      This paper presents the design and implementation of an aircrew assignment system based on the Artificial Intelligence principles and techniques of abductive reasoning as captured by the framework of Abductive Logic ...
    • Article  

      Architectural support for data-driven execution 

      Matheou, George; Evripidou, Paraskevas (2014)
      The exponential growth of sequential processors has come to an end, and thus, parallel processing is probably the only way to achieve performance growth. We propose the development of parallel architectures based on ...
    • Article  

      Balancing wireless data broadcasting and information hovering for efficient information dissemination 

      Liaskos, Christos K.; Xeros, Andreas; Papadimitriou, Georgios I.; Lestas, Marios; Pitsillides, Andreas (2012)
      Wireless data broadcasting is an efficient, bandwidth preserving way of data dissemination. However, as the amount of data increases, the waiting time of the clients becomes unacceptably high. The present paper proposes ...
    • Article  

      Block Scheduling of Iterative Algorithms and Graph-Level Priority Scheduling in a Simulated Data-Flow Multiprocessor 

      Evripidou, Paraskevas; Gaudiot, J. -L (1993)
      While data-flow principles permit the utilization of large-scale multiprocessor systems with high programmability and good efficiency, they also introduce much overhead at runtime. In this paper, we have studied an important ...
    • Article  

      Broadcast scheduling with multiple concurrent costs 

      Liaskos, Christos K.; Xeros, Andreas; Papadimitriou, Georgios I.; Lestas, Marios; Pitsillides, Andreas (2012)
      Data dissemination via periodic broadcasting considers a set of items, each with a given request probability, size and scheduling cost. The goal is to construct a broadcast schedule that minimizes the mean query serving ...
    • Article  

      CacheFlow: A short-term optimal cache management policy for data driven multithreading 

      Kyriacou, Costas; Evripidou, Paraskevas; Trancoso, Pedro (2004)
      With Data Driven Multithreading a thread is scheduled for execution only if all of its inputs have been produced and placed in the processor's local memory. Scheduling based on data availability may be used to exploit ...
    • Article  

      CacheFlow: Cache optimizations for data driven multithreading 

      Kyriacou, Costas; Evripidou, Paraskevas; Trancoso, Pedro (2006)
      Data-Driven Multithreading is a non-blocking multithreading model of execution that provides effective latency tolerance by allowing the computation processor do useful work, while a long latency event is in progress. With ...
    • Conference Object  

      Characterization of computational grid resources using low-level benchmarks 

      Tsouloupas, George; Dikaiakos, Marios D. (2006)
      An important factor that needs to be taken into account by end-users and systems (schedulers, resource brokers, policy brokers) when mapping applications to the Grid is the performance capacity of hardware resources attached ...
    • Article  

      Competitive analysis of task scheduling algorithms on a fault-prone machine and the impact of resource augmentation 

      Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Zavou, Elli (2015)
      Reliable task execution on machines that are prone to unpredictable crashes and restarts is both important and challenging, but not much work exists on the analysis of such systems. We consider the online version of the ...
    • Article  

      Computing Nash equilibria for scheduling on restricted parallel links 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2010)
      We consider the problem of routing nusers on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the ...
    • Conference Object  

      Computing Nash equilibria for scheduling on restricted parallel links 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2004)
      We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the ...
    • Conference Object  

      Constraint propagation in propositional planning 

      Sideris, A.; Dimopoulos, Yannis (2010)
      Planning as Satisfiability is a most successful approach to optimal propositional planning. It draws its strength from the efficiency of state-of-the-art propositional satisfiability solvers, combined with the utilization ...
    • Article  

      Construction imitating ants: Resource-unconstrained scheduling with artificial ants 

      Christodoulou, Symeon E. (2009-05)
      The paper presents a methodology to arrive at critical path calculations in construction networks by imitating the natural selection processes utilized by real-life ants in search of shortest paths to a food source, and ...
    • Book Chapter  

      DART: a data-driven processor architecture for real-time computing 

      Farquhar, William G.; Evripidou, Paraskevas (Publ by Elsevier Science Publishers B.V., 1993)
      This paper presents the design of DART, a Data-driven processor Architecture for Real-Time computing. The DART processor is designed to be the key building block in real-time multiprocessor systems that can handle multiple ...
    • Article  

      Data-driven multithreading using conventional microprocessors 

      Kyriacou, Costas; Evripidou, Paraskevas; Trancoso, Pedro (2006)
      This paper describes the Data-Driven Multithreading (DDM) model and how it may be implemented using off-the-shelf microprocessors. Data-Driven Multithreading is a nonblocking multithreading execution model that tolerates ...
    • Article  

      Data-Driven Thread Execution on Heterogeneous Processors 

      Arandi, Samer; Matheou, George; Kyriacou, Costas; Evripidou, Paraskevas (2017)
      In this paper we report our experience in implementing and evaluating the Data-Driven Multithreading (DDM) model on a heterogeneous multi-core processor. DDM is a non-blocking multithreading model that decouples the ...
    • Conference Object  

      DDM-VMc :The data-driven multithreading virtual machine for the cell processor 

      Arandi, Samer; Evripidou, Paraskevas (2011)
      In this paper we present the Data-Driven Multithreading Virtual Machine for the Cell Processor (DDM-VMc). Data-Driven Multithreading is a non-blocking multithreading model that decouples the synchronization from the ...
    • Article  

      Disorder considerations in resource-constrained scheduling 

      Christodoulou, Symeon E.; Ellinas, Georgios N.; Aslani, Pooyan (2009)
      A method is presented for allocating resources to construction activities and for scheduling construction projects under resource constraints by considering the effects that such resource limitations may have on the tendency ...