메뉴 건너뛰기




Volumn 3503, Issue , 2005, Pages 391-402

Dynamic application placement under service and memory constraints

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; PROBLEM SOLVING; SERVERS;

EID: 24944473004     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_34     Document Type: Conference Paper
Times cited : (16)

References (10)
  • 3
    • 0031142402 scopus 로고    scopus 로고
    • Using duplication for scheduling unitary tasks on m processors with unit communication delays
    • A. Munier and C. Hanen, Using duplication for scheduling unitary tasks on m processors with unit communication delays, Theoret. Comput. Sci. 178 (1997), 119-127.
    • (1997) Theoret. Comput. Sci. , vol.178 , pp. 119-127
    • Munier, A.1    Hanen, C.2
  • 4
    • 0025418536 scopus 로고
    • Towards an architecture-independent analysis of parallel algorithms
    • C. Papadimitriou and M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19 (1990), 322-328.
    • (1990) SIAM J. Comput. , vol.19 , pp. 322-328
    • Papadimitriou, C.1    Yannakakis, M.2
  • 6
    • 0141982763 scopus 로고    scopus 로고
    • On two class-constrained versions of the multiple knapsack problem
    • H. Shachnai and T. Tamir, On two class-constrained versions of the multiple knapsack problem, Algorithmica 29 (2001), 442-467.
    • (2001) Algorithmica , vol.29 , pp. 442-467
    • Shachnai, H.1    Tamir, T.2
  • 10
    • 84861242734 scopus 로고    scopus 로고
    • http://www.ibm.com/software/webservers/appserv/extend/


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.