Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stella C. S. Porto

> Home > Persons

Person information

affiliation: Fluminense Federal University, Brazil

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2000
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/pc/PortoKR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/PortoKR00
Stella C. S. Porto, Joao Paulo Kitajima, Celso C. Ribeiro:
Performance evaluation of a parallel tabu search task scheduling algorithm. Parallel Comput. 26(1): 73-90 (2000)

1990 – 1999

see FAQ

What is the meaning of the colors in the publication lists?

1999
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/rairo/MaculanPRS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/MaculanPRS99
Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza:
A new formulation for scheduling unrelated processor under precedence constraints. RAIRO Oper. Res. 33(1): 87-92 (1999)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/sccc/SilvaP99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sccc/SilvaP99
Mariangela L. Silva, Stella C. S. Porto:
An Object-Oriented Approach to a Parallel Tabu Search Algorithm for the Task Scheduling Problem. SCCC 1999: 105-111
1998
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/vecpar/KitajimaP98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/vecpar/KitajimaP98
Joao Paulo Kitajima, Stella C. S. Porto:
Using Synthetic Workloads for Parallel Task Scheduling Improvement Analysis. VECPAR 1998: 480-493
1996
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/heuristics/PortoR96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/heuristics/PortoR96
Stella C. S. Porto, Celso C. Ribeiro:
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. J. Heuristics 1(2): 207-223 (1996)
1995
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ijhsc/PortoR95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijhsc/PortoR95
Stella C. S. Porto, Celso C. Ribeiro:
A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints. Int. J. High Speed Comput. 7(1): 45-71 (1995)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/BarbosaP95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BarbosaP95
Valmir Carneiro Barbosa, Stella C. S. Porto:
An Algorithm for FIFO Message Delivery Among Migrating Tasks. Inf. Process. Lett. 53(5): 261-267 (1995)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jpdc/MenasceSPAT95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/MenasceSPAT95
Daniel A. Menascé, Debanjan Saha, Stella C. S. Porto, Virgílio A. F. Almeida, Satish K. Tripathi:
Static and Dynamic Processor Scheduling Disciplines in Heterogeneous Parallel Architectures. J. Parallel Distributed Comput. 28(1): 1-18 (1995)
1992
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/MenascePT92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/MenascePT92
Daniel A. Menascé, Stella C. S. Porto, Satish K. Tripathi:
Processor Assignment in Heterogeneous Parallel Architectures. IPPS 1992: 186-191

Coauthor Index

see FAQ

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.