MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named Evripidis Bampis – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 11 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • A Note on Scheduling to Meet Two Min-Sum Objectives  
  • by Eric Angel Evripidis, Eric Angel, Evripidis Bampis, Aleksei V. Fishkin — 2002
  • …We consider the problem of scheduling a set of independent jobs on a single machine where a solution is evaluated with respect to two min-sum objective functions: the sum of completion times and the sum of weighted completion times. In particular, we are interested in (; )- approximation schedul…
  • Add To MetaCart
  • Minimizing the Overhead for Some Tree-Scheduling Problems  
  • by Evripidis Bampis, Frederic Guinand, Denis Trystram — 1996
  • …This paper is devoted to the study of tree-scheduling problems within the execution model described by Anderson, Beame and Ruzzo [3]. We first prove the NP-completeness of the problem of minimizing the overhead for scheduling trees on m processors, and then we propose an algorithm that provides o…
  • Add To MetaCart
  • Some Models for Scheduling Parallel Programs with Communication Delays  
  • by Evripidis Bampis, Frederic Guinand, Denis Trystram — 1997 — Discrete Applied Mathematics, special issue on scheduling
  • …The aim of this paper is to present and analyze models for designing parallel programs. In the context of some extensions of the most popular execution models (precedence graphs, dataflow, PRAM), we describe scheduling techniques which take into account the communication delays. We illustrate all…
  • Cited by 6 (4 self) – Add To MetaCart
  • Scheduling UET-UCT Series-Parallel Graphs on Two Processors  
  • by Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis — 1996 — Theoretical Computer Science
  • …The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unit-execution-time, and arcs are associated with unit-communication-time delays. The problem is to assign the tasks to the two processors and schedule their execution in order to minimize the make…
  • Cited by 9 (0 self) – Add To MetaCart
  • HOW GOOD ARE SPT SCHEDULES FOR FAIR OPTIMALITY CRITERIA  
  • by Eric Angel, Evripidis Bampis, Fanny Pascual
  • …Abstract We consider the following scheduling setting: a set of tasks have to be executed on a set of identical machines. It is well known that shortest processing time (SPT) schedules are optimal for the problem of minimizing the total sum of completion times of the tasks. In this paper, we measure…
  • Add To MetaCart
  • The Scheduling and Wavelength Assignment Problem in Optical WDM Networks  
  • by Evripidis Bampis And, Evripidis Bampis, George N. Rouskas, Senior Member — 2002 — IEEE/OSA Journal of Lightwave Technology
  • …We consider a scheduling problem, which we call the scheduling and wavelength assignment (SWA) problem, arising in optical networks that are based on the wavelength-divisionmultiplexing (WDM) technology. We prove that the SWA problem is-complete for both the preemptive and the nonpreemptive cases. F…
  • Add To MetaCart
  • Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates  
  • by Foto Afrati Evripidis, Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, Maxim Sviridenko — 1999 — In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science
  • …We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel …
  • Add To MetaCart
  • Scheduling of Independent Dedicated Multiprocessor Tasks  
  • by Evripidis Bampis, Massimiliano Caramia, Jiri Fiala, Aleksei V. Fishkin, Antonio Iovanella — 2002
  • …We study the o and on-line versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespeci ed processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [12], it has been proven that in the case when all task…
  • Cited by 1 (0 self) – Add To MetaCart
  • Scheduling to Minimize the Average Completion Time of Dedicated Tasks  
  • by Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon — 2000
  • …We propose a polynomial time approximation scheme for scheduling a set of dedicated tasks on a constant number m of processors in order to minimize the sum of completion times Pmjx j j P C j . In addition we give a polynomial time approximation scheme for the weighted preemptive problem with …
  • Cited by 10 (3 self) – Add To MetaCart
  • Scheduling of Independent Dedicated Multiprocessor Tasks  
  • by Evripidis Bampis Massimiliano, Massimiliano Caramia, Jir Fiala, Aleksei V. Fishkin, Antonio Iovanella — 2002
  • …We study the offline and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [13], it has been proven that in the case when all t…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB